39 citations · 57 across the 13 of their papers we have counts for
Showing 2016Show 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.PL2016★ 1 cited
Tighter Loop Bound Analysis (Technical report)
Pavel Čadek, Jan Strejček, Marek Trtík
We present a new algorithm for computing upper bounds on the number of executions of each program instruction during any single program run. The upper bounds are expressed as funct…