2 citations · 2 across the 4 of their papers we have counts for
4 papers
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.…
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…
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…
Space-efficient scheduling of stochastically generated tasks
Tomáš Brázdil, Javier Esparza, Stefan Kiefer +1
We study the problem of scheduling tasks for execution by a processor when the tasks can stochastically generate new tasks. Tasks can be of different types, and each type has a fix…