FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897775
DOI10.1007/11590156zbMath1172.68521OpenAlexW2484051058MaRDI QIDQ5897775
Venkatesh P. Mysore, Amir Pnueli
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11590156
Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Algorithmic analysis of polygonal hybrid systems. I: Reachability ⋮ Deciding Concurrent Planar Monotonic Linear Hybrid Systems ⋮ Mortality and Edge-to-Edge Reachability are Decidable on Surfaces ⋮ Low dimensional hybrid systems -- decidable, undecidable, don't know ⋮ STORMED Hybrid Systems ⋮ Relaxing Goodness Is Still Good
