Sciweavers

24 search results - page 2 / 5
» Inferring Loop Invariants Using Postconditions
Sort
View
116
Voted
CAV
2011
Springer
202views Hardware» more  CAV 2011»
14 years 4 months ago
Simplifying Loop Invariant Generation Using Splitter Predicates
Abstract. We present a novel static analysis technique that substantially improves the quality of invariants inferred by standard loop invariant generation techniques. Our techniqu...
Rahul Sharma 0001, Isil Dillig, Thomas Dillig, Ale...
95
Voted
APLAS
2005
ACM
15 years 2 months ago
Loop Invariants on Demand
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
K. Rustan M. Leino, Francesco Logozzo
126
Voted
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 6 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
112
Voted
APSEC
2005
IEEE
15 years 6 months ago
Tool Support for Invariant Based Programming
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...
Ralph-Johan Back, Magnus Myreen
106
Voted
CADE
2007
Springer
16 years 26 days 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