| 2008 |
|---|
| 108 | EE | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Derivation Tree Analysis for Accelerated Fixed-Point Computation.
Developments in Language Theory 2008: 301-313 |
| 107 | EE | Javier Esparza,
Thomas Gawlitza,
Stefan Kiefer,
Helmut Seidl:
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.
ICALP (1) 2008: 698-710 |
| 106 | EE | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Newton's Method for omega-Continuous Semirings.
ICALP (2) 2008: 14-26 |
| 105 | EE | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Solving Monotone Polynomial Equations.
IFIP TCS 2008: 285-298 |
| 104 | EE | Dejvuth Suwimonteerabuth,
Javier Esparza,
Stefan Schwoon:
Symbolic Context-Bounded Analysis of Multithreaded Java Programs.
SPIN 2008: 270-287 |
| 103 | EE | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations.
STACS 2008: 289-300 |
| 102 | EE | Ahmed Bouajjani,
Javier Esparza,
Stefan Schwoon,
Dejvuth Suwimonteerabuth:
SDSIrep: A Reputation System Based on SDSI.
TACAS 2008: 501-516 |
| 101 | EE | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
CoRR abs/0802.2856: (2008) |
| 100 | EE | 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) |
| 99 | EE | Javier Esparza,
Pradeep Kanade,
Stefan Schwoon:
A negative result on depth-first net unfoldings.
STTT 10(2): 161-166 (2008) |
| 2007 |
|---|
| 98 | EE | Dejvuth Suwimonteerabuth,
Felix Berger,
Stefan Schwoon,
Javier Esparza:
jMoped: A Test Environment for Java Programs.
CAV 2007: 164-167 |
| 97 | EE | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
An Extension of Newton's Method to omega -Continuous Semirings.
Developments in Language Theory 2007: 157-168 |
| 96 | EE | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
On Fixed Point Equations over Commutative Semirings.
STACS 2007: 296-307 |
| 95 | EE | Stefan Kiefer,
Michael Luttenberger,
Javier Esparza:
On the convergence of Newton's method for monotone systems of polynomial equations.
STOC 2007: 217-226 |
| 2006 |
|---|
| 94 | EE | Javier Esparza,
Petr Jancar,
Alexander Miller:
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs.
ACSD 2006: 47-56 |
| 93 | EE | 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 |
| 92 | EE | Giorgio Delzanno,
Javier Esparza,
Jirí Srba:
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols.
ATVA 2006: 415-429 |
| 91 | EE | Eike Best,
Javier Esparza,
Harro Wimmel,
Karsten Wolf:
Separability in Conflict-Free Petri Nets.
Ershov Memorial Conference 2006: 1-18 |
| 90 | EE | Ahmed Bouajjani,
Javier Esparza:
Rewriting Models of Boolean Programs.
RTA 2006: 136-150 |
| 89 | EE | 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 |
| 88 | EE | Javier Esparza,
Stefan Kiefer,
Stefan Schwoon:
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
TACAS 2006: 489-503 |
| 87 | EE | Antonín Kucera,
Javier Esparza,
Richard Mayr:
Model Checking Probabilistic Pushdown Automata.
Logical Methods in Computer Science 2(1): (2006) |
| 2005 |
|---|
| 86 | EE | 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 |
| 85 | EE | Ahmed Bouajjani,
Javier Esparza,
Stefan Schwoon,
Jan Strejcek:
Reachability Analysis of Multithreaded Software with Asynchronous Communication.
FSTTCS 2005: 348-359 |
| 84 | EE | Javier Esparza,
Antonín Kucera,
Richard Mayr:
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.
LICS 2005: 117-126 |
| 83 | EE | Javier Esparza,
Pierre Ganty,
Stefan Schwoon:
Locality-Based Abstractions.
SAS 2005: 118-134 |
| 82 | EE | Stefan Schwoon,
Javier Esparza:
A Note on On-the-Fly Verification Algorithms.
TACAS 2005: 174-190 |
| 81 | EE | Dejvuth Suwimonteerabuth,
Stefan Schwoon,
Javier Esparza:
jMoped: A Java Bytecode Checker Based on Moped.
TACAS 2005: 541-545 |
| 80 | EE | Javier Esparza,
Antonín Kucera,
Richard Mayr:
Model Checking Probabilistic Pushdown Automata
CoRR abs/cs/0508003: (2005) |
| 79 | EE | Ahmed Bouajjani,
Javier Esparza,
Tayssir Touili:
Reachability Analysis of Synchronized PA Systems.
Electr. Notes Theor. Comput. Sci. 138(3): 153-178 (2005) |
| 2004 |
|---|
| 78 | EE | Javier Esparza,
Kousha Etessami:
Verifying Probabilistic Procedural Programs.
FSTTCS 2004: 16-31 |
| 77 | EE | Javier Esparza,
Antonín Kucera,
Richard Mayr:
Model Checking Probabilistic Pushdown Automata.
LICS 2004: 12-21 |
| 76 | EE | Javier Esparza:
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs.
Fundam. Inform. 62(2): 197-220 (2004) |
| 2003 |
|---|
| 75 | EE | Javier Esparza:
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs.
ACSD 2003: 61-70 |
| 74 | EE | Alin Stefanescu,
Javier Esparza,
Anca Muscholl:
Synthesis of Distributed Algorithms Using Asynchronous Automata.
CONCUR 2003: 27-41 |
| 73 | EE | Javier Esparza:
An Automata-Theoretic Approach to Software Verification.
Developments in Language Theory 2003: 21 |
| 72 | EE | Claus Schröter,
Stefan Schwoon,
Javier Esparza:
The Model-Checking Kit.
ICATPN 2003: 463-472 |
| 71 | EE | Ahmed Bouajjani,
Javier Esparza,
Tayssir Touili:
A generic approach to the static analysis of concurrent programs with procedures.
POPL 2003: 62-73 |
| 70 | EE | Javier Esparza,
Monika Maidl:
Simple Representative Instantiations for Multicast Protocols.
TACAS 2003: 128-143 |
| 69 | EE | Javier Esparza,
Antonín Kucera,
Stefan Schwoon:
Model checking LTL with regular valuations for pushdown systems.
Inf. Comput. 186(2): 355-376 (2003) |
| 68 | EE | 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) |
| 67 | EE | Antonín Kucera,
Javier Esparza:
A Logical Viewpoint on Process-algebraic Quotients.
J. Log. Comput. 13(6): 863-880 (2003) |
| 2002 |
|---|
| 66 | | Javier Esparza,
Charles Lakos:
Applications and Theory of Petri Nets 2002, 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002, Proceedings
Springer 2002 |
| 65 | EE | Javier Esparza:
Grammars as Processes.
Formal and Natural Computing 2002: 277-297 |
| 64 | EE | Javier Esparza:
An Algebraic Approach to the Static Analysis of Concurrent Software.
SAS 2002: 3 |
| 63 | | Javier Esparza,
Stefan Römer,
Walter Vogler:
An Improvement of McMillan's Unfolding Algorithm.
Formal Methods in System Design 20(3): 285-310 (2002) |
| 2001 |
|---|
| 62 | EE | Javier Esparza,
Stefan Schwoon:
A BDD-Based Model Checker for Recursive Programs.
CAV 2001: 324-336 |
| 61 | EE | Javier Esparza,
Claus Schröter:
Net Reductions for LTL Model-Checking.
CHARME 2001: 310-324 |
| 60 | | Javier Esparza:
Model Checking (with) Declarative Programs.
PPDP 2001: 37 |
| 59 | EE | Javier Esparza,
Keijo Heljanko:
Implementing LTL Model Checking with Net Unfoldings.
SPIN 2001: 37-56 |
| 58 | EE | Javier Esparza,
Antonín Kucera,
Stefan Schwoon:
Model-Checking LTL with Regular Valuations for Pushdown Systems.
TACS 2001: 316-339 |
| 57 | | Olaf Burkart,
Javier Esparza:
More Infinite Results.
Current Trends in Theoretical Computer Science 2001: 480-503 |
| 56 | | Javier Esparza,
Claus Schröter:
Unfolding Based Algorithms for the Reachability Problem.
Fundam. Inform. 47(3-4): 231-245 (2001) |
| 2000 |
|---|
| 55 | | Javier Esparza,
David Hansel,
Peter Rossmanith,
Stefan Schwoon:
Efficient Algorithms for Model Checking Pushdown Systems.
CAV 2000: 232-247 |
| 54 | EE | Javier Esparza,
Keijo Heljanko:
A New Unfolding Approach to LTL Model Checking.
ICALP 2000: 475-486 |
| 53 | EE | Leonor Prensa Nieto,
Javier Esparza:
Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL.
MFCS 2000: 619-628 |
| 52 | EE | Javier Esparza:
Verification of Systems with an Infinite State Space.
MOVEP 2000: 183-186 |
| 51 | EE | Javier Esparza,
Andreas Podelski:
Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs.
POPL 2000: 1-11 |
| 50 | | Javier Esparza,
Peter Rossmanith,
Stefan Schwoon:
A Uniform Framework for Problems on Context-Free Grammars.
Bulletin of the EATCS 72: 169-177 (2000) |
| 49 | | 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) |
| 48 | EE | 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) |
| 1999 |
|---|
| 47 | EE | Javier Esparza,
Stefan Römer:
An Unfolding Algorithm for Synchronous Products of Transition Systems.
CONCUR 1999: 2-20 |
| 46 | EE | Christine Röckl,
Javier Esparza:
Proof-Checking Protocols Using Bisimulations.
CONCUR 1999: 525-540 |
| 45 | | Antonín Kucera,
Javier Esparza:
A Logical Viewpoint on Process-Algebraic Quotients.
CSL 1999: 499-514 |
| 44 | | Giorgio Delzanno,
Javier Esparza,
Andreas Podelski:
Constraint-Based Analysis of Broadcast Protocols.
CSL 1999: 50-66 |
| 43 | | Javier Esparza,
Jens Knoop:
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis.
FoSSaCS 1999: 14-30 |
| 42 | EE | Javier Esparza,
Alain Finkel,
Richard Mayr:
On the Verification of Broadcast Protocols.
LICS 1999: 352-359 |
| 41 | | Petr Jancar,
Javier Esparza,
Faron Moller:
Petri Nets and Regular Processes.
J. Comput. Syst. Sci. 59(3): 476-503 (1999) |
| 1998 |
|---|
| 40 | EE | Javier Esparza:
Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete.
Theor. Comput. Sci. 198(1-2): 211-224 (1998) |
| 1997 |
|---|
| 39 | | Ahmed Bouajjani,
Javier Esparza,
Oded Maler:
Reachability Analysis of Pushdown Automata: Application to Model-Checking.
CONCUR 1997: 135-150 |
| 38 | EE | Javier Esparza,
Peter Rossmanith:
An Automata Approach to Some Problems on Context-Free Grammars.
Foundations of Computer Science: Potential - Theory - Cognition 1997: 143-152 |
| 37 | | Javier Esparza,
Stephan Melzer:
Model Checking LTL Using Constraint Programming.
ICATPN 1997: 1-20 |
| 36 | | Javier Esparza:
Decidability of Model Checking for Infinite-State Concurrent Systems.
Acta Inf. 34(2): 85-107 (1997) |
| 35 | | Olaf Burkart,
Javier Esparza:
More Infinite Results.
Bulletin of the EATCS 62: (1997) |
| 34 | | Javier Esparza:
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes.
Fundam. Inform. 31(1): 13-25 (1997) |
| 1996 |
|---|
| 33 | | Stephan Melzer,
Stefan Römer,
Javier Esparza:
Verification Using PEP.
AMAST 1996: 591-594 |
| 32 | | Stephan Melzer,
Javier Esparza:
Checking System Properties via Integer Programming.
ESOP 1996: 250-264 |
| 31 | | Petr Jancar,
Javier Esparza:
Deciding Finiteness of Petri Nets Up To Bisimulation.
ICALP 1996: 478-489 |
| 30 | | Julian C. Bradfield,
Javier Esparza,
Angelika Mader:
An Effective Tableau System for the Linear Time µ-Calculus.
ICALP 1996: 98-109 |
| 29 | | Javier Esparza:
Decidability and Complexity of Petri Net Problems - An Introduction.
Petri Nets 1996: 374-428 |
| 28 | | Javier Esparza,
Stefan Römer,
Walter Vogler:
An Improvement of McMillan's Unfolding Algorithm.
TACAS 1996: 87-106 |
| 27 | EE | Olaf Burkart,
Javier Esparza:
More infinite results.
Electr. Notes Theor. Comput. Sci. 5: (1996) |
| 26 | EE | Javier Esparza,
Glenn Bruns:
Trapping Mutual Exclusion in the Box Calculus.
Theor. Comput. Sci. 153(1&2): 95-128 (1996) |
| 1995 |
|---|
| 25 | | Javier Esparza,
Astrid Kiehn:
On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes.
CAV 1995: 353-366 |
| 24 | | Javier Esparza:
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes.
FCT 1995: 221-232 |
| 23 | EE | Allan Cheng,
Javier Esparza,
Jens Palsberg:
Complexity Results for 1-Safe Nets.
Theor. Comput. Sci. 147(1&2): 117-136 (1995) |
| 1994 |
|---|
| 22 | | Javier Esparza:
On the Decidability of Model Checking for Several µ-calculi and Petri Nets.
CAAP 1994: 115-129 |
| 21 | | Maciej Koutny,
Javier Esparza,
Eike Best:
Operational Semantics for the Petri Box Calculus.
CONCUR 1994: 210-225 |
| 20 | | Javier Esparza,
Mogens Nielsen:
Decidability Issues for Petri Nets - a survey.
Bulletin of the EATCS 52: 244-262 (1994) |
| 19 | | Javier Esparza,
Mogens Nielsen:
Decidability Issues for Petri Nets - a survey.
Elektronische Informationsverarbeitung und Kybernetik 30(3): 143-160 (1994) |
| 18 | | Javier Esparza:
Reduction and Synthesis of Live and Bounded Free Choice Petri Nets
Inf. Comput. 114(1): 50-87 (1994) |
| 17 | | Javier Esparza:
Model Checking Using Net Unfoldings.
Sci. Comput. Program. 23(2-3): 151-195 (1994) |
| 1993 |
|---|
| 16 | | Jörg Desel,
Javier Esparza:
Shortest Paths in Reachability Graphs.
Application and Theory of Petri Nets 1993: 224-241 |
| 15 | | Allan Cheng,
Javier Esparza,
Jens Palsberg:
Complexity Results for 1-safe Nets.
FSTTCS 1993: 326-337 |
| 14 | | Eike Best,
Raymond R. Devillers,
Javier Esparza:
General Refinement and Recursion Operators for the Petri Box Calculus.
STACS 1993: 130-140 |
| 13 | | Javier Esparza:
Model Checking Using Net Unfoldings.
TAPSOFT 1993: 613-628 |
| 12 | | Javier Esparza,
Bernhard von Stengel:
The Asynchronous Committee Meeting Problem.
WG 1993: 276-287 |
| 11 | | Jörg Desel,
Javier Esparza:
Reachability in Cyclic Extended Free-Choice Systems.
Theor. Comput. Sci. 114(1): 93-118 (1993) |
| 1992 |
|---|
| 10 | | 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) |
| 9 | | Eike Best,
Jörg Desel,
Javier Esparza:
Traps Characterize Home States in Free Choice Systems.
Theor. Comput. Sci. 101(2): 161-176 (1992) |
| 8 | | Javier Esparza,
Manuel Silva:
A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets.
Theor. Comput. Sci. 102(1): 185-205 (1992) |
| 1991 |
|---|
| 7 | | Javier Esparza,
Manuel Silva:
Compositional Synthesis of Live and Bounded Free Choice Petri Nets.
CONCUR 1991: 172-187 |
| 6 | | Eike Best,
Javier Esparza:
Model Checking of Persistent Petri Nets.
CSL 1991: 35-52 |
| 5 | | Jörg Desel,
Javier Esparza:
Reachability in Reversible Free Choice Systems.
STACS 1991: 384-397 |
| 1990 |
|---|
| 4 | | Javier Esparza,
Manuel Silva:
Top-down synthesis of live and bounded free choice nets.
Applications and Theory of Petri Nets 1990: 118-139 |
| 3 | | Javier Esparza:
Synthesis Rules for Petri Nets, and How they Lead to New Results.
CONCUR 1990: 182-198 |
| 1989 |
|---|
| 2 | | Javier Esparza,
Manuel Silva:
Circuits, handles, bridges and nets.
Applications and Theory of Petri Nets 1989: 210-242 |
| 1 | | Javier Esparza,
Manuel Silva:
On the analysis and synthesis of free choice systems.
Applications and Theory of Petri Nets 1989: 243-286 |
