Beyond regular model checking (extended abstract)

Dana Fisman, Amir Pnueli

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

12 Scopus citations

Abstract

In recent years, it has been established that regular model checking can be successfully applied to several parameterized verification problems. However, there are many parameterized verification problems that cannot be described by regular languages, and thus cannot be verified using regular model checking. In this study we try to practice symbolic model checking using classes of languages more expressive than the regular languages. We provide three methods for the uniform verification of non-regular parameterized systems.

Original languageEnglish
Title of host publicationFST TCS 2001
Subtitle of host publicationFoundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings
EditorsRamesh Hariharan, V. Vinay, Madhavan Mukund
PublisherSpringer Verlag
Pages156-170
Number of pages15
ISBN (Print)3540430024
DOIs
StatePublished - 1 Jan 2001
Externally publishedYes
Event21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001 - Bangalore, India
Duration: 13 Dec 200115 Dec 2001

Publication series

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

Conference

Conference21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001
Country/TerritoryIndia
CityBangalore
Period13/12/0115/12/01

Fingerprint

Dive into the research topics of 'Beyond regular model checking (extended abstract)'. Together they form a unique fingerprint.

Cite this