Predicate abstraction of Java programs with collections
نویسندگان
چکیده
منابع مشابه
Predicate Abstraction of Programs with Non-linear Computation
Verification of programs relies on reasoning about the computations they perform. In engineering programs, many of these computations are non-linear. Although predicate abstraction enables model checking of programs with large state spaces, the decision procedures that currently support predicate abstraction are not able to handle such nonlinear computations. In this paper, we propose an approa...
متن کاملModel Checking Recursive Programs with Exact Predicate Abstraction
We propose an approach for analyzing non-termination and reachability properties of recursive programs using a combination of overand underapproximating abstractions. First, we define a new concrete program semantics, mixed, that combines both natural and operational semantics, and use it to design an on-the-fly symbolic algorithm. Second, we combine this algorithm with abstraction by following...
متن کاملExperimenting with Predicate Abstraction
Predicate abstraction is a technique employed in software model checking to produce abstract models that can be conservatively checked for property violations in reasonable time. The precision degree of different abstractions of the same program may differ based on (i) the set of predicates used; or (ii) the algorithmic technique employed to generate the model. In this paper we explain how we h...
متن کاملExperience with Predicate Abstraction
This reports some experiences with a recently-implemented prototype system for veriication using predicate abstraction, based on the method of Graf and Sa di 9]. Systems are described using a language of iterated guarded commands, called Mur ?? (since it is a simpliied version of our Mur protocol description language). The system makes use of two libraries: SVC 1] (an eecient decision procedure...
متن کاملAutomatic Verification of Golog Programs via Predicate Abstraction
Golog is a logic programming language for high-level agent control. In a recent paper, we proposed a sound but incomplete method for automatic verification of partial correctness of Golog programs where we give a number of heuristic methods to strengthen given formulas in order to discover loop invariants. However, our method does not work on arithmetic domains. On the other hand, the method of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2012
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2398857.2384623