From falsification to verification

Doron Peled; Amir Pnueli; Lenore Zuck

doi:10.1007/3-540-45294-x_25

From falsification to verification

Doron Peled, Amir Pnueli, Lenore Zuck

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

37 Scopus citations

Abstract

This paper enhances the linear temporal logic model checking process with the ability to automatically generate a deductive proof that the system meets its temporal specification. Thus, we emphasize the point of view that model checking can also be used to justify why the system actually works. We show that, by exploiting the information in the graph that is generated during a failed search for counterexamples, we can generate a fully deductive proof that the system meets its specification.

Original language	English
Title of host publication	FST TCS 2001
Subtitle of host publication	Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings
Editors	Ramesh Hariharan, V. Vinay, Madhavan Mukund
Publisher	Springer Verlag
Pages	292-304
Number of pages	13
ISBN (Print)	3540430024
DOIs	https://doi.org/10.1007/3-540-45294-x_25
State	Published - 2001
Externally published	Yes
Event	21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001 - Bangalore, India Duration: 13 Dec 2001 → 15 Dec 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2245
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001
Country/Territory	India
City	Bangalore
Period	13/12/01 → 15/12/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Access to Document

10.1007/3-540-45294-x_25

Cite this

Peled, D., Pnueli, A., & Zuck, L. (2001). From falsification to verification. In R. Hariharan, V. Vinay, & M. Mukund (Eds.), FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings (pp. 292-304). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2245). Springer Verlag. https://doi.org/10.1007/3-540-45294-x_25

Peled, Doron ; Pnueli, Amir ; Zuck, Lenore. / From falsification to verification. FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings. editor / Ramesh Hariharan ; V. Vinay ; Madhavan Mukund. Springer Verlag, 2001. pp. 292-304 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cc0c7780ac1e438382d72dc4d4a89d76,

title = "From falsification to verification",

abstract = "This paper enhances the linear temporal logic model checking process with the ability to automatically generate a deductive proof that the system meets its temporal specification. Thus, we emphasize the point of view that model checking can also be used to justify why the system actually works. We show that, by exploiting the information in the graph that is generated during a failed search for counterexamples, we can generate a fully deductive proof that the system meets its specification.",

author = "Doron Peled and Amir Pnueli and Lenore Zuck",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001 ; Conference date: 13-12-2001 Through 15-12-2001",

year = "2001",

doi = "10.1007/3-540-45294-x_25",

language = "אנגלית",

isbn = "3540430024",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "292--304",

editor = "Ramesh Hariharan and V. Vinay and Madhavan Mukund",

booktitle = "FST TCS 2001",

address = "גרמניה",

}

Peled, D, Pnueli, A & Zuck, L 2001, From falsification to verification. in R Hariharan, V Vinay & M Mukund (eds), FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2245, Springer Verlag, pp. 292-304, 21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001, Bangalore, India, 13/12/01. https://doi.org/10.1007/3-540-45294-x_25

From falsification to verification. / Peled, Doron; Pnueli, Amir; Zuck, Lenore.
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings. ed. / Ramesh Hariharan; V. Vinay; Madhavan Mukund. Springer Verlag, 2001. p. 292-304 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2245).

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

TY - GEN

T1 - From falsification to verification

AU - Peled, Doron

AU - Pnueli, Amir

AU - Zuck, Lenore

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - This paper enhances the linear temporal logic model checking process with the ability to automatically generate a deductive proof that the system meets its temporal specification. Thus, we emphasize the point of view that model checking can also be used to justify why the system actually works. We show that, by exploiting the information in the graph that is generated during a failed search for counterexamples, we can generate a fully deductive proof that the system meets its specification.

AB - This paper enhances the linear temporal logic model checking process with the ability to automatically generate a deductive proof that the system meets its temporal specification. Thus, we emphasize the point of view that model checking can also be used to justify why the system actually works. We show that, by exploiting the information in the graph that is generated during a failed search for counterexamples, we can generate a fully deductive proof that the system meets its specification.

UR - http://www.scopus.com/inward/record.url?scp=84944045904&partnerID=8YFLogxK

U2 - 10.1007/3-540-45294-x_25

DO - 10.1007/3-540-45294-x_25

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84944045904

SN - 3540430024

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 292

EP - 304

BT - FST TCS 2001

A2 - Hariharan, Ramesh

A2 - Vinay, V.

A2 - Mukund, Madhavan

PB - Springer Verlag

T2 - 21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001

Y2 - 13 December 2001 through 15 December 2001

ER -

Peled D, Pnueli A, Zuck L. From falsification to verification. In Hariharan R, Vinay V, Mukund M, editors, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings. Springer Verlag. 2001. p. 292-304. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45294-x_25

From falsification to verification

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this