Verification for robust specification

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


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 languageEnglish
Title of host publicationTheorem Proving in Higher Order Logics - 10th International Conference, TPHOLs 1997, Proceedings
EditorsElsa L. Gunter, Amy Felty
PublisherSpringer Verlag
Number of pages11
ISBN (Print)3540633790, 9783540633792
StatePublished - 1997
Externally publishedYes
Event10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 1997 - Murray Hill, United States
Duration: 19 Aug 199722 Aug 1997

Publication series

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


Conference10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 1997
Country/TerritoryUnited States
CityMurray Hill

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.


Dive into the research topics of 'Verification for robust specification'. Together they form a unique fingerprint.

Cite this