Using Satisfiability Modulo Theories for Inductive Verification of Lustre Programs

Authors:
Anders Franzén
Affiliations:
Dip. Informatica e Telecomunicazioni, Università di Trento, Trento, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 7
Cited 4

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
Automatic Verification of Parameterized Cache Coherence Protocols

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Analyzing Infeasible Mixed-Integer and Integer Linear Programs

INFORMS Journal on Computing
Dynamic Partitioning in Linear Relation Analysis: Application to the Verification of Reactive Systems

Formal Methods in System Design
A SAT-based decision procedure for mixed logical/integer linear problems

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An incremental and layered procedure for the satisfiability of linear arithmetic logic

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

Automatic analysis of DMA races using model checking and k-induction

Formal Methods in System Design
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of verifying safety properties of Lustre programs with integer arithmetic have been attacked in several different ways. Abstract interpretation is used in NBAC, and inductive verification using a SAT solver is used in Luke. This paper presents a method of using Satisfiability Modulo Theories (SMT) as an incremental decision procedure for inductive verification of Lustre program. We show that even a very naive approach using SMT is competitive and in some instances complementary to other approaches.