Javier Esparza - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Parikhʼs theorem: A simple and direct automaton constructionJavier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger. ipl, 111(12):614-619, 2011. [doi]

Complexity of pattern-based verification for multithreaded programsJavier Esparza, Pierre Ganty. POPL 2011: 499-510 [doi]

Derivation tree analysis for accelerated fixed-point computationJavier Esparza, Stefan Kiefer, Michael Luttenberger. TCS, 412(28):3226-3241, 2011. [doi]

2010

Space-Efficient Scheduling of Stochastically Generated TasksTomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger. icalp 2010: 539-550 [doi]

Computing Least Fixed Points of Probabilistic Systems of PolynomialsJavier Esparza, Andreas Gaiser, Stefan Kiefer. STACS 2010: 359-370 [doi]

Computing the Least Fixed Point of Positive Polynomial SystemsJavier Esparza, Stefan Kiefer, Michael Luttenberger. siamcomp, 39(6):2282-2335, 2010. [doi]

Learning Workflow Petri NetsJavier Esparza, Martin Leucker, Maximilian Schlund. apn 2010: 206-225 [doi]

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. ProceedingsJavier Esparza, Rupak Majumdar, editors, Volume 6015 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Newtonian program analysisJavier Esparza, Stefan Kiefer, Michael Luttenberger. JACM, 57(6):33, 2010. [doi]

Automatic Error Correction of Java ProgramsChristian Kern, Javier Esparza. fmics 2010: 67-81 [doi]

Verification of Graph Transformation Systems with Context-Free SpecificationsBarbara König, Javier Esparza. gg 2010: 107-122 [doi]

2009

On the Memory Consumption of Probabilistic Pushdown AutomataTomÃ¡s BrÃ¡zdil, Javier Esparza, Stefan Kiefer. fsttcs 2009: 49-60 [doi]

Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with FinitenessChih-Hong Cheng, Christian Buckl, Javier Esparza, Alois Knoll. dsrt 2009: 208-215 [doi]

Stochastic Process CreationJavier Esparza. mfcs 2009: 24-33 [doi]

2008

SDSIrep: A Reputation System Based on SDSIAhmed Bouajjani, Javier Esparza, Stefan Schwoon, Dejvuth Suwimonteerabuth. TACAS 2008: 501-516 [doi]

Newton s Method for omega-Continuous SemiringsJavier Esparza, Stefan Kiefer, Michael Luttenberger. icalp 2008: 14-26 [doi]

Approximative Methods for Monotone Systems of Min-Max-Polynomial EquationsJavier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl. icalp 2008: 698-710 [doi]

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

Convergence Thresholds of Newton s Method for Monotone Polynomial EquationsJavier Esparza, Stefan Kiefer, Michael Luttenberger. STACS 2008: 289-300 [doi]

Solving Monotone Polynomial EquationsJavier Esparza, Stefan Kiefer, Michael Luttenberger. ifipTCS 2008: 285-298 [doi]

Abstraction Refinement with Craig Interpolation and Symbolic Pushdown SystemsJavier Esparza, Stefan Kiefer, Stefan Schwoon. jsat, 5(1-4):27-56, 2008. [doi]

On the Complexity of Consistency and Complete State Coding for Signal Transition GraphsJavier Esparza, Petr Jancar, Alexander Miller. FUIN, 86(3):227-253, 2008. [doi]

Derivation Tree Analysis for Accelerated Fixed-Point ComputationJavier Esparza, Stefan Kiefer, Michael Luttenberger. dlt 2008: 301-313 [doi]

Symbolic Context-Bounded Analysis of Multithreaded Java ProgramsDejvuth Suwimonteerabuth, Javier Esparza, Stefan Schwoon. spin 2008: 270-287 [doi]

2007

2006

Separability in Conflict-Free Petri NetsEike Best, Javier Esparza, Harro Wimmel, Karsten Wolf. ershov 2007: 1-18 [doi]

Rewriting Models of Boolean ProgramsAhmed Bouajjani, Javier Esparza. RTA 2006: 136-150 [doi]

Reachability analysis of multithreaded software with asynchronous communicationAhmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek. dagstuhl 2006: [doi]

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

Abstraction Refinement with Craig Interpolation and Symbolic Pushdown SystemsJavier Esparza, Stefan Kiefer, Stefan Schwoon. TACAS 2006: 489-503 [doi]

On the Complexity of Consistency and Complete State Coding for Signal Transition GraphsJavier Esparza, Petr Jancar, Alexander Miller. acsd 2006: 47-56 [doi]

Model Checking Probabilistic Pushdown AutomataAntonín Kucera, Javier Esparza, Richard Mayr. lmcs, 2(1), 2006. [doi]

Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate ChainsDejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza. ATVA 2006: 141-153 [doi]

2005

