Simple is Better: Efficient Bounded Model Checking for Past LTL

Reference:

Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple is better: Efficient bounded model checking for past LTL. In Radia Cousot, editor, Proceedings of the 6th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'2005), volume 3385 of Lecture Notes in Computer Science, pages 380–395, Paris, France, January 2005. Springer-Verlag.

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.

Keywords:

Bounded Model Checking, Past LTL, NuSMV

Suggested BibTeX entry:

@inproceedings{LatBieHelJun:VMCAI05,
    address = {Paris, France},
    author = {Timo Latvala and Armin Biere and Keijo Heljanko and Tommi Junttila},
    booktitle = {Proceedings of the 6th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'2005)},
    editor = {Radia Cousot},
    month = {January},
    pages = {380--395},
    publisher = {Springer-Verlag},
    series = {Lecture Notes in Computer Science},
    title = {Simple is Better: Efficient Bounded Model Checking for Past {LTL}},
    volume = {3385},
    year = {2005},
}