52 citations · 267 across the 47 of their papers we have counts for
Showing 2012 · cs.LOShow all
2 papers · 2 filters
cs.LO2012★ 3 cited
Deterministic Automata for the (F,G)-fragment of LTL
Jan Křetínský, Javier Esparza
When dealing with linear temporal logic properties in the setting of e.g. games or probabilistic systems, one often needs to express them as deterministic omega-automata. In order…
cs.LO2012
Proving Termination of Probabilistic Programs Using Patterns
Javier Esparza, Andreas Gaiser, Stefan Kiefer
Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The a…