default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJavier 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
- 2025
[j67]Javier Esparza, Michael Raskin, Christoph Welzel-Mohr:
Regular Model Checking Upside-Down: An Invariant-Based Approach. Log. Methods Comput. Sci. 21(1): 4 (2025)- 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) - [c165]Benno Lossin, Philipp Czerner, Javier Esparza, Roland Guttenberg, Tobias Prehn:
The Black Ninjas and the Sniper: On Robust Population Protocols. Principles of Verification (3) 2024: 206-233 - [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] - [i68]Philipp Czerner, Javier Esparza, Valentin Krasotin:
A Resolution-Based Interactive Proof System for UNSAT. CoRR abs/2401.14996 (2024) - [i67]Philipp Czerner, Javier Esparza, Valentin Krasotin, Christoph Welzel-Mohr:
Computing Inductive Invariants of Regular Abstraction Frameworks. CoRR abs/2404.10752 (2024) - [i66]Javier Esparza, Rubén Rubio:
Validity of contextual formulas (extended version). CoRR abs/2407.07759 (2024) - [i65]Javier Esparza, Peter Rossmanith, Stefan Schwoon:
A Uniform Framework for Problems on Context-Free Grammars. CoRR abs/2410.19386 (2024) - [i64]Javier Esparza, Mogens Nielsen:
Decidability Issues for Petri Nets - a survey. CoRR abs/2411.01592 (2024) - [i63]Michael Blondin, Michaël Cadilhac, Xin-Yi Cui, Philipp Czerner, Javier Esparza, Jakob Schulz:
Weakly acyclic diagrams: A data structure for infinite-state symbolic verification. CoRR abs/2411.17250 (2024) - [i62]Benno Lossin, Philipp Czerner, Javier Esparza, Roland Guttenberg, Tobias Prehn:
The Black Ninjas and the Sniper: On Robustness of Population Protocols. CoRR abs/2412.11783 (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]Eike Best, Javier Esparza:
Existence of home states in Petri nets is decidable. Inf. Process. Lett. 116(6): 423-427 (2016) - [j43]Javier Esparza, Pierre Ganty, Rupak Majumdar:
Parameterized Verification of Asynchronous Shared-Memory Systems. J. ACM 63(1): 10:1-10:48 (2016) - [j42]Jörg Desel, Javier Esparza:
Negotiations and Petri Nets. Trans. Petri Nets Other Model. Concurr. 11: 203-225 (2016) - [c122]Salomon Sickert, Javier Esparza, Stefan Jaax, Jan Kretínský:
Limit-Deterministic Büchi Automata for Linear Temporal Logic. CAV (2) 2016: 312-332 - [c121]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in Negotiations. CONCUR 2016: 12:1-12:13 - [c120]Javier Esparza, Philipp Hoffmann:
Reduction Rules for Colored Workflow Nets. FASE 2016: 342-358 - [c119]Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Model Checking Population Protocols. FSTTCS 2016: 27:1-27:14 - [c118]Javier Esparza, Philipp Hoffmann, Ratul Saha:
Polynomial Analysis Algorithms for Free Choice Probabilistic Workflow Nets. QEST 2016: 89-104 - [p4]Javier Esparza:
Parameterized Verification of Crowds of Anonymous Processes. Dependable Software Systems Engineering 2016: 59-71 - [e8]Javier Esparza, Orna Grumberg, Salomon Sickert:
Dependable Software Systems Engineering. NATO Science for Peace and Security Series - D: Information and Communication Security 45, IOS Press 2016, ISBN 978-1-61499-626-2 [contents] - [i26]Javier Esparza, Philipp Hoffmann:
Reduction Rules for Colored Workflow Nets. CoRR abs/1601.01928 (2016) - [i25]Javier Esparza, Philipp Hoffmann, Ratul Saha:
Polynomial Analysis Algorithms for Free Choice Probabilistic Workflow Nets. CoRR abs/1606.00175 (2016) - [i24]Jörg Desel, Javier Esparza, Philipp Hoffmann:
Negotiation as Concurrency Primitive. CoRR abs/1612.07912 (2016) - 2015
- [j41]Javier Esparza, Michael Luttenberger, Maximilian Schlund:
FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings. Int. J. Found. Comput. Sci. 26(7): 805-826 (2015) - [c117]Hernán Ponce de León, Olli Saarikivi, Kari Kähkönen, Keijo Heljanko, Javier Esparza:
Unfolding Based Minimal Test Suites for Testing Multithreaded Programs. ACSD 2015: 40-49 - [c116]Jörg Desel, Javier Esparza:
Negotiations and Petri Nets. PNSE @ Petri Nets 2015: 41-57 - [c115]Javier Esparza, Jörg Desel:
Negotiation Programs. Petri Nets 2015: 157-178 - [c114]Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar:
Model Checking Parameterized Asynchronous Shared-Memory Systems. CAV (1) 2015: 67-84 - [c113]Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Verification of Population Protocols. CONCUR 2015: 470-482 - [c112]Javier Esparza, Philipp J. Meyer:
An SMT-based Approach to Fair Termination Analysis. FMCAD 2015: 49-56 - [c111]Ratul Saha, Javier Esparza, Sumit Kumar Jha, Madhavan Mukund, P. S. Thiagarajan:
Distributed Markov Chains. VMCAI 2015: 117-134 - [e7]Javier Esparza, Enrico Tronci:
Proceedings Sixth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2015, Genoa, Italy, 21-22nd September 2015. EPTCS 193, 2015 [contents] - [i23]Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar:
Model Checking Parameterized Asynchronous Shared-Memory Systems. CoRR abs/1505.06588 (2015) - 2014
- [j40]Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, Jan-Georg Smaus:
A Fully Verified Executable LTL Model Checker. Arch. Formal Proofs 2014 (2014) - [j39]Javier Esparza, Pierre Ganty, Tomás Poch:
Pattern-Based Verification for Multithreaded Programs. ACM Trans. Program. Lang. Syst. 36(3): 9:1-9:29 (2014) - [c110]Javier Esparza, Jan Kretínský:
From LTL to Deterministic Automata: A Safraless Compositional Approach. CAV 2014: 192-208 - [c109]Javier Esparza, Ruslán Ledesma-Garza, Rupak Majumdar, Philipp J. Meyer, Filip Niksic:
An SMT-Based Approach to Coverability Analysis. CAV 2014: 603-619 - [c108]Javier Esparza:
Deterministic Negotiations: Concurrency for Free. CONCUR 2014: 23-31 - [c107]Maximilian Schlund, Michael Luttenberger, Javier Esparza:
Fast and Accurate Unlexicalized Parsing via Structural Annotations. EACL 2014: 164-168 - [c106]Javier Esparza, Jörg Desel:
On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations. FoSSaCS 2014: 258-273 - [c105]Javier Esparza, Michael Luttenberger, Maximilian Schlund:
A Brief History of Strahler Numbers. LATA 2014: 1-13 - [c104]Javier Esparza:
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). STACS 2014: 1-10 - [c103]Loïg Jezequel, Javier Esparza:
Message-Passing Algorithms for the Verification of Distributed Protocols. VMCAI 2014: 222-241 - [c102]Javier Esparza, Michael Luttenberger, Maximilian Schlund:
FPsolve: A Generic Solver for Fixpoint Equations over Semirings. CIAA 2014: 1-15 - [e6]Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias:
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Lecture Notes in Computer Science 8572, Springer 2014, ISBN 978-3-662-43947-0 [contents] - [e5]Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias:
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II. Lecture Notes in Computer Science 8573, Springer 2014, ISBN 978-3-662-43950-0 [contents] - [i22]Javier Esparza, Jan Kretínský:
From LTL to Deterministic Automata: A Safraless Compositional Approach. CoRR abs/1402.3388 (2014) - [i21]Javier Esparza, Jörg Desel:
On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations. CoRR abs/1403.4958 (2014) - [i20]Javier Esparza:
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version). CoRR abs/1405.1841 (2014) - [i19]Javier Esparza, Philipp Hoffmann:
Negotiation Games. CoRR abs/1405.6820 (2014) - [i18]Javier Esparza, Alain Finkel, Pierre McKenzie, Joël Ouaknine:
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141). Dagstuhl Reports 4(3): 153-180 (2014) - 2013
- [j38]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Antonín Kucera:
Analyzing probabilistic pushdown automata. Formal Methods Syst. Des. 43(2): 124-163 (2013) - [j37]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars. Inf. Process. Lett. 113(10-11): 381-385 (2013) - [c101]Javier Esparza, Pierre Ganty, Rupak Majumdar:
Parameterized Verification of Asynchronous Shared-Memory Systems. CAV 2013: 124-140 - [c100]Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, Jan-Georg Smaus:
A Fully Verified Executable LTL Model Checker. CAV 2013: 463-478 - [c99]Javier Esparza, Jörg Desel:
On Negotiation as Concurrency Primitive. CONCUR 2013: 440-454 - [c98]Javier Esparza, Loïg Jezequel, Stefan Schwoon:
Computation of Summaries Using Net Unfoldings. FSTTCS 2013: 225-236 - [i17]Javier Esparza, Pierre Ganty, Rupak Majumdar:
Parameterized Verification of Asynchronous Shared-Memory Systems. CoRR abs/1304.1185 (2013) - [i16]Javier Esparza, Jörg Desel:
On Negotiation as Concurrency Primitive. CoRR abs/1307.2145 (2013) - [i15]Javier Esparza, Loïg Jezequel, Stefan Schwoon:
Computation of Summaries Using Net Unfoldings. CoRR abs/1310.2143 (2013) - 2012
- [j36]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Space-efficient scheduling of stochastically generated tasks. Inf. Comput. 210: 87-110 (2012) - [c97]Javier Esparza, Christian Kern:
Reactive and Proactive Diagnosis of Distributed Systems Using Net Unfoldings. ACSD 2012: 154-163 - [c96]Andreas Gaiser, Jan Kretínský, Javier Esparza:
Rabinizer: Small Deterministic Automata for LTL(F, G). ATVA 2012: 72-76 - [c95]Jan Kretínský, Javier Esparza:
Deterministic Automata for the (F, G)-Fragment of LTL. CAV 2012: 7-22 - [c94]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
Proving Termination of Probabilistic Programs Using Patterns. CAV 2012: 123-138 - [c93]Javier Esparza, Pierre Ganty, Rupak Majumdar:
A Perfect Model for Bounded Verification. LICS 2012: 285-294 - [p3]Javier Esparza, Jörg Kreiker:
Three Case Studies on Verification of Infinite-State Systems. Modern Applications of Automata Theory 2012: 373-414 - [i14]Javier Esparza, Pierre Ganty, Rupak Majumdar:
A Perfect Model for Bounded Verification. CoRR abs/1201.3194 (2012) - [i13]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
Proving Termination of Probabilistic Programs Using Patterns. CoRR abs/1204.2932 (2012) - [i12]Jan Kretínský, Javier Esparza:
Deterministic Automata for the (F,G)-fragment of LTL. CoRR abs/1204.5057 (2012) - 2011
- [j35]Javier Esparza, Martin Leucker, Maximilian Schlund:
Learning Workflow Petri Nets. Fundam. Informaticae 113(3-4): 205-228 (2011) - [j34]Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger:
Parikhʼs theorem: A simple and direct automaton construction. Inf. Process. Lett. 111(12): 614-619 (2011) - [j33]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Derivation tree analysis for accelerated fixed-point computation. Theor. Comput. Sci. 412(28): 3226-3241 (2011) - [c92]Javier Esparza, Michael Luttenberger:
Solving Fixed-Point Equations by Derivation Tree Analysis. CALCO 2011: 19-35 - [c91]Javier Esparza, Pierre Ganty:
Complexity of pattern-based verification for multithreaded programs. POPL 2011: 499-510 - [c90]Javier Esparza, Andreas Gaiser:
Probabilistic Abstractions with Arbitrary Domains. SAS 2011: 334-350 - [e4]Javier Esparza, Christian Michaux, Charles Steinhorn:
Finite and Algorithmic Model Theory. London Mathematical Society Lecture Note Series 379, Cambridge University Press 2011, ISBN 978-0-521-71820-2 [contents] - [i11]Javier Esparza, Andreas Gaiser:
Probabilistic Abstractions with Arbitrary Domains. CoRR abs/1106.1364 (2011) - 2010
- [j32]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Newtonian program analysis. J. ACM 57(6): 33:1-33:47 (2010) - [j31]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Computing the Least Fixed Point of Positive Polynomial Systems. SIAM J. Comput. 39(6): 2282-2335 (2010) - [c89]Javier Esparza, Martin Leucker, Maximilian Schlund:
Learning Workflow Petri Nets. Petri Nets 2010: 206-225 - [c88]Christian Kern, Javier Esparza:
Automatic Error Correction of Java Programs. FMICS 2010: 67-81 - [c87]Javier Esparza:
A False History of True Concurrency: From Petri to Tools. ICGT 2010: 1-2 - [c86]Barbara König, Javier Esparza:
Verification of Graph Transformation Systems with Context-Free Specifications. ICGT 2010: 107-122 - [c85]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Space-Efficient Scheduling of Stochastically Generated Tasks. ICALP (2) 2010: 539-550 - [c84]Javier Esparza:
A False History of True Concurrency: From Petri to Tools. SPIN 2010: 180-186 - [c83]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
Computing Least Fixed Points of Probabilistic Systems of Polynomials. STACS 2010: 359-370 - [c82]Javier Esparza:
Analysis of Systems with Stochastic Process Creation. VMCAI 2010: 1 - [p2]Javier Esparza, Michael Luttenberger:
Newtonian Program Analysis - An Introduction. Logics and Languages for Reliability and Security 2010: 31-72 - [e3]Javier Esparza, Rupak Majumdar:
Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings. Lecture Notes in Computer Science 6015, Springer 2010, ISBN 978-3-642-12001-5 [contents] - [e2]Javier Esparza, Bernd Spanfelner, Orna Grumberg:
Logics and Languages for Reliability and Security. NATO Science for Peace and Security Series - D: Information and Communication Security 25, IOS Press 2010, ISBN 978-1-60750-099-5 [contents] - [i10]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Computing the Least Fixed Point of Positive Polynomial Systems. CoRR abs/1001.0340 (2010) - [i9]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Space-efficient scheduling of stochastically generated tasks. CoRR abs/1004.4286 (2010) - [i8]Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger:
Parikh's Theorem: A simple and direct construction. CoRR abs/1006.3825 (2010)
2000 – 2009
- 2009
- [j30]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
On least fixed points of systems of positive polynomials. ACM Commun. Comput. Algebra 43(3/4): 81-83 (2009) - [c81]Chih-Hong Cheng, Alois C. Knoll, Christian Buckl, Javier Esparza, Yang Chen:
Examining robotic systems with shape-adjustable manipulators under dynamic environments: From simulation to verification. CIRA 2009: 72-77 - [c80]Chih-Hong Cheng, Christian Buckl, Javier Esparza, Alois C. Knoll:
Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness. DS-RT 2009: 208-215 - [c79]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Solving Fixed-Point Equations on omega-Continuous Semirings. FICS 2009: 9 - [c78]Tomás Brázdil, Javier Esparza, Stefan Kiefer:
On the Memory Consumption of Probabilistic Pushdown Automata. FSTTCS 2009: 49-60 - [c77]Javier Esparza:
Stochastic Process Creation. MFCS 2009: 24-33 - [i7]Chih-Hong Cheng, Christian Buckl, Javier Esparza, Alois C. Knoll:
FTOS-Verify: Analysis and Verification of Non-Functional Properties for Fault-Tolerant Systems. CoRR abs/0905.3946 (2009) - [i6]Chih-Hong Cheng, Christian Buckl, Javier Esparza, Alois C. Knoll:
Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness. CoRR abs/0905.3951 (2009) - [i5]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
Computing Least Fixed Points of Probabilistic Systems of Polynomials. CoRR abs/0912.4226 (2009) - 2008
- [b1]Javier Esparza, Keijo Heljanko:
Unfoldings - A Partial-Order Approach to Model Checking. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2008, ISBN 978-3-540-77425-9, pp. I-XII, 1-156 - [j29]Javier Esparza, Petr Jancar, Alexander Miller:
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. Fundam. Informaticae 86(3): 227-253 (2008) - [j28]Javier Esparza, Stefan Kiefer, Stefan Schwoon:
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. J. Satisf. Boolean Model. Comput. 5(1-4): 27-56 (2008) - [j27]Javier Esparza, Pradeep Kanade, Stefan Schwoon:
A negative result on depth-first net unfoldings. Int. J. Softw. Tools Technol. Transf. 10(2): 161-166 (2008) - [c76]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Derivation Tree Analysis for Accelerated Fixed-Point Computation. Developments in Language Theory 2008: 301-313 - [c75]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Newton's Method for omega-Continuous Semirings. ICALP (2) 2008: 14-26 - [c74]Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl:
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) 2008: 698-710 - [c73]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Solving Monotone Polynomial Equations. IFIP TCS 2008: 285-298 - [c72]Dejvuth Suwimonteerabuth, Javier Esparza, Stefan Schwoon:
Symbolic Context-Bounded Analysis of Multithreaded Java Programs. SPIN 2008: 270-287 - [c71]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. STACS 2008: 289-300 - [c70]Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Dejvuth Suwimonteerabuth:
SDSIrep: A Reputation System Based on SDSI. TACAS 2008: 501-516 - [i4]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. CoRR abs/0802.2856 (2008) - 2007
- [c69]Dejvuth Suwimonteerabuth, Felix Berger, Stefan Schwoon, Javier Esparza:
jMoped: A Test Environment for Java Programs. CAV 2007: 164-167 - [c68]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
An Extension of Newton's Method to omega -Continuous Semirings. Developments in Language Theory 2007: 157-168 - [c67]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
On Fixed Point Equations over Commutative Semirings. STACS 2007: 296-307 - [c66]Stefan Kiefer, Michael Luttenberger, Javier Esparza:
On the convergence of Newton's method for monotone systems of polynomial equations. STOC 2007: 217-226 - 2006
- [j26]Antonín Kucera, Javier Esparza, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. Log. Methods Comput. Sci. 2(1) (2006) - [c65]Javier Esparza, Petr Jancar, Alexander Miller:
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. ACSD 2006: 47-56 - [c64]Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza:
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains. ATVA 2006: 141-153 - [c63]Giorgio Delzanno, Javier Esparza, Jirí Srba:
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols. ATVA 2006: 415-429 - [c62]Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf:
Separability in Conflict-Free Petri Nets. Ershov Memorial Conference 2006: 1-18 - [c61]Ahmed Bouajjani, Javier Esparza:
Rewriting Models of Boolean Programs. RTA 2006: 136-150 - [c60]Javier Esparza, Stefan Kiefer, Stefan Schwoon:
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. TACAS 2006: 489-503 - [i3]Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek:
Reachability analysis of multithreaded software with asynchronous communication. Software Verification: Infinite-State Model Checking and Static Program Analysis 2006 - 2005
- [c59]Tomás Brázdil, Javier Esparza, Antonín Kucera:
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract). FOCS 2005: 521-530 - [c58]Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek:
Reachability Analysis of Multithreaded Software with Asynchronous Communication. FSTTCS 2005: 348-359 - [c57]Javier Esparza, Antonín Kucera, Richard Mayr:
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. LICS 2005: 117-126 - [c56]Javier Esparza, Pierre Ganty, Stefan Schwoon:
Locality-Based Abstractions. SAS 2005: 118-134 - [c55]Stefan Schwoon, Javier Esparza:
A Note on On-the-Fly Verification Algorithms. TACAS 2005: 174-190 - [c54]Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza:
jMoped: A Java Bytecode Checker Based on Moped. TACAS 2005: 541-545 - [i2]Javier Esparza, Antonín Kucera, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. CoRR abs/cs/0508003 (2005) - 2004
- [j25]Javier Esparza:
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs. Fundam. Informaticae 62(2): 197-220 (2004) - [c53]Javier Esparza, Kousha Etessami:
Verifying Probabilistic Procedural Programs. FSTTCS 2004: 16-31 - [c52]Javier Esparza, Antonín Kucera, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. LICS 2004: 12-21 - [c51]Ahmed Bouajjani, Javier Esparza, Tayssir Touili:
Reachability Analysis of Synchronized PA Systems. INFINITY 2004: 153-178 - 2003
- [j24]Javier Esparza, Antonín Kucera, Stefan Schwoon:
Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186(2): 355-376 (2003) - [j23]Ahmed Bouajjani, Javier Esparza, Tayssir Touili:
A Generic Approach to the Static Analysis of Concurrent Programs with Procedures. Int. J. Found. Comput. Sci. 14(4): 551- (2003) - [j22]Antonín Kucera, Javier Esparza:
A Logical Viewpoint on Process-algebraic Quotients. J. Log. Comput. 13(6): 863-880 (2003) - [c50]Javier Esparza:
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs. ACSD 2003: 61-70 - [c49]Claus Schröter, Stefan Schwoon, Javier Esparza:
The Model-Checking Kit. ICATPN 2003: 463-472 - [c48]Alin Stefanescu, Javier Esparza, Anca Muscholl:
Synthesis of Distributed Algorithms Using Asynchronous Automata. CONCUR 2003: 27-41 - [c47]Javier Esparza:
An Automata-Theoretic Approach to Software Verification. Developments in Language Theory 2003: 21 - [c46]Ahmed Bouajjani, Javier Esparza, Tayssir Touili:
A generic approach to the static analysis of concurrent programs with procedures. POPL 2003: 62-73 - [c45]Javier Esparza, Monika Maidl:
Simple Representative Instantiations for Multicast Protocols. TACAS 2003: 128-143 - 2002
- [j21]Javier Esparza, Stefan Römer, Walter Vogler:
An Improvement of McMillan's Unfolding Algorithm. Formal Methods Syst. Des. 20(3): 285-310 (2002) - [c44]Javier Esparza:
Grammars as Processes. Formal and Natural Computing 2002: 277-297 - [c43]Javier Esparza:
An Algebraic Approach to the Static Analysis of Concurrent Software. SAS 2002: 3 - [e1]Javier Esparza, Charles Lakos:
Applications and Theory of Petri Nets 2002, 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002, Proceedings. Lecture Notes in Computer Science 2360, Springer 2002, ISBN 3-540-43787-8 [contents] - 2001
- [j20]Javier Esparza, Claus Schröter:
Unfolding Based Algorithms for the Reachability Problem. Fundam. Informaticae 47(3-4): 231-245 (2001) - [c42]Javier Esparza, Stefan Schwoon:
A BDD-Based Model Checker for Recursive Programs. CAV 2001: 324-336 - [c41]Javier Esparza, Claus Schröter:
Net Reductions for LTL Model-Checking. CHARME 2001: 310-324 - [c40]Javier Esparza:
Model Checking (with) Declarative Programs. PPDP 2001: 37 - [c39]Javier Esparza, Keijo Heljanko:
Implementing LTL Model Checking with Net Unfoldings. SPIN 2001: 37-56 - [c38]Javier Esparza, Antonín Kucera, Stefan Schwoon:
Model-Checking LTL with Regular Valuations for Pushdown Systems. TACS 2001: 316-339 - [p1]Olaf Burkart, Javier Esparza:
More Infinite Results. Current Trends in Theoretical Computer Science 2001: 480-503 - 2000
- [j19]Javier Esparza, Peter Rossmanith, Stefan Schwoon:
A Uniform Framework for Problems on Context-Free Grammars. Bull. EATCS 72: 169-177 (2000) - [j18]Javier Esparza, Stephan Melzer:
Verification of Safety Properties Using Integer Programming: Beyond the State Equation. Formal Methods Syst. Des. 16(2): 159-189 (2000) - [j17]Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper:
An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett. 74(5-6): 221-227 (2000) - [c37]Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon:
Efficient Algorithms for Model Checking Pushdown Systems. CAV 2000: 232-247 - [c36]Javier Esparza, Keijo Heljanko:
A New Unfolding Approach to LTL Model Checking. ICALP 2000: 475-486 - [c35]Leonor Prensa Nieto, Javier Esparza:
Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL. MFCS 2000: 619-628 - [c34]Javier Esparza:
Verification of Systems with an Infinite State Space. MOVEP 2000: 183-186 - [c33]Javier Esparza, Andreas Podelski:
Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs. POPL 2000: 1-11
1990 – 1999
- 1999
- [j16]Petr Jancar, Javier Esparza, Faron Moller:
Petri Nets and Regular Processes. J. Comput. Syst. Sci. 59(3): 476-503 (1999) - [c32]Javier Esparza, Stefan Römer:
An Unfolding Algorithm for Synchronous Products of Transition Systems. CONCUR 1999: 2-20 - [c31]Christine Röckl, Javier Esparza:
Proof-Checking Protocols Using Bisimulations. CONCUR 1999: 525-540 - [c30]Giorgio Delzanno, Javier Esparza, Andreas Podelski:
Constraint-Based Analysis of Broadcast Protocols. CSL 1999: 50-66 - [c29]Antonín Kucera, Javier Esparza:
A Logical Viewpoint on Process-Algebraic Quotients. CSL 1999: 499-514 - [c28]Javier Esparza, Jens Knoop:
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis. FoSSaCS 1999: 14-30 - [c27]Javier Esparza, Alain Finkel, Richard Mayr:
On the Verification of Broadcast Protocols. LICS 1999: 352-359 - 1998
- [j15]Javier Esparza:
Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete. Theor. Comput. Sci. 198(1-2): 211-224 (1998) - 1997
- [j14]Javier Esparza:
Decidability of Model Checking for Infinite-State Concurrent Systems. Acta Informatica 34(2): 85-107 (1997) - [j13]Olaf Burkart, Javier Esparza:
More Infinite Results. Bull. EATCS 62 (1997) - [j12]Javier Esparza:
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. Fundam. Informaticae 31(1): 13-25 (1997) - [c26]Javier Esparza, Stephan Melzer:
Model Checking LTL Using Constraint Programming. ICATPN 1997: 1-20 - [c25]Javier Esparza, Peter Rossmanith:
An Automata Approach to Some Problems on Context-Free Grammars. Foundations of Computer Science: Potential - Theory - Cognition 1997: 143-152 - [c24]Ahmed Bouajjani, Javier Esparza, Oded Maler:
Reachability Analysis of Pushdown Automata: Application to Model-Checking. CONCUR 1997: 135-150 - 1996
- [j11]Javier Esparza, Glenn Bruns:
Trapping Mutual Exclusion in the Box Calculus. Theor. Comput. Sci. 153(1&2): 95-128 (1996) - [c23]Javier Esparza:
Decidability and Complexity of Petri Net Problems - An Introduction. Petri Nets 1996: 374-428 - [c22]Stephan Melzer, Stefan Römer, Javier Esparza:
Verification Using PEP. AMAST 1996: 591-594 - [c21]Stephan Melzer, Javier Esparza:
Checking System Properties via Integer Programming. ESOP 1996: 250-264 - [c20]Julian C. Bradfield, Javier Esparza, Angelika Mader:
An Effective Tableau System for the Linear Time µ-Calculus. ICALP 1996: 98-109 - [c19]Petr Jancar, Javier Esparza:
Deciding Finiteness of Petri Nets Up To Bisimulation. ICALP 1996: 478-489 - [c18]Javier Esparza, Stefan Römer, Walter Vogler:
An Improvement of McMillan's Unfolding Algorithm. TACAS 1996: 87-106 - [c17]Olaf Burkart, Javier Esparza:
More infinite results. INFINITY 1996: 29 - 1995
- [j10]Jörg Desel, Javier Esparza:
Shortest Paths in Reachability Graphs. J. Comput. Syst. Sci. 51(2): 314-323 (1995) - [j9]Allan Cheng, Javier Esparza, Jens Palsberg:
Complexity Results for 1-Safe Nets. Theor. Comput. Sci. 147(1&2): 117-136 (1995) - [c16]Javier Esparza, Astrid Kiehn:
On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes. CAV 1995: 353-366 - [c15]Javier Esparza:
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. FCT 1995: 221-232 - 1994
- [j8]Javier Esparza, Mogens Nielsen:
Decidability Issues for Petri Nets - a survey. Bull. EATCS 52: 244-262 (1994) - [j7]Javier Esparza, Mogens Nielsen:
Decidability Issues for Petri Nets - a survey. J. Inf. Process. Cybern. 30(3): 143-160 (1994) - [j6]Javier Esparza:
Reduction and Synthesis of Live and Bounded Free Choice Petri Nets. Inf. Comput. 114(1): 50-87 (1994) - [j5]Javier Esparza:
Model Checking Using Net Unfoldings. Sci. Comput. Program. 23(2-3): 151-195 (1994) - [c14]Javier Esparza:
On the Decidability of Model Checking for Several µ-calculi and Petri Nets. CAAP 1994: 115-129 - [c13]Maciej Koutny, Javier Esparza, Eike Best:
Operational Semantics for the Petri Box Calculus. CONCUR 1994: 210-225 - 1993
- [j4]Jörg Desel, Javier Esparza:
Reachability in Cyclic Extended Free-Choice Systems. Theor. Comput. Sci. 114(1): 93-118 (1993) - [c12]Jörg Desel, Javier Esparza:
Shortest Paths in Reachability Graphs. Application and Theory of Petri Nets 1993: 224-241 - [c11]Allan Cheng, Javier Esparza, Jens Palsberg:
Complexity Results for 1-safe Nets. FSTTCS 1993: 326-337 - [c10]Eike Best, Raymond R. Devillers, Javier Esparza:
General Refinement and Recursion Operators for the Petri Box Calculus. STACS 1993: 130-140 - [c9]Javier Esparza:
Model Checking Using Net Unfoldings. TAPSOFT 1993: 613-628 - [c8]Javier Esparza, Bernhard von Stengel:
The Asynchronous Committee Meeting Problem. WG 1993: 276-287 - 1992
- [j3]Javier Esparza:
A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming. Inf. Process. Lett. 41(6): 313-319 (1992) - [j2]Eike Best, Jörg Desel, Javier Esparza:
Traps Characterize Home States in Free Choice Systems. Theor. Comput. Sci. 101(2): 161-176 (1992) - [j1]Javier Esparza, Manuel Silva Suárez:
A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets. Theor. Comput. Sci. 102(1): 185-205 (1992) - 1991
- [c7]Javier Esparza, Manuel Silva Suárez:
Compositional Synthesis of Live and Bounded Free Choice Petri Nets. CONCUR 1991: 172-187 - [c6]Eike Best, Javier Esparza:
Model Checking of Persistent Petri Nets. CSL 1991: 35-52 - [c5]Jörg Desel, Javier Esparza:
Reachability in Reversible Free Choice Systems. STACS 1991: 384-397 - 1990
- [c4]Javier Esparza, Manuel Silva Suárez:
Top-down synthesis of live and bounded free choice nets. Applications and Theory of Petri Nets 1990: 118-139 - [c3]Javier Esparza:
Synthesis Rules for Petri Nets, and How they Lead to New Results. CONCUR 1990: 182-198 - [i1]Jörg Desel, Javier Esparza:
Reachability in reversible free-choice systems. Forschungsberichte, TU Munich TUM I 9023: 1-35 (1990)
1980 – 1989
- 1989
- [c2]Javier Esparza, Manuel Silva Suárez:
Circuits, handles, bridges and nets. Applications and Theory of Petri Nets 1989: 210-242 - [c1]Javier Esparza, Manuel Silva Suárez:
On the analysis and synthesis of free choice systems. Applications and Theory of Petri Nets 1989: 243-286
Coauthor Index
Klara J. Meyer
aka: Philipp J. Meyer
aka: Philipp J. Meyer
Mikhail A. Raskin
aka: Michael Raskin
aka: Michael Raskin
Christoph Welzel
aka: Christoph Welzel-Mohr
aka: Christoph Welzel-Mohr
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
