Symbolic Bounded Conformance Checking of Model Programs

Veanes, Margus; Bjørner, Nikolaj

doi:10.1007/978-3-642-11486-1_33

Cited by 3 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several computational complexity results about i/o-refinement are also studied in [42] (where i/o-refinement is called game conformance) that carry over to the general case of GLASs. There is a related notion of conformance of nondeterministic model programs [43] (that checks trace inclusion, rather than i/o-refinement). An interesting topic is to formally investigate its relation to i/o-refinement.…”

Section: Related Workmentioning

confidence: 99%

Alternating simulation and IOCO

Veanes

Bjørner

2011

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Buy / Rent full text

We propose a symbolic framework called guarded labeled assignment systems or GLASs and show how GLASs can be used as a foundation for symbolic analysis of various aspects of formal specification languages. We define a notion of i/o-refinement over GLASs as an alternating simulation relation and provide formal proofs that relate i/o-refinement to ioco. We show that non-i/o-refinement reduces to a reachability problem and provide a translation from bounded non-i/o-refinement or bounded non-ioco to checking first-order assertions.

show abstract

Section: Related Workmentioning

confidence: 99%

Alternating simulation and IOCO

Veanes

Bjørner

2011

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Buy / Rent full text

show abstract

“…Bounded model program checking (BMPC) problems are investigated in [36,37,33]. Bounded Conformance Checking [26] is a variant of BMPC where it is checked if two model programs are related using a refinement relation. The Bounded Input Output Conformance Problem [25] checks if programs are input-output conformant (ioco).…”

Section: Several Other Tools and Applicationsmentioning

confidence: 99%

Applications and Challenges in Satisfiability Modulo Theories

Moura¹,

Bjørner²

EPiC Series in Computing

View full text Add to dashboard Buy / Rent full text

The area of software analysis, testing and verification is now undergoing a revolution thanks to the use of automated and scalable support for logical methods. A well-recognized premise is that at the core of software analysis engines is invariably a component using logical formulas for describing states and transformations between system states. One can thus say that symbolic logic is the calculus of computation. The process of using this information for discovering and checking program properties (including such important properties as safety and security) amounts to automatic theorem proving. In particular, theorem provers that directly support common software constructs offer a compelling basis. Such provers are commonly called satisfiability modulo theories (SMT) solvers. Z3 is the leading SMT solver. It is developed by the authors at Microsoft Research. It can be used to check the satisfiability of logical formulas over one or more theories such as arithmetic, bit-vectors, lists, records and arrays.This paper examines three applications of Z3 in the context of invariant generation. The first lets Z3 infer invariants as a constraint satisfaction problem, the second application illustrates the use of Z3 for bit-precise analysis and our third application exemplifies using Z3 for calculations.

show abstract

Symbolic Bounded Conformance Checking of Model Programs

Cited by 3 publications

References 24 publications

Alternating simulation and IOCO

Alternating simulation and IOCO

Applications and Challenges in Satisfiability Modulo Theories

Contact Info

Product

Resources

About