8 citations · 9 across the 3 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2016★ 8 cited
Efficient CTL Verification via Horn Constraints Solving
Tewodros A. Beyene, Corneliu Popeea, Andrey Rybalchenko
The use of temporal logics has long been recognised as a fundamental approach to the formal specification and verification of reactive systems. In this paper, we take on the proble…
cs.LO2014★ 1 cited
CTL+FO Verification as Constraint Solving
Tewodros A. Beyene, Marc Brockschmidt, Andrey Rybalchenko
Expressing program correctness often requires relating program data throughout (different branches of) an execution. Such properties can be represented using CTL+FO, a logic that a…