Simple is better: efficient bounded model checking for past LTL

Authors:
Timo Latvala;Armin Biere;Keijo Heljanko;Tommi Junttila
Affiliations:
Laboratory for Theoretical Computer Science, Helsinki University of Technology, Finland;Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria;Laboratory for Theoretical Computer Science, Helsinki University of Technology, Finland;Laboratory for Theoretical Computer Science, Helsinki University of Technology, Finland
Venue:
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Year:
2005

Citing 14
Cited 11

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model Checking of Safety Properties

Formal Methods in System Design
Temporal Logic with Forgettable Past

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Fixpoint Based Encoding for Bounded Model Checking

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Synthesizing Monitors for Safety Properties

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Benefits of Bounded Model Checking at an Industrial Setting

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The Glory of the Past

Proceedings of the Conference on Logic of Programs
Accelerating Bounded Model Checking of Safety Properties

Formal Methods in System Design
Bounded model checking for past LTL

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties

Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Model Checking Abstract State Machines with Answer Set Programming

Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Automata-theoretic model checking revisited

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Improved SAT based bounded model checking

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Bounded model checking for weak alternating büchi automata

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Shortest counterexamples for symbolic model checking of LTL with past

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Incremental and complete bounded model checking for full PLTL

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Model Checking Abstract State Machines with Answer Set Programming

Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
A method for guided hazard identification and risk mitigation for offshore operations

SAFECOMP'12 Proceedings of the 31st international conference on Computer Safety, Reliability, and Security
A declarative framework for work process configuration

Artificial Intelligence for Engineering Design, Analysis and Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of bounded model checking for linear temporal logic with past operators (PLTL). PLTL is more attractive as a specification language than linear temporal logic without past operators (LTL) since many specifications are easier to express in PLTL . Although PLTL is not more expressive than LTL, it is exponentially more succinct. Our contribution is a new more efficient encoding of the bounded model checking problem for PLTL based on our previously presented encoding for LTL . The new encoding is linear in the bound. We have implemented the encoding in the NuSMV 2.1 model checking tool and compare it against the encoding in NuSMV by Benedetti and Cimatti. The experimental results show that our encoding performs significantly better than this previously used encoding.