Sciweavers

279 search results - page 4 / 56
» Invariant Patterns for Program Reasoning
Sort
View
SIGSOFT
2004
ACM
15 years 10 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
15 years 3 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
ECOOP
2011
Springer
13 years 9 months ago
Verifying Multi-object Invariants with Relationships
Relationships capture the interplay between classes in object-oriented programs, and various extensions of object-oriented programming languages allow the programmer to explicitly ...
Stephanie Balzer, Thomas R. Gross
ECOOP
2004
Springer
15 years 3 months ago
Object Invariants in Dynamic Contexts
Abstract. Object invariants describe the consistency of object-oriented data structures and are central to reasoning about the correctness of object-oriented software. Yet, reasoni...
K. Rustan M. Leino, Peter Müller
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 4 months ago
Reasoning about Memory Layouts
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
Holger Gast