Symbolic model checking with rich assertional languages

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

Research output: Contribution to journalArticlepeer-review

82 Scopus citations


The paper shows that, by an appropriate choice of a rich assertional 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, and extending the technique to tree architectures.

Original languageEnglish
Pages (from-to)93-112
Number of pages20
JournalTheoretical Computer Science
Issue number1-2
StatePublished - 1 Aug 2001


  • Parametric systems
  • Regular expressions
  • Symbolic model checking
  • Tree automata

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


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

Cite this