Software model checking for people who love automata

Authors:
Matthias Heizmann;Jochen Hoenicke;Andreas Podelski
Affiliations:
University of Freiburg, Germany;University of Freiburg, Germany;University of Freiburg, Germany
Venue:
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Year:
2013

Citing 20
Cited 0

Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT 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
Relative Completeness of Abstraction Refinement for Software Model Checking

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Path invariants

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Control-flow refinement and progress invariants for bound analysis

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Nested interpolants

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reachability for linear hybrid automata using iterative relaxation abstraction

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Abstraction and counterexample-guided construction of ω-automata for model checking of step-discrete linear hybrid models

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Slicing abstractions

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Interpolation-based software verification with WOLVERINE

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Lazy abstraction with interpolants

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Trace partitioning in abstract interpretation based static analyzers

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Language-Theoretic abstraction refinement

FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Fixpoint-guided abstraction refinements

SAS'07 Proceedings of the 14th international conference on Static Analysis
High Performance Static Analysis for Industry

Electronic Notes in Theoretical Computer Science (ENTCS)
SMT-based false positive elimination in static program analysis

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Inductive data flow graphs

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof tree preserving interpolation

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Ultimate automizer with SMTInterpol

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this expository paper, we use automata for software model checking in a new way. The starting point is to fix the alphabet: the set of statements of the given program. We show how automata over the alphabet of statements can help to decompose the main problem in software model checking, which is to find the right abstraction of a program for a given correctness property.