Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models

DOI10.1007/978-3-642-33654-6_4zbMath1367.68190OpenAlexW207961743WikidataQ56501400 ScholiaQ56501400MaRDI QIDQ2918971

Fabio Gadducci, Andrea Vandin, Alberto Lluch Lafuente

Publication date: 2 October 2012

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

Full work available at URL: http://eprints.imtlucca.it/1292/1/icgt2012.pdf

zbMATH Keywords

approximationssimulationsmodel checkingabstractiongraph logicsgraph transition systems

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)