Predicate Abstraction with Under-approximation Refinement
From MaRDI portal
Publication:5310681
DOI10.2168/LMCS-3(1:5)2007zbMath1128.68054WikidataQ62039406 ScholiaQ62039406MaRDI QIDQ5310681
Radek Pelánek, Willem Visser, Corina S. Păsăreanu
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Test generation from event system abstractions to cover their states and transitions ⋮ An automatic method for the dynamic construction of abstractions of states of a formal model ⋮ Proving the existence of fair paths in infinite-state systems
