Verification for robust specification

Doron Peled

doi:10.1007/bfb0028397

Verification for robust specification

Doron Peled

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

5 Scopus citations

Abstract

The choice of a specification formalism for describing properties of concurrent systems is influenced by several factors. Two of them are adequate expressiveness and the availability of verification tools. A factor that is less often taken into consideration is the ability to provide robust specification. InformMly, robust specifications cannot distinguish between behaviors that are essentiMly the same. The use of robust specifications can also provide some more practical advantages such as more manageable proof systems or more efficient automatic verification algorithms. We will present a formal definition for robustness in the framework of linear temporal logic, describe an algorithm for deciding robustness, and demonstrate how the knowledge of robustness can be exploited for verifying program correctness.

Original language	English
Title of host publication	Theorem Proving in Higher Order Logics - 10th International Conference, TPHOLs 1997, Proceedings
Editors	Elsa L. Gunter, Amy Felty
Publisher	Springer Verlag
Pages	231-241
Number of pages	11
ISBN (Print)	3540633790, 9783540633792
DOIs	https://doi.org/10.1007/bfb0028397
State	Published - 1997
Externally published	Yes
Event	10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 1997 - Murray Hill, United States Duration: 19 Aug 1997 → 22 Aug 1997

Publication series

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

Conference

Conference	10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 1997
Country/Territory	United States
City	Murray Hill
Period	19/08/97 → 22/08/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Access to Document

10.1007/bfb0028397

Cite this

Peled, D. (1997). Verification for robust specification. In E. L. Gunter, & A. Felty (Eds.), Theorem Proving in Higher Order Logics - 10th International Conference, TPHOLs 1997, Proceedings (pp. 231-241). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1275). Springer Verlag. https://doi.org/10.1007/bfb0028397

@inproceedings{c9b8ffe89728495699385a2252432b0b,

title = "Verification for robust specification",

abstract = "The choice of a specification formalism for describing properties of concurrent systems is influenced by several factors. Two of them are adequate expressiveness and the availability of verification tools. A factor that is less often taken into consideration is the ability to provide robust specification. InformMly, robust specifications cannot distinguish between behaviors that are essentiMly the same. The use of robust specifications can also provide some more practical advantages such as more manageable proof systems or more efficient automatic verification algorithms. We will present a formal definition for robustness in the framework of linear temporal logic, describe an algorithm for deciding robustness, and demonstrate how the knowledge of robustness can be exploited for verifying program correctness.",

author = "Doron Peled",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 1997 ; Conference date: 19-08-1997 Through 22-08-1997",

year = "1997",

doi = "10.1007/bfb0028397",

language = "אנגלית",

isbn = "3540633790",

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

publisher = "Springer Verlag",

pages = "231--241",

editor = "Gunter, {Elsa L.} and Amy Felty",

booktitle = "Theorem Proving in Higher Order Logics - 10th International Conference, TPHOLs 1997, Proceedings",

address = "גרמניה",

}

Peled, D 1997, Verification for robust specification. in EL Gunter & A Felty (eds), Theorem Proving in Higher Order Logics - 10th International Conference, TPHOLs 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1275, Springer Verlag, pp. 231-241, 10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 1997, Murray Hill, United States, 19/08/97. https://doi.org/10.1007/bfb0028397

Verification for robust specification. / Peled, Doron.
Theorem Proving in Higher Order Logics - 10th International Conference, TPHOLs 1997, Proceedings. ed. / Elsa L. Gunter; Amy Felty. Springer Verlag, 1997. p. 231-241 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1275).

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

TY - GEN

T1 - Verification for robust specification

AU - Peled, Doron

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

PY - 1997

Y1 - 1997

N2 - The choice of a specification formalism for describing properties of concurrent systems is influenced by several factors. Two of them are adequate expressiveness and the availability of verification tools. A factor that is less often taken into consideration is the ability to provide robust specification. InformMly, robust specifications cannot distinguish between behaviors that are essentiMly the same. The use of robust specifications can also provide some more practical advantages such as more manageable proof systems or more efficient automatic verification algorithms. We will present a formal definition for robustness in the framework of linear temporal logic, describe an algorithm for deciding robustness, and demonstrate how the knowledge of robustness can be exploited for verifying program correctness.

AB - The choice of a specification formalism for describing properties of concurrent systems is influenced by several factors. Two of them are adequate expressiveness and the availability of verification tools. A factor that is less often taken into consideration is the ability to provide robust specification. InformMly, robust specifications cannot distinguish between behaviors that are essentiMly the same. The use of robust specifications can also provide some more practical advantages such as more manageable proof systems or more efficient automatic verification algorithms. We will present a formal definition for robustness in the framework of linear temporal logic, describe an algorithm for deciding robustness, and demonstrate how the knowledge of robustness can be exploited for verifying program correctness.

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

U2 - 10.1007/bfb0028397

DO - 10.1007/bfb0028397

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

AN - SCOPUS:84949681860

SN - 3540633790

SN - 9783540633792

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

SP - 231

EP - 241

BT - Theorem Proving in Higher Order Logics - 10th International Conference, TPHOLs 1997, Proceedings

A2 - Gunter, Elsa L.

A2 - Felty, Amy

PB - Springer Verlag

T2 - 10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 1997

Y2 - 19 August 1997 through 22 August 1997

ER -

Peled D. Verification for robust specification. In Gunter EL, Felty A, editors, Theorem Proving in Higher Order Logics - 10th International Conference, TPHOLs 1997, Proceedings. Springer Verlag. 1997. p. 231-241. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/bfb0028397

Verification for robust specification

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this