Javier Esparza

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 122

Top Venues

Publications

Philipp Czerner, Javier Esparza, Valentin Krasotin
A Resolution-Based Interactive Proof System for UNSAT. CoRR (2024)
Javier Esparza, Rubén Rubio
Validity of contextual formulas (extended version). CoRR (2024)
Michael Blondin, Javier Esparza
Separators in Continuous Petri Nets. Log. Methods Comput. Sci. 20 (1) (2024)
Philipp Czerner, Javier Esparza, Valentin Krasotin, Christoph Welzel-Mohr
Computing Inductive Invariants of Regular Abstraction Frameworks. CONCUR (2024)
Philipp Czerner, Javier Esparza, Valentin Krasotin
A Resolution-Based Interactive Proof System for UNSAT. FoSSaCS (2) (2024)
Philipp Czerner, Javier Esparza, Valentin Krasotin, Christoph Welzel-Mohr
Computing Inductive Invariants of Regular Abstraction Frameworks. CoRR (2024)
Javier Esparza, Rubén Rubio
Validity of Contextual Formulas. CONCUR (2024)
Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza
Fast and succinct population protocols for Presburger arithmetic. J. Comput. Syst. Sci. 140 (2024)
Javier Esparza, Rubén Rubio, Salomon Sickert
Efficient Normalization of Linear Temporal Logic. J. ACM 71 (2) (2024)
Roland Guttenberg, Mikhail A. Raskin, Javier Esparza
Geometry of Reachability Sets of Vector Addition Systems. CONCUR (2023)
Eszter Couillard, Philipp Czerner, Javier Esparza, Rupak Majumdar
Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms. CAV (3) (2023)
Philipp Czerner, Javier Esparza, Jérôme Leroux
Lower bounds on the state complexity of population protocols. Distributed Comput. 36 (3) (2023)
Javier Esparza, Vincent Grande
Black-box Testing Liveness Properties of Partially Observable Stochastic Systems. CoRR (2023)
Eszter Couillard, Philipp Czerner, Javier Esparza, Rupak Majumdar
Making IP=PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms. CoRR (2023)
Javier Esparza, Vincent P. Grande
Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems. ICALP (2023)
Javier Esparza, Rubén Rubio, Salomon Sickert
A Simple Rewrite System for the Normalization of Linear Temporal Logic. CoRR (2023)
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. Log. Methods Comput. Sci. 19 (4) (2023)
Javier Esparza, Rubén Rubio, Salomon Sickert
Efficient Normalization of Linear Temporal Logic. CoRR (2023)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Regular Model Checking Upside-Down: An Invariant-Based Approach. CONCUR (2022)
Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza
Fast and Succinct Population Protocols for Presburger Arithmetic. SAND (2022)
Michael Blondin, Javier Esparza
Separators in Continuous Petri Nets. CoRR (2022)
Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata. Int. J. Softw. Tools Technol. Transf. 24 (4) (2022)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Regular Model Checking Upside-Down: An Invariant-Based Approach. CoRR (2022)
Michael Blondin, Javier Esparza
Separators in Continuous Petri Nets. FoSSaCS (2022)
Javier Esparza, Rubén Rubio, Salomon Sickert
A Simple Rewrite System for the Normalization of Linear Temporal Logic. Principles of Systems Design (2022)
Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza
Fast and Succinct Population Protocols for Presburger Arithmetic. CoRR (2022)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Computing Parameterized Invariants of Parameterized Petri Nets. Fundam. Informaticae 187 (2-4) (2022)
Philipp Czerner, Javier Esparza
Lower Bounds on the State Complexity of Population Protocols. CoRR (2021)
Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza
Decision Power of Weak Asynchronous Models of Distributed Computing. CoRR (2021)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Computing Parameterized Invariants of Parameterized Petri Nets. Petri Nets (2021)
Javier Esparza
The 2021 Alonzo Church award for outstanding contributions to logic and computation: call for nominations. ACM SIGLOG News 8 (1) (2021)
Javier Esparza
2021 Alonzo Church Award for Outstanding Contributions to Logic and Computation. Bull. EATCS 134 (2021)
Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza
Decision Power of Weak Asynchronous Models of Distributed Computing. PODC (2021)
Javier Esparza
Back to the Future: A Fresh Look at Linear Temporal Logic. CIAA (2021)
Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger
Enforcing ω-Regular Properties in Markov Chains by Restarting. CONCUR (2021)
Javier Esparza, Uri Zwick
TheoretiCS. Bull. EATCS 135 (2021)
Javier Esparza
Population Protocols: Beyond Runtime Analysis. CoRR (2021)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Computing Parameterized Invariants of Parameterized Petri Nets. CoRR (2021)
Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy
The complexity of verifying population protocols. Distributed Comput. 34 (2) (2021)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Abduction of trap invariants in parameterized systems. GandALF (2021)
Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer
Towards efficient verification of population protocols. Formal Methods Syst. Des. 57 (3) (2021)
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. FoSSaCS (2021)
Javier Esparza
Population Protocols: Beyond Runtime Analysis. RP (2021)
Philipp Czerner, Javier Esparza
Lower Bounds on the State Complexity of Population Protocols. PODC (2021)
Javier Esparza
State Complexity of Population Protocols (Invited Talk). FSTTCS (2021)
A. R. Balasubramanian, Javier Esparza, Marijana Lazic
Complexity of Verification and Synthesis of Threshold Automata. CoRR (2020)
A. R. Balasubramanian, Javier Esparza, Marijana Lazic
Complexity of Verification and Synthesis of Threshold Automata. ATVA (2020)
Javier Esparza, Fabian Reiter
A Classification of Weak Asynchronous Models of Distributed Computing. CoRR (2020)
Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CoRR (2020)
Javier Esparza, Jan Kretínský, Salomon Sickert
A Unified Translation of Linear Temporal Logic to ω-Automata. J. ACM 67 (6) (2020)
Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
Succinct Population Protocols for Presburger Arithmetic. STACS (2020)
Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CAV (2) (2020)
Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger
Online Monitoring ω-Regular Properties in Unknown Markov Chains. CoRR (2020)
Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel
Structural Invariants for the Verification of Systems with Parameterized Architectures. TACAS (1) (2020)
Javier Esparza, Fabian Reiter
A Classification of Weak Asynchronous Models of Distributed Computing. CONCUR (2020)
Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer
Peregrine 2.0: Explaining Correctness of Population Protocols Through Stage Graphs. ATVA (2020)
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. CoRR (2020)
Salomon Sickert, Javier Esparza
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. CoRR (2020)
Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer
Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs. CoRR (2020)
Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza
Flatness and Complexity of Immediate Observation Petri Nets. CONCUR (2020)
Salomon Sickert, Javier Esparza
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. LICS (2020)
Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel
Structural Invariants for the Verification of Systems with Parameterized Architectures. CoRR (2020)
Michael Blondin, Javier Esparza, Stefan Jaax
Expressive Power of Oblivious Consensus Protocols. CoRR (2019)
Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy
Parameterized Analysis of Immediate Observation Petri Nets. Petri Nets (2019)
Philipp J. Meyer, Javier Esparza, Philip Offtermatt
Computing the Expected Execution Time of Probabilistic Workflow Nets. TACAS (2) (2019)
Jörg Desel, Javier Esparza, Philipp Hoffmann
Negotiation as concurrency primitive. Acta Informatica 56 (2) (2019)
Michael Blondin, Javier Esparza, Stefan Jaax
Expressive Power of Broadcast Consensus Protocols. CONCUR (2019)
Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy
Parameterized Analysis of Immediate Observation Petri Nets. CoRR (2019)
Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy
The Complexity of Verifying Population Protocols. CoRR (2019)
Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
Succinct Population Protocols for Presburger Arithmetic. CoRR (2019)
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
Soundness in negotiations. Log. Methods Comput. Sci. 14 (1) (2018)
Michael Blondin, Javier Esparza, Stefan Jaax
Large Flocks of Small Birds: On the Minimal Size of Population Protocols. CoRR (2018)
Michael Blondin, Javier Esparza, Stefan Jaax, Antonín Kucera
Black Ninjas in the Dark: Formal Analysis of Population Protocols. LICS (2018)
Michael Blondin, Javier Esparza, Stefan Jaax
Large Flocks of Small Birds: on the Minimal Size of Population Protocols. STACS (2018)
Philipp J. Meyer, Javier Esparza, Hagen Völzer
Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets. TACAS (2) (2018)
Javier Esparza, Jan Kretínský, Salomon Sickert
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata. CoRR (2018)
Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
Verification of Immediate Observation Population Protocols. CONCUR (2018)
Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
Verification of Immediate Observation Population Protocols. CoRR (2018)
Michael Blondin, Javier Esparza, Antonín Kucera
Automatic Analysis of Expected Termination Time for Population Protocols. CONCUR (2018)
Michael Blondin, Javier Esparza, Antonín Kucera
Automatic Analysis of Expected Termination Time for Population Protocols. CoRR (2018)
Javier Esparza, Jan Kretínský, Salomon Sickert
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata. LICS (2018)
Javier Esparza, Pierre Fraigniaud, Anca Muscholl, Sergio Rajsbaum
Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211). Dagstuhl Reports 8 (5) (2018)
Javier Esparza, Enrico Tronci
Preface for the special issue GandALF 2015. Acta Informatica 55 (2) (2018)
Philipp J. Meyer, Javier Esparza, Philip Offtermatt
Computing the Expected Execution Time of Probabilistic Workflow Nets. CoRR (2018)
Thomas Eiter, Javier Esparza, Catuscia Palamidessi, Gordon D. Plotkin, Natarajan Shankar
Alonzo Church Award 2018 - Call for Nominations. Bull. EATCS 124 (2018)
Michael Blondin, Javier Esparza, Stefan Jaax
Peregrine: A Tool for the Analysis of Population Protocols. CAV (1) (2018)
Philipp J. Meyer, Javier Esparza, Hagen Völzer
Computing the concurrency threshold of sound free-choice workflow nets. CoRR (2018)
Michael Blondin, Stefan Jaax, Javier Esparza, Philipp J. Meyer
Towards Efficient Verification of Population Protocols. CoRR (2017)
Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. TACAS (1) (2017)
Javier Esparza, Anca Muscholl, Igor Walukiewicz
Static Analysis of Deterministic Negotiations. CoRR (2017)
Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer
Towards Efficient Verification of Population Protocols. PODC (2017)
Javier Esparza
Advances in Parameterized Verification of Population Protocols. CSR (2017)
Javier Esparza, Anca Muscholl, Igor Walukiewicz
Static analysis of deterministic negotiations. LICS (2017)
Philipp J. Meyer, Matthias Rungger, Michael Luttenberger, Javier Esparza, Majid Zamani
Quantitative Implementation Strategies for Safety Controllers. CoRR (2017)
Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar
Model checking parameterized asynchronous shared-memory systems. Formal Methods Syst. Des. 50 (2-3) (2017)
Olli Saarikivi, Hernán Ponce de León, Kari Kähkönen, Keijo Heljanko, Javier Esparza
Minimizing Test Suites with Unfoldings of Multithreaded Programs. ACM Trans. Embed. Comput. Syst. 16 (2) (2017)
Javier Esparza, Philipp Hoffmann, Ratul Saha
Polynomial analysis algorithms for free choice Probabilistic Workflow Nets. Perform. Evaluation 117 (2017)
Javier Esparza
Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk). TIME (2017)
Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. CoRR (2017)
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
Verification of population protocols. Acta Informatica 54 (2) (2017)

Javier Esparza.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Javier Esparza