|
25
|
Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations
– Enric Rodríguez-carbonell, Deepak Kapur
- 2004
|
|
22
|
Automatically generating loop invariants using quantifier elimination
– Deepak Kapur
- 2005
|
|
21
|
Constructing Invariants for Hybrid Systems
– Sriram Sankaranarayanan, Henny Sipma, Zohar Manna
- 2004
|
|
5
|
Generation of basic semi-algebraic invariants using convex polyhedra
– Roberto Bagnara, Enric Rodríguez-carbonell, Enea Zaffanella
|
|
18
|
Path Invariants
– Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko
- 2006
|
|
10
|
Large Experimental Program Verification in the Theorema System
– Tudor Jebelean, Laura Kovács, Nikolaj Popov
- 2004
|
|
1
|
Automatic Verification of Loop Invariants
– Olivier Ponsini, Hélène Collavizza, Carine Fédèle, Claude Michel, Michel Rueher
|
|
2
|
Simplifying loop invariant generation using splitter predicates
– Rahul Sharma, Isil Dillig, Thomas Dillig, Alex Aiken
- 2011
|
|
|
Dynamic Partitioning in . . . -- Application To The Verification Of Reactive Systems
– Bertrand Jeannet
- 2000
|
|
16
|
A few graph-based relational numerical abstract domains
– Antoine Miné
- 2002
|
|
|
ACM Workshop on Strategic Directions in Computing Research
– Mit Laboratory, Patrick Cousot
|
|
3
|
Program Analysis Position Statement: The Abstract Interpretation Perspective
– P. Cousot
- 1996
|
|
|
ACKNOWLEDGMENTS
– Akash Lal
|
|
|
Intraprocedural Analysis and the Verification of Concurrent Programs
– Akash Lal
- 2009
|
|
23
|
Polynomial Constants are Decidable
– Markus Müller-olm, Helmut Seidl
- 2002
|
|
5
|
Reasoning Algebraically About P-Solvable Loops
– Laura Kovács
- 2008
|
|
9
|
Interprocedurally analyzing polynomial identities
– Markus Müller-Olm, Michael Petter, Helmut Seidl
- 2006
|
|
5
|
Verification constraint problems with strengthening
– Aaron R. Bradley, Zohar Manna
- 2006
|
|
|
Maximal and Compositional Pattern-Based Loop Invariants
– Virginia Aponte, Pierre Courtieu, Yannick Moy, Marc Sango
|