Reachability Analysis of Multithreaded Software with Asynchronous CommunicationAhmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek. fsttcs 2005: 348-359 [doi]

Reachability Analysis of Synchronized PA SystemsAhmed Bouajjani, Javier Esparza, Tayssir Touili. ENTCS, 138(3):153-178, 2005. [doi]

Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract)Tomás Brázdil, Javier Esparza, Antonín Kucera. focs 2005: 521-530 [doi]

Locality-Based AbstractionsJavier Esparza, Pierre Ganty, Stefan Schwoon. SAS 2005: 118-134 [doi]

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and VariancesJavier Esparza, Antonín Kucera, Richard Mayr. lics 2005: 117-126 [doi]

A Note on On-the-Fly Verification AlgorithmsStefan Schwoon, Javier Esparza. TACAS 2005: 174-190 [doi]

jMoped: A Java Bytecode Checker Based on MopedDejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza. TACAS 2005: 541-545 [doi]

2004

Verifying Probabilistic Procedural ProgramsJavier Esparza, Kousha Etessami. fsttcs 2004: 16-31 [doi]

Model Checking Probabilistic Pushdown AutomataJavier Esparza, Antonín Kucera, Richard Mayr. lics 2004: 12-21 [doi]

A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition GraphsJavier Esparza. FUIN, 62(2):197-220, 2004. [doi]

2003

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

A Generic Approach to the Static Analysis of Concurrent Programs with ProceduresAhmed Bouajjani, Javier Esparza, Tayssir Touili. ijfcs, 14(4):551, 2003. [doi]

Model checking LTL with regular valuations for pushdown systemsJavier Esparza, Antonín Kucera, Stefan Schwoon. iandc, 186(2):355-376, 2003. [doi]

An Automata-Theoretic Approach to Software VerificationJavier Esparza. dlt 2003: 21 [doi]

Simple Representative Instantiations for Multicast ProtocolsJavier Esparza, Monika Maidl. TACAS 2003: 128-143 [doi]

A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition GraphsJavier Esparza. acsd 2003: 61-70 [doi]

A Logical Viewpoint on Process-algebraic QuotientsAntonín Kucera, Javier Esparza. logcom, 13(6):863-880, 2003. [doi]

The Model-Checking KitClaus Schröter, Stefan Schwoon, Javier Esparza. apn 2003: 463-472 [doi]

Synthesis of Distributed Algorithms Using Asynchronous AutomataAlin Stefanescu, Javier Esparza, Anca Muscholl. concur 2003: 27-41 [doi]

2002

Applications and Theory of Petri Nets 2002, 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002, ProceedingsJavier Esparza, Charles Lakos, editors, Volume 2360 of Lecture Notes in Computer Science, Springer, 2002.

An Improvement of McMillan s Unfolding AlgorithmJavier Esparza, Stefan Römer, Walter Vogler. fmsd, 20(3):285-310, 2002.

Grammars as ProcessesJavier Esparza. BIRTHDAY 2002: 277-297 [doi]

An Algebraic Approach to the Static Analysis of Concurrent SoftwareJavier Esparza. SAS 2002: 3 [doi]

2001

2000

An efficient automata approach to some problems on context-free grammarsAhmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper. ipl, 74(5-6):221-227, 2000. [doi]

Verification of Systems with an Infinite State SpaceJavier Esparza. movep 2001: 183-186 [doi]

Verification of Safety Properties Using Integer Programming: Beyond the State EquationJavier Esparza, Stephan Melzer. fmsd, 16(2):159-189, 2000.

A Uniform Framework for Problems on Context-Free GrammarsJavier Esparza, Peter Rossmanith, Stefan Schwoon. eatcs, 72:169-177, 2000.

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

A New Unfolding Approach to LTL Model CheckingJavier Esparza, Keijo Heljanko. icalp 2000: 475-486 [doi]

Efficient Algorithms for pre:::*::: and post:::*::: on Interprocedural Parallel Flow GraphsJavier Esparza, Andreas Podelski. POPL 2000: 1-11 [doi]

Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOLLeonor Prensa Nieto, Javier Esparza. mfcs 2000: 619-628 [doi]

1999

1998

Reachability in Live and Safe Free-Choice Petri Nets is NP-CompleteJavier Esparza. TCS, 198(1-2):211-224, 1998. [doi]

1997

1996

1995

Complexity Results for 1-Safe NetsAllan Cheng, Javier Esparza, Jens Palsberg. TCS, 147(1&2):117-136, 1995. [doi]

Petri Nets, Commutative Context-Free Grammars, and Basic Parallel ProcessesJavier Esparza. fct 1995: 221-232

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

1994

Reduction and Synthesis of Live and Bounded Free Choice Petri NetsJavier Esparza. iandc, 114(1):50-87, October 1994.

PreviousNext