Shortest Counterexamples for Symbolic Model Checking of LTL with Past.

Victor Schuppan; Armin Biere

doi:10.1007/978-3-540-31980-1_32

Shortest Counterexamples for Symbolic Model Checking of LTL with Past.

Victor Schuppan, Armin Biere

Institute of Formal Models and Verification

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Original language	English
Title of host publication	Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2004, Proceedings
Publisher	Springer
Pages	493-509
Number of pages	16
Volume	3440
DOIs	https://doi.org/10.1007/978-3-540-31980-1_32
Publication status	Published - 2005

Publication series

Name	Lecture Notes in Computer Science (LNCS)
ISSN (Print)	0302-9743

Fields of science

102 Computer Sciences
102001 Artificial intelligence
102011 Formal languages
102022 Software development
102031 Theoretical computer science
603109 Logic
202006 Computer hardware

Access to Document

10.1007/978-3-540-31980-1_32

Cite this

Schuppan, V., & Biere, A. (2005). Shortest Counterexamples for Symbolic Model Checking of LTL with Past. In Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2004, Proceedings (Vol. 3440, pp. 493-509). (Lecture Notes in Computer Science (LNCS)). Springer. https://doi.org/10.1007/978-3-540-31980-1_32

Schuppan, Victor ; Biere, Armin. / Shortest Counterexamples for Symbolic Model Checking of LTL with Past. Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2004, Proceedings. Vol. 3440 Springer, 2005. pp. 493-509 (Lecture Notes in Computer Science (LNCS)).

@inproceedings{1e187214806a4aa1842e1e3e1807910d,

title = "Shortest Counterexamples for Symbolic Model Checking of LTL with Past.",

author = "Victor Schuppan and Armin Biere",

year = "2005",

doi = "10.1007/978-3-540-31980-1_32",

language = "English",

volume = "3440",

series = "Lecture Notes in Computer Science (LNCS)",

publisher = "Springer",

pages = "493--509",

booktitle = "Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2004, Proceedings",

}

Schuppan, V & Biere, A 2005, Shortest Counterexamples for Symbolic Model Checking of LTL with Past. in Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2004, Proceedings. vol. 3440, Lecture Notes in Computer Science (LNCS), Springer, pp. 493-509. https://doi.org/10.1007/978-3-540-31980-1_32

Shortest Counterexamples for Symbolic Model Checking of LTL with Past. / Schuppan, Victor; Biere, Armin.
Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2004, Proceedings. Vol. 3440 Springer, 2005. p. 493-509 (Lecture Notes in Computer Science (LNCS)).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

TY - GEN

T1 - Shortest Counterexamples for Symbolic Model Checking of LTL with Past.

AU - Schuppan, Victor

AU - Biere, Armin

PY - 2005

Y1 - 2005

U2 - 10.1007/978-3-540-31980-1_32

DO - 10.1007/978-3-540-31980-1_32

M3 - Conference proceedings

VL - 3440

T3 - Lecture Notes in Computer Science (LNCS)

SP - 493

EP - 509

BT - Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2004, Proceedings

PB - Springer

ER -

Schuppan V, Biere A. Shortest Counterexamples for Symbolic Model Checking of LTL with Past. In Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2004, Proceedings. Vol. 3440. Springer. 2005. p. 493-509. (Lecture Notes in Computer Science (LNCS)). doi: 10.1007/978-3-540-31980-1_32