Modularization and abstraction: The keys to practical formal verification

Yonit Kesten, Amir Pnueli

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

27 Scopus citations


In spite of the impressive progress in the development of the two main methods for formal verification of reactive systems - Model Checking (in particular symbolic) and Deductive Verification, they are still limited in their ability to handle large systems. It is generally recognized that the only way these methods can ever scale up is by the extensive use of abstraction and modularization, which breaks the task of verifying a large system into several smaller tasks of verifying simpler systems. In this methodological paper, we review the two main tools of compositionality and abstraction in the framework of linear temporal logic. We illustrate the application of these two methods for the reduction of an infinite-state system into a finite-state system that can then be verified using model checking. The modest technical contributions contained in this paper are a full formulation of abstraction when applied to a system with both weak and strong fairness requirements and to a general temporal formula, and a presentation of a compositional framework for shared variables and its application for forming network invariants.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 1998 - 23rd International Symposium, MFCS 1998, Proceedings
EditorsLubos Brim, Jozef Gruska, Jiri Zlatuska
PublisherSpringer Verlag
Number of pages18
ISBN (Print)3540648275, 9783540648277
StatePublished - 1 Jan 1998
Event23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS 1998 - Brno, Czech Republic
Duration: 24 Aug 199828 Aug 1998

Publication series

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


Conference23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS 1998
Country/TerritoryCzech Republic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Modularization and abstraction: The keys to practical formal verification'. Together they form a unique fingerprint.

Cite this