The constraint database approach to software verification

Authors:
Peter Revesz
Affiliations:
Max Planck Institut für Informatik, University of Nebraska-Lincoln
Venue:
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Year:
2007

Citing 18
Cited 2

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A closed-form evaluation for Datalog queries with integer (gap)-order constraints

ICDT Selected papers of the 4th international conference on Database theory
The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
Constraint query languages

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint query languages (preliminary report)

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Model checking

Model checking
The MLPQ/GIS constraint database system

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Introduction to constraint databases

Introduction to constraint databases
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking

Symbolic Model Checking
A Decompositional Approach for Computing Least Fixed-Pointsof Datalog Programs with Z-Counters

Constraints
Reachable state space analysis of LOTOS specifications

Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Symbolic Verification with Gap-Order Constraints

LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Delay Analysis in Synchronous Programs

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The Octagon Abstract Domain

WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Verifying the incorrectness of programs and automata

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation

CDB-PV: a constraint database-based program verifier

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Pentagons: A weakly relational abstract domain for the efficient validation of array accesses

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on constraint database techniques, we present a new approach to software verification. This new approach has some similarity to abstract interpretation that uses various widening operators; therefore, we call the new approach l-u widening. We show that our lu widening leads to a more precise over-approximation of the invariants in a program than comparable previously proposed widening operators based on difference-bound matrices, although l-u widening can be computed as efficiently as the other widening operators. We show that constraint database techniques can compute non-convex program invariants too. Finally, we give a compact representation of addition-bound matrices, which generalize difference-bound matrices.