default search action
Javier Esparza
Person information
- affiliation: TU Munich, Faculty of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j66]Javier Esparza, Rubén Rubio, Salomon Sickert:
Efficient Normalization of Linear Temporal Logic. J. ACM 71(2): 16:1-16:42 (2024) - [j65]Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Fast and succinct population protocols for Presburger arithmetic. J. Comput. Syst. Sci. 140: 103481 (2024) - [j64]Michael Blondin, Javier Esparza:
Separators in Continuous Petri Nets. Log. Methods Comput. Sci. 20(1) (2024) - [c164]Philipp Czerner, Javier Esparza, Valentin Krasotin, Christoph Welzel-Mohr:
Computing Inductive Invariants of Regular Abstraction Frameworks. CONCUR 2024: 19:1-19:18 - [c163]Javier Esparza, Rubén Rubio:
Validity of Contextual Formulas. CONCUR 2024: 24:1-24:17 - [c162]Philipp Czerner, Javier Esparza, Valentin Krasotin:
A Resolution-Based Interactive Proof System for UNSAT. FoSSaCS (2) 2024: 116-136 - [e12]Pawel Sobocinski, Ugo Dal Lago, Javier Esparza:
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024. ACM 2024 [contents] - [i66]Philipp Czerner, Javier Esparza, Valentin Krasotin:
A Resolution-Based Interactive Proof System for UNSAT. CoRR abs/2401.14996 (2024) - [i65]Philipp Czerner, Javier Esparza, Valentin Krasotin, Christoph Welzel-Mohr:
Computing Inductive Invariants of Regular Abstraction Frameworks. CoRR abs/2404.10752 (2024) - [i64]Javier Esparza, Rubén Rubio:
Validity of contextual formulas (extended version). CoRR abs/2407.07759 (2024) - [i63]Javier Esparza, Peter Rossmanith, Stefan Schwoon:
A Uniform Framework for Problems on Context-Free Grammars. CoRR abs/2410.19386 (2024) - [i62]Javier Esparza, Mogens Nielsen:
Decidability Issues for Petri Nets - a survey. CoRR abs/2411.01592 (2024) - 2023
- [j63]Philipp Czerner, Javier Esparza, Jérôme Leroux:
Lower bounds on the state complexity of population protocols. Distributed Comput. 36(3): 209-218 (2023) - [j62]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) - [c161]Eszter Couillard, Philipp Czerner, Javier Esparza, Rupak Majumdar:
Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms. CAV (3) 2023: 437-458 - [c160]Roland Guttenberg, Mikhail A. Raskin, Javier Esparza:
Geometry of Reachability Sets of Vector Addition Systems. CONCUR 2023: 6:1-6:16 - [c159]Javier Esparza, Vincent P. Grande:
Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems. ICALP 2023: 126:1-126:17 - [i61]Javier Esparza, Vincent P. Grande:
Black-box Testing Liveness Properties of Partially Observable Stochastic Systems. CoRR abs/2303.03292 (2023) - [i60]Javier Esparza, Rubén Rubio, Salomon Sickert:
A Simple Rewrite System for the Normalization of Linear Temporal Logic. CoRR abs/2304.08872 (2023) - [i59]Eszter Couillard, Philipp Czerner, Javier Esparza, Rupak Majumdar:
Making IP=PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms. CoRR abs/2305.11813 (2023) - [i58]Javier Esparza, Rubén Rubio, Salomon Sickert:
Efficient Normalization of Linear Temporal Logic. CoRR abs/2310.12613 (2023) - 2022
- [j61]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Computing Parameterized Invariants of Parameterized Petri Nets. Fundam. Informaticae 187(2-4): 197-243 (2022) - [j60]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): 635-659 (2022) - [c158]Javier Esparza, Rubén Rubio, Salomon Sickert:
A Simple Rewrite System for the Normalization of Linear Temporal Logic. Principles of Systems Design 2022: 208-227 - [c157]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Regular Model Checking Upside-Down: An Invariant-Based Approach. CONCUR 2022: 23:1-23:19 - [c156]Michael Blondin, Javier Esparza:
Separators in Continuous Petri Nets. FoSSaCS 2022: 81-100 - [c155]Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Fast and Succinct Population Protocols for Presburger Arithmetic. SAND 2022: 11:1-11:17 - [d9]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Examples for submission to CONCUR'22. Version 1. Zenodo, 2022 [all versions] - [d8]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Examples for submission to CONCUR'22. Version 2. Zenodo, 2022 [all versions] - [i57]Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Fast and Succinct Population Protocols for Presburger Arithmetic. CoRR abs/2202.11601 (2022) - [i56]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Regular Model Checking Upside-Down: An Invariant-Based Approach. CoRR abs/2205.03060 (2022) - [i55]Michael Blondin, Javier Esparza:
Separators in Continuous Petri Nets. CoRR abs/2209.02767 (2022) - 2021
- [j59]Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy:
The complexity of verifying population protocols. Distributed Comput. 34(2): 133-177 (2021) - [j58]Javier Esparza:
2021 Alonzo Church Award for Outstanding Contributions to Logic and Computation. Bull. EATCS 134 (2021) - [j57]Javier Esparza, Uri Zwick:
TheoretiCS. Bull. EATCS 135 (2021) - [j56]Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer:
Towards efficient verification of population protocols. Formal Methods Syst. Des. 57(3): 305-342 (2021) - [j55]Javier Esparza:
The 2021 Alonzo Church award for outstanding contributions to logic and computation: call for nominations. ACM SIGLOG News 8(1): 3 (2021) - [c154]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Computing Parameterized Invariants of Parameterized Petri Nets. Petri Nets 2021: 141-163 - [c153]Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger:
Enforcing ω-Regular Properties in Markov Chains by Restarting. CONCUR 2021: 5:1-5:22 - [c152]A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. FoSSaCS 2021: 42-61 - [c151]Javier Esparza:
State Complexity of Population Protocols (Invited Talk). FSTTCS 2021: 2:1-2:1 - [c150]Philipp Czerner, Javier Esparza:
Lower Bounds on the State Complexity of Population Protocols. PODC 2021: 45-54 - [c149]Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Decision Power of Weak Asynchronous Models of Distributed Computing. PODC 2021: 115-125 - [c148]Javier Esparza:
Population Protocols: Beyond Runtime Analysis. RP 2021: 28-51 - [c147]Javier Esparza:
Back to the Future: A Fresh Look at Linear Temporal Logic. CIAA 2021: 3-13 - [c146]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Abduction of trap invariants in parameterized systems. GandALF 2021: 1-17 - [p7]Javier Esparza, Orna Kupferman, Moshe Y. Vardi:
Verification. Handbook of Automata Theory (II.) 2021: 1415-1456 - [i54]Philipp Czerner, Javier Esparza:
Lower Bounds on the State Complexity of Population Protocols. CoRR abs/2102.11619 (2021) - [i53]Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Decision Power of Weak Asynchronous Models of Distributed Computing. CoRR abs/2102.11630 (2021) - [i52]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Computing Parameterized Invariants of Parameterized Petri Nets. CoRR abs/2103.10280 (2021) - [i51]Javier Esparza:
Population Protocols: Beyond Runtime Analysis. CoRR abs/2108.13449 (2021) - 2020
- [j54]Javier Esparza, Jan Kretínský, Salomon Sickert:
A Unified Translation of Linear Temporal Logic to ω-Automata. J. ACM 67(6): 33:1-33:61 (2020) - [c145]A. R. Balasubramanian, Javier Esparza, Marijana Lazic:
Complexity of Verification and Synthesis of Threshold Automata. ATVA 2020: 144-160 - [c144]Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer:
Peregrine 2.0: Explaining Correctness of Population Protocols Through Stage Graphs. ATVA 2020: 550-556 - [c143]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: 372-397 - [c142]Javier Esparza, Fabian Reiter:
A Classification of Weak Asynchronous Models of Distributed Computing. CONCUR 2020: 10:1-10:16 - [c141]Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza:
Flatness and Complexity of Immediate Observation Petri Nets. CONCUR 2020: 45:1-45:19 - [c140]Salomon Sickert, Javier Esparza:
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. LICS 2020: 831-844 - [c139]Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. STACS 2020: 40:1-40:15 - [c138]Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel:
Structural Invariants for the Verification of Systems with Parameterized Architectures. TACAS (1) 2020: 228-246 - [e11]Javier Esparza, Daniel Král':
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic. LIPIcs 170, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-159-7 [contents] - [d7]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 1. Zenodo, 2020 [all versions] - [d6]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 2. Zenodo, 2020 [all versions] - [d5]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 3. Zenodo, 2020 [all versions] - [d4]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 4. Zenodo, 2020 [all versions] - [d3]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
ostrich. Version pn-2021. Zenodo, 2020 [all versions] - [d2]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 5. Zenodo, 2020 [all versions] - [d1]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
ostrich. Version fi-2022. Zenodo, 2020 [all versions] - [i50]Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel:
Structural Invariants for the Verification of Systems with Parameterized Architectures. CoRR abs/2002.07672 (2020) - [i49]Salomon Sickert, Javier Esparza:
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. CoRR abs/2005.00472 (2020) - [i48]Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer:
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CoRR abs/2005.03555 (2020) - [i47]Javier Esparza, Fabian Reiter:
A Classification of Weak Asynchronous Models of Distributed Computing. CoRR abs/2007.03291 (2020) - [i46]A. R. Balasubramanian, Javier Esparza, Marijana Lazic:
Complexity of Verification and Synthesis of Threshold Automata. CoRR abs/2007.06248 (2020) - [i45]Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer:
Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs. CoRR abs/2007.07638 (2020) - [i44]Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger:
Online Monitoring ω-Regular Properties in Unknown Markov Chains. CoRR abs/2010.08347 (2020) - [i43]A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. CoRR abs/2010.09471 (2020)
2010 – 2019
- 2019
- [j53]Jörg Desel, Javier Esparza, Philipp Hoffmann:
Negotiation as concurrency primitive. Acta Informatica 56(2): 93-159 (2019) - [c137]Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy:
Parameterized Analysis of Immediate Observation Petri Nets. Petri Nets 2019: 365-385 - [c136]Michael Blondin, Javier Esparza, Stefan Jaax:
Expressive Power of Broadcast Consensus Protocols. CONCUR 2019: 31:1-31:16 - [c135]Philipp J. Meyer, Javier Esparza, Philip Offtermatt:
Computing the Expected Execution Time of Probabilistic Workflow Nets. TACAS (2) 2019: 154-171 - [p6]Javier Esparza:
Coffee and Cigarettes. Carl Adam Petri: Ideas, Personality, Impact 2019: 97-103 - [e10]Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza:
Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings. Lecture Notes in Computer Science 11781, Springer 2019, ISBN 978-3-030-31783-6 [contents] - [i42]Michael Blondin, Javier Esparza, Stefan Jaax:
Expressive Power of Oblivious Consensus Protocols. CoRR abs/1902.01668 (2019) - [i41]Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy:
Parameterized Analysis of Immediate Observation Petri Nets. CoRR abs/1902.03025 (2019) - [i40]Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. CoRR abs/1910.04600 (2019) - [i39]Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy:
The Complexity of Verifying Population Protocols. CoRR abs/1912.06578 (2019) - 2018
- [j52]Javier Esparza, Enrico Tronci:
Preface for the special issue GandALF 2015. Acta Informatica 55(2): 89-90 (2018) - [j51]Thomas Eiter, Javier Esparza, Catuscia Palamidessi, Gordon D. Plotkin, Natarajan Shankar:
Alonzo Church Award 2018 - Call for Nominations. Bull. EATCS 124 (2018) - [j50]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in negotiations. Log. Methods Comput. Sci. 14(1) (2018) - [c134]Michael Blondin, Javier Esparza, Stefan Jaax:
Peregrine: A Tool for the Analysis of Population Protocols. CAV (1) 2018: 604-611 - [c133]Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy:
Verification of Immediate Observation Population Protocols. CONCUR 2018: 31:1-31:16 - [c132]Michael Blondin, Javier Esparza, Antonín Kucera:
Automatic Analysis of Expected Termination Time for Population Protocols. CONCUR 2018: 33:1-33:16 - [c131]Michael Blondin, Javier Esparza, Stefan Jaax, Antonín Kucera:
Black Ninjas in the Dark: Formal Analysis of Population Protocols. LICS 2018: 1-10 - [c130]Javier Esparza, Jan Kretínský, Salomon Sickert:
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata. LICS 2018: 384-393 - [c129]Michael Blondin, Javier Esparza, Stefan Jaax:
Large Flocks of Small Birds: on the Minimal Size of Population Protocols. STACS 2018: 16:1-16:14 - [c128]Philipp J. Meyer, Javier Esparza, Hagen Völzer:
Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets. TACAS (2) 2018: 3-19 - [p5]Rajeev Alur, Ahmed Bouajjani, Javier Esparza:
Model Checking Procedural Programs. Handbook of Model Checking 2018: 541-572 - [i38]Michael Blondin, Javier Esparza, Stefan Jaax:
Large Flocks of Small Birds: On the Minimal Size of Population Protocols. CoRR abs/1801.00742 (2018) - [i37]Philipp J. Meyer, Javier Esparza, Hagen Völzer:
Computing the concurrency threshold of sound free-choice workflow nets. CoRR abs/1802.08064 (2018) - [i36]Javier Esparza, Jan Kretínský, Salomon Sickert:
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata. CoRR abs/1805.00748 (2018) - [i35]Michael Blondin, Javier Esparza, Antonín Kucera:
Automatic Analysis of Expected Termination Time for Population Protocols. CoRR abs/1807.00331 (2018) - [i34]Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy:
Verification of Immediate Observation Population Protocols. CoRR abs/1807.06071 (2018) - [i33]Philipp J. Meyer, Javier Esparza, Philip Offtermatt:
Computing the Expected Execution Time of Probabilistic Workflow Nets. CoRR abs/1811.06961 (2018) - [i32]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): 60-79 (2018) - 2017
- [j49]Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Verification of population protocols. Acta Informatica 54(2): 191-215 (2017) - [j48]Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar:
Model checking parameterized asynchronous shared-memory systems. Formal Methods Syst. Des. 50(2-3): 140-167 (2017) - [j47]Javier Esparza, Philipp Hoffmann, Ratul Saha:
Polynomial analysis algorithms for free choice Probabilistic Workflow Nets. Perform. Evaluation 117: 104-129 (2017) - [j46]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): 45:1-45:24 (2017) - [c127]Javier Esparza:
Advances in Parameterized Verification of Population Protocols. CSR 2017: 7-14 - [c126]Javier Esparza, Anca Muscholl, Igor Walukiewicz:
Static analysis of deterministic negotiations. LICS 2017: 1-12 - [c125]Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer:
Towards Efficient Verification of Population Protocols. PODC 2017: 423-430 - [c124]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: 426-442 - [c123]Javier Esparza:
Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk). TIME 2017: 2:1-2:6 - [e9]Javier Esparza, Andrzej S. Murawski:
Foundations of Software Science and Computation Structures - 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings. Lecture Notes in Computer Science 10203, 2017, ISBN 978-3-662-54457-0 [contents] - [i31]Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert:
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. CoRR abs/1701.06103 (2017) - [i30]Michael Blondin, Stefan Jaax, Javier Esparza, Philipp J. Meyer:
Towards Efficient Verification of Population Protocols. CoRR abs/1703.04367 (2017) - [i29]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in negotiations. CoRR abs/1703.05137 (2017) - [i28]Javier Esparza, Anca Muscholl, Igor Walukiewicz:
Static Analysis of Deterministic Negotiations. CoRR abs/1704.04190 (2017) - [i27]Philipp J. Meyer, Matthias Rungger, Michael Luttenberger, Javier Esparza, Majid Zamani:
Quantitative Implementation Strategies for Safety Controllers. CoRR abs/1712.05278 (2017) - 2016
- [j45]Javier Esparza, Jan Kretínský, Salomon Sickert:
From LTL to deterministic automata - A safraless compositional approach. Formal Methods Syst. Des. 49(3): 219-271 (2016) - [j44]