Dealing with incompleteness in automata-based model checking

DOI10.1007/978-3-319-48989-6_32zbMath1427.68170OpenAlexW2551192623MaRDI QIDQ2281650

Carlo Ghezzi, Paola Spoletini, Claudio Menghi

Publication date: 3 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-48989-6_32

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Integrating Topological Proofs with Model Checking to Instrument Iterative Design ⋮ Multi-robot LTL planning under uncertainty ⋮ TOrPEDO : witnessing model correctness with topological proofs ⋮ A verification-driven framework for iterative design of controllers

This page was built for publication: Dealing with incompleteness in automata-based model checking