Scaling up the formal verification of Lustre programs with SMT-based techniques

Authors:
George Hagen;Cesare Tinelli
Affiliations:
The University of Iowa;The University of Iowa
Venue:
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Year:
2008

Citing 14
Cited 17

Programming and Verifying Real-Time Systems by Means of the Synchronous Data-Flow Language LUSTRE

IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
Improving efficiency of symbolic model checking for state-based system requirements

Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
SAT-Based Verification without State Space Traversal

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Checking Safety Properties Using Induction and a SAT-Solver

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Dynamic Partitioning in Linear Relation Analysis: Application to the Verification of Reactive Systems

Formal Methods in System Design
Counter-example generation in symbolic abstract model-checking

International Journal on Software Tools for Technology Transfer (STTT)
Accelerating high-level bounded model checking

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Verifying safety properties of lustre programs: an smt-based approach

Verifying safety properties of lustre programs: an smt-based approach
Structural abstraction of software verification conditions

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Integration of formal analysis into a model-based software development process

FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Bounded model checking of software using SMT solvers instead of SAT solvers

SPIN'06 Proceedings of the 13th international conference on Model Checking Software

Pragmatic equivalence and safety checking in Cryptol

Proceedings of the 3rd workshop on Programming languages meets program verification
SMT-AI: an Abstract Interpreter as Oracle for k-induction

Electronic Notes in Theoretical Computer Science (ENTCS)
Combining control and data abstraction in the verification of hybrid systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Strengthening induction-based race checking with lightweight static analysis

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems

Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Instantiation-based invariant discovery

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Automatic analysis of DMA races using model checking and k-induction

Formal Methods in System Design
Formal analysis of a triplex sensor voter in an industrial context

FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Logico-numerical abstract acceleration and application to the verification of data-flow programs

SAS'11 Proceedings of the 18th international conference on Static analysis
Software verification using k-induction

SAS'11 Proceedings of the 18th international conference on Static analysis
Automatic analysis of scratch-pad memory code for heterogeneous multicore processors

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Modular abstractions of reactive nodes using disjunctive invariants

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Tightening test coverage metrics: a case study in equivalence checking using k-induction

FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
versat: a verified modern SAT solver

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Incremental verification with mode variable invariants in state machines

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
SMT proof checking using a logical framework

Formal Methods in System Design
Compositional verification of a medical device system

Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in which Lustre's semantics is modeled very naturally, the tailoring to this logic of SAT-based k-induction and abstraction techniques, and the use of SMT solvers to reason efficiently in this logic. We discuss initial experimental results showing that our implementation of the approach is highly competitive with existing verification solutions for Lustre.