Beyond regular model checking

DOI10.1007/3-540-45294-X_14MaRDI QIDQ4474215zbMATH OpenFDO

Authors Dana Fisman, Amir Pnueli

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2245/22450156.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• CONCUR 2004 - Concurrency Theory
• Regular model checking
• Regular model checking revisited
• Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
• Regular model checking using widening techniques

Cited in

(15)

• Generalizing input-driven languages: theoretical and practical benefits
• Operator precedence and the visibly pushdown property
• Iterating transducers
• Finite reasons for safety. Parameterized verification by finite model finding
• Tree regular model checking: a simulation-based approach
• New Challenges in Model Checking
• scientific article; zbMATH DE number 1232242 (Why is no real title available?)
• Regular model checking using widening techniques
• Verification: Theory and Practice
• CONCUR 2004 - Concurrency Theory
• Computer Aided Verification
• Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
• Regular model checking: evolution and perspectives
• Regular model checking revisited
• Just verification of mutual exclusion algorithms

This page was built for publication: Beyond regular model checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474215)