On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
DOI10.1007/978-3-662-44465-8_41zbMath1426.68127OpenAlexW1757339714MaRDI QIDQ2922635
Gergely Kovásznai, Andreas Fröhlich, Helmut Veith, Armin Biere
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_41
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
This page was built for publication: On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic