Lifting Temporal Proofs through Abstractions

Namjoshi, Kedar S.

doi:10.1007/3-540-36384-x_16

Cited by 12 publications

(6 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…AIR is also adoptable for the purpose of using certifying model checking [23] for proof carrying code (PCC) [25]. Certifying model checking in combination with abstraction has been used [24,8] to construct invariants and ranking functions for the purpose of certifying source code. By generating source code from binaries, AIR enables us to leverage the above technology for the PCC-style certification of binaries.…”

Section: Discussionmentioning

confidence: 99%

Software model checking without source code

Chaki

Ivers

2010

Innovations Syst Softw Eng

View full text Add to dashboard Cite

We present a framework, called AIR, for verifying safety properties of assembly language programs via software model checking. AIR extends the applicability of predicate abstraction and counterexample guided abstraction refinement to the automated verification of low-level software. By working at the assembly level, AIR allows verification of programs for which source code is unavailable-such as legacy and COTS software-and programs that use features-such as pointers, structures, and object-orientation-that are problematic for source-level software verification tools. In addition, AIR makes no assumptions about the underlying compiler technology. We have implemented a prototype of AIR and present encouraging results on several non-trivial examples.

show abstract

Section: Discussionmentioning

confidence: 99%

Software model checking without source code

Chaki

Ivers

2010

Innovations Syst Softw Eng

View full text Add to dashboard Cite

show abstract

“…Namjoshi [27] has proposed a two-step technique for obtaining proofs of µ-calculus specifications on infinite-state systems. In the first step, a proof is obtained via certifying model checking.…”

Section: Related Workmentioning

confidence: 99%

SAT-Based Software Certification

Chaki

2006

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We formalize a notion of witnesses for satisfaction of linear temporal logic specifications by infinite state programs. We show how such witnesses may be constructed via predicate abstraction, and validated by generating verification conditions and proving them. We propose the use of SAT-based theorem provers and resolution proofs in proving these verification conditions. In addition to yielding extremely compact proofs, a SAT-based approach overcomes several limitations of conventional theorem provers when applied to the verification of programs written in real-life programming languages. We also formalize a notion of witnesses of simulation conformance between infinite state programs and finite state machine specifications. We present algorithms to construct simulation witnesses of minimal size by solving pseudo-Boolean constraints. We present experimental results on several non-trivial benchmarks which suggest that a SAT-based approach can yield extremely compact proofs, in some cases by a factor of over 10 5 , when compared to existing non-SAT-based theorem provers.

show abstract

“…Namjoshi et al [19,20] show that a simulation relation is the most general mapping to transfer proofs between S and T . However, discovering a simulation relation is difficult (e.g., [20] expects the relation to be provided by the user).…”

Section: Introductionmentioning

confidence: 99%

Automated Discovery of Simulation Between Programs

Fedyukovich¹,

Gurfinkel²,

Sharygina³

2014

View full text Add to dashboard Cite

Deciding equivalence between two programs (called a source and a target program) is often reduced to finding a simulation relation between them. This is computationally expensive and often requires a manual guidance. In this paper, we propose an abstraction-refinementguided approach, called SimAbs, to automatically construct a simulation relation between the source program and an abstraction of the target program. In our approach both the abstraction and the simulation relation are discovered automatically, and deciding whether a given relation is a simulation relation is reduced to deciding validity of a ∀∃-formula. We present a novel algorithm for deciding such formulas using an SMTsolver. In addition to deciding validity, our algorithm constructs a witnessing Skolem relation. These relations enable the refinement-step of SimAbs. We have implemented SimAbs using UFO framework and Z3 SMT-solver and applied it to finding simulation relations between C programs from the Software Verification Competition. Our empirical results show that SimAbs is efficient at finding a simulation relation. Report Documentation Page Form Approved OMB No. 0704-0188 Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.

show abstract

Lifting Temporal Proofs through Abstractions

Cited by 12 publications

References 30 publications

Software model checking without source code

Software model checking without source code

SAT-Based Software Certification

Automated Discovery of Simulation Between Programs

Contact Info

Product

Resources

About