Sciweavers

Share
35 search results - page 1 / 7
» Inferring Invariants by Symbolic Execution
Sort
View
ICSE
2008
IEEE-ACM
12 years 13 days ago
DySy: dynamic symbolic execution for invariant inference
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
Christoph Csallner, Nikolai Tillmann, Yannis Smara...
CADE
2007
Springer
11 years 12 months ago
Inferring Invariants by Symbolic Execution
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...
Benjamin Weiß, Peter H. Schmitt
ICSE
2010
IEEE-ACM
11 years 4 months ago
Using dynamic execution traces and program invariants to enhance behavioral model inference
Software behavioral models have proven useful for design, validation, veriļ¬cation, and maintenance. However, existing approaches for deriving such models sometimes overgeneraliz...
Ivo Krka, Yuriy Brun, Daniel Popescu, Joshua Garci...
CADE
2008
Springer
11 years 1 months ago
Aligator: A Mathematica Package for Invariant Generation (System Description)
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
Laura Kovács
CADE
2009
Springer
12 years 7 days ago
Interpolation and Symbol Elimination
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...
Andrei Voronkov, Laura Kovács
books