35 search results - page 1 / 7 » Inferring Invariants by Symbolic Execution |
ICSE
2008
IEEE-ACM
14 years 5 months ago
2008
IEEE-ACM
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
CADE
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
ICSE
2010
IEEE-ACM
13 years 9 months ago
2010
IEEE-ACM
Software behavioral models have proven useful for design, validation, verification, and maintenance. However, existing approaches for deriving such models sometimes overgeneraliz...
CADE
2008
Springer
13 years 6 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We prove several results related to local proofs, interpolation and suion calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and...