2 citations · 4 across the 5 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2016
Negotiation as Concurrency Primitive
Joerg Desel, Javier Esparza, Philipp Hoffmann
This paper introduces negotiations, a model of concurrency close to Petri nets, with multi-party negotiations as concurrency primitive. We study two fundamental analysis problems.…
cs.LO2014★ 2 cited
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version)
Javier Esparza
We survey some results on the automatic verification of parameterized programs without identities. These are systems composed of arbitrarily many components, all of them running ex…
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…