Symbolic model checking with rich assertional languages

Y. Kesten, O. Maler, M. Marcus, A. Pnueli, E. Shahar

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

93 Scopus citations


The paper shows that, by an appropriate choice of a rich assertion at language, it is possible to extend the utility of symbolic model checking beyond the realm of BDD-represented finite-state systems into the domain of infinite-state systems, leading to a powerful technique for uniform verification of unbounded (parameterized) process networks. The main contributions of the paper are a formulation of a general framework for symbolic model checking of infinite-state systems, a demonstration that many individual examples of uniformly verified parameterized designs that appear in the literature are special cases of our general approach, verifying the correctness of the Futurebus+ design for all single bus configurations, extending the technique to tree architectures, and establishing that the presented method is a precise dual to the top-down invariant generation method used in deductive verification.

Original languageEnglish
Title of host publicationComputer Aided Verification - 9th International Conference, CAV 1997, Proceedings
EditorsOrna Grumberg
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540631666, 9783540631668
StatePublished - 1 Jan 1997
Externally publishedYes
Event9th International Conference on Computer-Aided Verification, CAV 1997 - Haifa, Israel
Duration: 22 Jun 199725 Jun 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


Conference9th International Conference on Computer-Aided Verification, CAV 1997

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Symbolic model checking with rich assertional languages'. Together they form a unique fingerprint.

Cite this