Synthesis for Unbounded Bit-Vector Arithmetic

DOI10.1007/978-3-642-31365-3_39zbMath1358.68198OpenAlexW1810520346MaRDI QIDQ2908521

Andrej Spielmann, Viktor Kuncak

Publication date: 5 September 2012

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31365-3_39

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Complexity of fixed-size bit-vector logics

This page was built for publication: Synthesis for Unbounded Bit-Vector Arithmetic