39 citations · 57 across the 13 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2016★ 1 cited
On the Complexity of the Quantified Bit-Vector Arithmetic with Binary Encoding
Martin Jonáš, Jan Strejček
We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths…
cs.LO2010
A Short Story of a Subtle Error in LTL Formulas Reduction and Divine Incorrectness
Tomáš Babiak, Mojmír Křetínský, Vojtěch Řehák +1
We identify a subtle error in LTL formulas reduction method used as one optimization step in an LTL to Büchi automata translation. The error led to some incorrect answers of the es…