Analysis of Boolean Programs

DOI10.1007/978-3-642-36742-7_16zbMath1381.68164OpenAlexW2135108322MaRDI QIDQ5326327

Mihalis Yannakakis, Patrice Godefroid

Publication date: 5 August 2013

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36742-7_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (4)

Model-checking structured context-free languages ⋮ The complexity gap in the static analysis of cache accesses grows if procedure calls are added ⋮ Automated synthesis of asynchronizations ⋮ On recursion-free Horn clauses and Craig interpolation

This page was built for publication: Analysis of Boolean Programs