An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking

DOI10.1007/978-3-540-93900-9_23zbMath1206.68190OpenAlexW1896342373MaRDI QIDQ3600481

Rotem Oshman

Publication date: 10 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-93900-9_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

The firing squad problem revisited

This page was built for publication: An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking