Javier Esparza

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)

Javier Esparza, Pierre Ganty, Rupak Majumdar: Parameterized Verification of Asynchronous Shared-Memory Systems. CoRR abs/1304.1185 (2013)

Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger: Space-efficient scheduling of stochastically generated tasks. Inf. Comput. 210: 87-110 (2012)

Javier Esparza, Christian Kern: Reactive and Proactive Diagnosis of Distributed Systems Using Net Unfoldings. ACSD 2012: 154-163

Andreas Gaiser, Jan Kretínský, Javier Esparza: Rabinizer: Small Deterministic Automata for LTL(F, G). ATVA 2012: 72-76

Jan Kretínský, Javier Esparza: Deterministic Automata for the (F, G)-Fragment of LTL. CAV 2012: 7-22

Javier Esparza, Andreas Gaiser, Stefan Kiefer: Proving Termination of Probabilistic Programs Using Patterns. CAV 2012: 123-138

Javier Esparza, Pierre Ganty, Rupak Majumdar: A Perfect Model for Bounded Verification. LICS 2012: 285-294

Javier Esparza, Pierre Ganty, Rupak Majumdar: A Perfect Model for Bounded Verification. CoRR abs/1201.3194 (2012)

Javier Esparza, Andreas Gaiser, Stefan Kiefer: Proving Termination of Probabilistic Programs Using Patterns. CoRR abs/1204.2932 (2012)

Jan Kretínský, Javier Esparza: Deterministic Automata for the (F,G)-fragment of LTL. CoRR abs/1204.5057 (2012)

Javier Esparza, Martin Leucker, Maximilian Schlund: Learning Workflow Petri Nets. Fundam. Inform. 113(3-4): 205-228 (2011)

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)

Javier Esparza, Stefan Kiefer, Michael Luttenberger: Derivation tree analysis for accelerated fixed-point computation. Theor. Comput. Sci. 412(28): 3226-3241 (2011)

Javier Esparza, Michael Luttenberger: Solving Fixed-Point Equations by Derivation Tree Analysis. CALCO 2011: 19-35

Javier Esparza, Pierre Ganty: Complexity of pattern-based verification for multithreaded programs. POPL 2011: 499-510

Javier Esparza, Andreas Gaiser: Probabilistic Abstractions with Arbitrary Domains. SAS 2011: 334-350

Javier Esparza, Andreas Gaiser: Probabilistic Abstractions with Arbitrary Domains. CoRR abs/1106.1364 (2011)

Javier Esparza, Bernd Spanfelner, Orna Grumberg (Eds.): 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

Javier Esparza, Stefan Kiefer, Michael Luttenberger: Newtonian program analysis. J. ACM 57(6): 33 (2010)

Javier Esparza, Stefan Kiefer, Michael Luttenberger: Computing the Least Fixed Point of Positive Polynomial Systems. SIAM J. Comput. 39(6): 2282-2335 (2010)

Javier Esparza, Martin Leucker, Maximilian Schlund: Learning Workflow Petri Nets. Petri Nets 2010: 206-225

Christian Kern, Javier Esparza: Automatic Error Correction of Java Programs. FMICS 2010: 67-81

Javier Esparza: A False History of True Concurrency: From Petri to Tools. ICGT 2010: 1-2

Barbara König, Javier Esparza: Verification of Graph Transformation Systems with Context-Free Specifications. ICGT 2010: 107-122

Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger: Space-Efficient Scheduling of Stochastically Generated Tasks. ICALP (2) 2010: 539-550

Javier Esparza: A False History of True Concurrency: From Petri to Tools. SPIN 2010: 180-186

Javier Esparza, Andreas Gaiser, Stefan Kiefer: Computing Least Fixed Points of Probabilistic Systems of Polynomials. STACS 2010: 359-370

Javier Esparza: Analysis of Systems with Stochastic Process Creation. VMCAI 2010: 1

Javier Esparza, Michael Luttenberger: Newtonian Program Analysis - An Introduction. Logics and Languages for Reliability and Security 2010: 31-72

Javier Esparza, Rupak Majumdar (Eds.): 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

Javier Esparza, Stefan Kiefer, Michael Luttenberger: Computing the Least Fixed Point of Positive Polynomial Systems. CoRR abs/1001.0340 (2010)

Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger: Space-efficient scheduling of stochastically generated tasks. CoRR abs/1004.4286 (2010)

Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger: Parikh's Theorem: A simple and direct construction. CoRR abs/1006.3825 (2010)

Chih-Hong Cheng, Alois 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

Chih-Hong Cheng, Christian Buckl, Javier Esparza, Alois Knoll: Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness. DS-RT 2009: 208-215

Tomás Brázdil, Javier Esparza, Stefan Kiefer: On the Memory Consumption of Probabilistic Pushdown Automata. FSTTCS 2009: 49-60

Javier Esparza: Stochastic Process Creation. MFCS 2009: 24-33

Chih-Hong Cheng, Christian Buckl, Javier Esparza, Alois Knoll: FTOS-Verify: Analysis and Verification of Non-Functional Properties for Fault-Tolerant Systems. CoRR abs/0905.3946 (2009)

Chih-Hong Cheng, Christian Buckl, Javier Esparza, Alois Knoll: Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness. CoRR abs/0905.3951 (2009)

Javier Esparza, Andreas Gaiser, Stefan Kiefer: Computing Least Fixed Points of Probabilistic Systems of Polynomials. CoRR abs/0912.4226 (2009)

Javier Esparza, Petr Jancar, Alexander Miller: On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. Fundam. Inform. 86(3): 227-253 (2008)

Javier Esparza, Stefan Kiefer, Stefan Schwoon: Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. JSAT 5(1-4): 27-56 (2008)

Javier Esparza, Pradeep Kanade, Stefan Schwoon: A negative result on depth-first net unfoldings. STTT 10(2): 161-166 (2008)

Javier Esparza, Stefan Kiefer, Michael Luttenberger: Derivation Tree Analysis for Accelerated Fixed-Point Computation. Developments in Language Theory 2008: 301-313

Javier Esparza, Stefan Kiefer, Michael Luttenberger: Newton's Method for omega-Continuous Semirings. ICALP (2) 2008: 14-26

Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl: Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) 2008: 698-710

Javier Esparza, Stefan Kiefer, Michael Luttenberger: Solving Monotone Polynomial Equations. IFIP TCS 2008: 285-298

Dejvuth Suwimonteerabuth, Javier Esparza, Stefan Schwoon: Symbolic Context-Bounded Analysis of Multithreaded Java Programs. SPIN 2008: 270-287

Javier Esparza, Stefan Kiefer, Michael Luttenberger: Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. STACS 2008: 289-300

Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Dejvuth Suwimonteerabuth: SDSIrep: A Reputation System Based on SDSI. TACAS 2008: 501-516

Javier Esparza, Stefan Kiefer, Michael Luttenberger: Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. CoRR abs/0802.2856 (2008)

Dejvuth Suwimonteerabuth, Felix Berger, Stefan Schwoon, Javier Esparza: jMoped: A Test Environment for Java Programs. CAV 2007: 164-167

Javier Esparza, Stefan Kiefer, Michael Luttenberger: An Extension of Newton's Method to omega -Continuous Semirings. Developments in Language Theory 2007: 157-168

Javier Esparza, Stefan Kiefer, Michael Luttenberger: On Fixed Point Equations over Commutative Semirings. STACS 2007: 296-307

Stefan Kiefer, Michael Luttenberger, Javier Esparza: On the convergence of Newton's method for monotone systems of polynomial equations. STOC 2007: 217-226

Antonín Kucera, Javier Esparza, Richard Mayr: Model Checking Probabilistic Pushdown Automata. Logical Methods in Computer Science 2(1) (2006)

Javier Esparza, Petr Jancar, Alexander Miller: On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. ACSD 2006: 47-56

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

Giorgio Delzanno, Javier Esparza, Jirí Srba: Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols. ATVA 2006: 415-429

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

Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf: Separability in Conflict-Free Petri Nets. Ershov Memorial Conference 2006: 1-18

Ahmed Bouajjani, Javier Esparza: Rewriting Models of Boolean Programs. RTA 2006: 136-150

Javier Esparza, Stefan Kiefer, Stefan Schwoon: Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. TACAS 2006: 489-503

Ahmed Bouajjani, Javier Esparza, Tayssir Touili: Reachability Analysis of Synchronized PA Systems. Electr. Notes Theor. Comput. Sci. 138(3): 153-178 (2005)

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

Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek: Reachability Analysis of Multithreaded Software with Asynchronous Communication. FSTTCS 2005: 348-359

Javier Esparza, Antonín Kucera, Richard Mayr: Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. LICS 2005: 117-126

Javier Esparza, Pierre Ganty, Stefan Schwoon: Locality-Based Abstractions. SAS 2005: 118-134

Stefan Schwoon, Javier Esparza: A Note on On-the-Fly Verification Algorithms. TACAS 2005: 174-190

Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza: jMoped: A Java Bytecode Checker Based on Moped. TACAS 2005: 541-545

Javier Esparza, Antonín Kucera, Richard Mayr: Model Checking Probabilistic Pushdown Automata. CoRR abs/cs/0508003 (2005)

Javier Esparza: A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs. Fundam. Inform. 62(2): 197-220 (2004)

Javier Esparza, Kousha Etessami: Verifying Probabilistic Procedural Programs. FSTTCS 2004: 16-31

Javier Esparza, Antonín Kucera, Richard Mayr: Model Checking Probabilistic Pushdown Automata. LICS 2004: 12-21

Javier Esparza, Antonín Kucera, Stefan Schwoon: Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186(2): 355-376 (2003)

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)

Antonín Kucera, Javier Esparza: A Logical Viewpoint on Process-algebraic Quotients. J. Log. Comput. 13(6): 863-880 (2003)

Javier Esparza: A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs. ACSD 2003: 61-70

Claus Schröter, Stefan Schwoon, Javier Esparza: The Model-Checking Kit. ICATPN 2003: 463-472

Alin Stefanescu, Javier Esparza, Anca Muscholl: Synthesis of Distributed Algorithms Using Asynchronous Automata. CONCUR 2003: 27-41

Javier Esparza: An Automata-Theoretic Approach to Software Verification. Developments in Language Theory 2003: 21

Ahmed Bouajjani, Javier Esparza, Tayssir Touili: A generic approach to the static analysis of concurrent programs with procedures. POPL 2003: 62-73

Javier Esparza, Monika Maidl: Simple Representative Instantiations for Multicast Protocols. TACAS 2003: 128-143

Javier Esparza, Stefan Römer, Walter Vogler: An Improvement of McMillan's Unfolding Algorithm. Formal Methods in System Design 20(3): 285-310 (2002)

Javier Esparza: Grammars as Processes. Formal and Natural Computing 2002: 277-297

Javier Esparza: An Algebraic Approach to the Static Analysis of Concurrent Software. SAS 2002: 3

Javier Esparza, Charles Lakos (Eds.): 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

Javier Esparza, Claus Schröter: Unfolding Based Algorithms for the Reachability Problem. Fundam. Inform. 47(3-4): 231-245 (2001)

Olaf Burkart, Javier Esparza: More Infinite Results. Current Trends in Theoretical Computer Science 2001: 480-503

Javier Esparza, Stefan Schwoon: A BDD-Based Model Checker for Recursive Programs. CAV 2001: 324-336

Javier Esparza, Claus Schröter: Net Reductions for LTL Model-Checking. CHARME 2001: 310-324

Javier Esparza: Model Checking (with) Declarative Programs. PPDP 2001: 37

Javier Esparza, Keijo Heljanko: Implementing LTL Model Checking with Net Unfoldings. SPIN 2001: 37-56

Javier Esparza, Antonín Kucera, Stefan Schwoon: Model-Checking LTL with Regular Valuations for Pushdown Systems. TACS 2001: 316-339

Javier Esparza, Peter Rossmanith, Stefan Schwoon: A Uniform Framework for Problems on Context-Free Grammars. Bulletin of the EATCS 72: 169-177 (2000)

Javier Esparza, Stephan Melzer: Verification of Safety Properties Using Integer Programming: Beyond the State Equation. Formal Methods in System Design 16(2): 159-189 (2000)

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)

Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon: Efficient Algorithms for Model Checking Pushdown Systems. CAV 2000: 232-247

Javier Esparza, Keijo Heljanko: A New Unfolding Approach to LTL Model Checking. ICALP 2000: 475-486

Leonor Prensa Nieto, Javier Esparza: Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL. MFCS 2000: 619-628

Javier Esparza: Verification of Systems with an Infinite State Space. MOVEP 2000: 183-186

Javier Esparza, Andreas Podelski: Efficient Algorithms for pre^* and post^* on Interprocedural Parallel Flow Graphs. POPL 2000: 1-11

Petr Jancar, Javier Esparza, Faron Moller: Petri Nets and Regular Processes. J. Comput. Syst. Sci. 59(3): 476-503 (1999)

Javier Esparza, Stefan Römer: An Unfolding Algorithm for Synchronous Products of Transition Systems. CONCUR 1999: 2-20

Christine Röckl, Javier Esparza: Proof-Checking Protocols Using Bisimulations. CONCUR 1999: 525-540

Giorgio Delzanno, Javier Esparza, Andreas Podelski: Constraint-Based Analysis of Broadcast Protocols. CSL 1999: 50-66

Antonín Kucera, Javier Esparza: A Logical Viewpoint on Process-Algebraic Quotients. CSL 1999: 499-514

Javier Esparza, Jens Knoop: An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis. FoSSaCS 1999: 14-30

Javier Esparza, Alain Finkel, Richard Mayr: On the Verification of Broadcast Protocols. LICS 1999: 352-359

Javier Esparza: Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete. Theor. Comput. Sci. 198(1-2): 211-224 (1998)

Javier Esparza: Decidability of Model Checking for Infinite-State Concurrent Systems. Acta Inf. 34(2): 85-107 (1997)

Olaf Burkart, Javier Esparza: More Infinite Results. Bulletin of the EATCS 62 (1997)

Javier Esparza: Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. Fundam. Inform. 31(1): 13-25 (1997)

Javier Esparza, Stephan Melzer: Model Checking LTL Using Constraint Programming. ICATPN 1997: 1-20

Javier Esparza, Peter Rossmanith: An Automata Approach to Some Problems on Context-Free Grammars. Foundations of Computer Science: Potential - Theory - Cognition 1997: 143-152

Ahmed Bouajjani, Javier Esparza, Oded Maler: Reachability Analysis of Pushdown Automata: Application to Model-Checking. CONCUR 1997: 135-150

Olaf Burkart, Javier Esparza: More infinite results. Electr. Notes Theor. Comput. Sci. 5: 29 (1996)

Javier Esparza, Glenn Bruns: Trapping Mutual Exclusion in the Box Calculus. Theor. Comput. Sci. 153(1&2): 95-128 (1996)

Javier Esparza: Decidability and Complexity of Petri Net Problems - An Introduction. Petri Nets 1996: 374-428

Stephan Melzer, Stefan Römer, Javier Esparza: Verification Using PEP. AMAST 1996: 591-594

Stephan Melzer, Javier Esparza: Checking System Properties via Integer Programming. ESOP 1996: 250-264

Julian C. Bradfield, Javier Esparza, Angelika Mader: An Effective Tableau System for the Linear Time µ-Calculus. ICALP 1996: 98-109

Petr Jancar, Javier Esparza: Deciding Finiteness of Petri Nets Up To Bisimulation. ICALP 1996: 478-489

Javier Esparza, Stefan Römer, Walter Vogler: An Improvement of McMillan's Unfolding Algorithm. TACAS 1996: 87-106

Allan Cheng, Javier Esparza, Jens Palsberg: Complexity Results for 1-Safe Nets. Theor. Comput. Sci. 147(1&2): 117-136 (1995)

Javier Esparza, Astrid Kiehn: On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes. CAV 1995: 353-366

Javier Esparza: Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. FCT 1995: 221-232

Javier Esparza, Mogens Nielsen: Decidability Issues for Petri Nets - a survey. Bulletin of the EATCS 52: 244-262 (1994)

Javier Esparza, Mogens Nielsen: Decidability Issues for Petri Nets - a survey. Elektronische Informationsverarbeitung und Kybernetik 30(3): 143-160 (1994)

Javier Esparza: Reduction and Synthesis of Live and Bounded Free Choice Petri Nets. Inf. Comput. 114(1): 50-87 (1994)

Javier Esparza: Model Checking Using Net Unfoldings. Sci. Comput. Program. 23(2-3): 151-195 (1994)

Javier Esparza: On the Decidability of Model Checking for Several µ-calculi and Petri Nets. CAAP 1994: 115-129

Maciej Koutny, Javier Esparza, Eike Best: Operational Semantics for the Petri Box Calculus. CONCUR 1994: 210-225

Jörg Desel, Javier Esparza: Reachability in Cyclic Extended Free-Choice Systems. Theor. Comput. Sci. 114(1): 93-118 (1993)

Jörg Desel, Javier Esparza: Shortest Paths in Reachability Graphs. Application and Theory of Petri Nets 1993: 224-241

Allan Cheng, Javier Esparza, Jens Palsberg: Complexity Results for 1-safe Nets. FSTTCS 1993: 326-337

Eike Best, Raymond R. Devillers, Javier Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. STACS 1993: 130-140

Javier Esparza: Model Checking Using Net Unfoldings. TAPSOFT 1993: 613-628

Javier Esparza, Bernhard von Stengel: The Asynchronous Committee Meeting Problem. WG 1993: 276-287

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)

Eike Best, Jörg Desel, Javier Esparza: Traps Characterize Home States in Free Choice Systems. Theor. Comput. Sci. 101(2): 161-176 (1992)

Javier Esparza, Manuel Silva: A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets. Theor. Comput. Sci. 102(1): 185-205 (1992)

Javier Esparza, Manuel Silva: Compositional Synthesis of Live and Bounded Free Choice Petri Nets. CONCUR 1991: 172-187

Eike Best, Javier Esparza: Model Checking of Persistent Petri Nets. CSL 1991: 35-52

Jörg Desel, Javier Esparza: Reachability in Reversible Free Choice Systems. STACS 1991: 384-397

Javier Esparza, Manuel Silva: Top-down synthesis of live and bounded free choice nets. Applications and Theory of Petri Nets 1990: 118-139

Javier Esparza: Synthesis Rules for Petri Nets, and How they Lead to New Results. CONCUR 1990: 182-198

Javier Esparza, Manuel Silva: Circuits, handles, bridges and nets. Applications and Theory of Petri Nets 1989: 210-242

Javier Esparza, Manuel Silva: On the analysis and synthesis of free choice systems. Applications and Theory of Petri Nets 1989: 243-286