TCS / Research / Publications / Incremental and Complete Bounded Model Checking for Full PLTL
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Incremental and Complete Bounded Model Checking for Full PLTL

Reference:

Keijo Heljanko, Tommi Junttila, and Timo Latvala. Incremental and complete bounded model checking for full PLTL. In Kousha Etessami and Sriram K. Rajamani, editors, CAV 2005, volume 3576 of Lecture Notes in Computer Science, pages 98–111. Springer, 2005.

Suggested BibTeX entry:

@inproceedings{HeljankoJunttilaLatvala:CAV2005,
    author = {Keijo Heljanko and Tommi Junttila and Timo Latvala},
    booktitle = {CAV 2005},
    editor = {Kousha Etessami and Sriram K. Rajamani},
    pages = {98--111},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Incremental and Complete Bounded Model Checking for Full {PLTL}},
    volume = {3576},
    year = {2005},
}

This work is not available online here.

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.