2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.PL2016
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…
cs.FL2009★ 2 cited
Almost Linear Büchi Automata
Tomáš Babiak, Vojtěch Řehák, Jan Strejček
We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Buechi automata (BA) called Almost linear Buechi automata (ALBA). We provide effective tran…