This is a preview of subscription content, access via your institution. Rent this article via DeepDyve. Ball, R. Majumdar, T. Millstein, and S. Ball and S. Rajamani, "Boolean programs: A model and process for software analysis," Technical Report —14, Microsoft Research.
Google Scholar. Bensalem, Y. Lakhnech, and S. Owre, "Computing abstractions of infinite state systems compositionally and automatically," in A. Hu and M. Vardi Eds. Brat, K. Havelund, S. Park, and W. Chaki, E. Clarke, A. Groce, S. Jha, and H. Groce, and O. Clarke, O. Grumberg, S. Jha, Y. Lu, and V. Grumberg, and D. Clarke, M. Talupur, and D.
Colon and T. Uribe, "Generating finite—state abstractions of reactive systems using decision procedures," in Computer Aided Verification , , pp. Cousot and R. We have implemented this technique and report experimental results on a set of large ANSI-C programs using abstract domains that focus on properties related to string-buffers.
Hu, Alessandro Cimatti , Automated software verification has made great progress recently, and a key enabler of this progress has been the advances in efficient, automated decision procedures suitable for verification Boolean satisfiability solvers and satisfiability-modulo-theories SMT solvers. Verifying general soft Abstract - Cited by 12 1 self - Add to MetaCart Automated software verification has made great progress recently, and a key enabler of this progress has been the advances in efficient, automated decision procedures suitable for verification Boolean satisfiability solvers and satisfiability-modulo-theories SMT solvers.
Verifying general software, however, requires reasoning about unbounded, linked, heap-allocated data structures, which in turn motivates the need for a logical theory for such structures that includes unbounded reachability. So far, none of the available SMT solvers supports such a theory. In this paper, we present our integration of a decision procedure that supports unbounded heap reachability into an available SMT solver. Using the extended SMT solver, we can efficiently verify examples of heap-manipulating programs that we could not verify before.
It supports most of MATHSAT5 is freely available, and it is used in numerous internal projects, as well as by a number of industrial partners. Modelling and verification of systems such as communication, network and security protocols, which exhibit both probabilistic and non-deterministic behaviour, typically use Markov Decision Processes MDPs. For large, complex systems, abstraction techniques are essential. This paper builds on a prom Abstract - Cited by 9 6 self - Add to MetaCart Modelling and verification of systems such as communication, network and security protocols, which exhibit both probabilistic and non-deterministic behaviour, typically use Markov Decision Processes MDPs.
This paper builds on a promising approach for abstraction of MDPs based on stochastic two-player games which provides distinct lower and upper bounds for minimum and maximum probabilistic reachability properties.
Existing implementations work at the model level, limiting their scalability. In this paper, we develop language-level abstraction techniques that build game-based abstractions of MDPs directly from high-level descriptions in the PRISM modelling language, using predicate abstraction and SMT solvers.
For efficiency, we develop a compositional framework for abstraction. We have applied our techniques to a range of case studies, successfully verifying models larger than was possible with existing implementations. We are also able to demonstrate the benefits of adopting a compositional approach. Due to high computational costs of formal verification on pure Boolean level, proof techniques on the word level, like Satisfiability Modulo Theories SMT , were proposed.
Verification methods originally based on Boolean satisfiability SAT can directly benefit from this progress. In this work we p In this work we present the word level framework WoLFram that enables the development of applications for formal verification of systems independent of the underlying proof technique. The framework is partitioned into an application layer, a core engine and a back-end layer. A wide range of applications is implemented, e.
This makes WoLFram a stable backbone for the development and quick evaluation of emerging verification techniques. Abstract—Boolean manipulation and existential quantification of numeric variables from linear arithmetic LA formulas is at the core of many program analysis and software model checking techniques e. Abstract - Cited by 8 1 self - Add to MetaCart Abstract—Boolean manipulation and existential quantification of numeric variables from linear arithmetic LA formulas is at the core of many program analysis and software model checking techniques e.
We present a new data structure, Linear Decision Diagrams LDDs , to represent formu-las in LA and its fragments, which has certain properties that make it efficient for such tasks. Beyond this extension, we make three key contributions. Bahar R. Article Google Scholar. Ball, T. In: Margaria, T. Lecture Notes in Computer Science, vol. Springer-Verlag, Berlin In: Dwyer, M.
Springer, New York Beyer, D. In: Ball, T. In: Damm, W. Springer, Berlin Blanchet, B. Association for Computing Machinery, New York Bryant R. Bultan T. Cavada R. Cousot, P. Association for Computing Machinery, San Antonio Cousot P. Fischer, J. Graf, S. In: Grumberg, O. Gulavani, B. In: Ramakrishnan, C. Gulwani, S.
0コメント