Esparza, Javier.
Esparza, Javier, 1964-....
Javier Esparza Estaun
VIAF ID: 57248932 (Personal)
Permalink: http://viaf.org/viaf/57248932
Preferred Forms
-
- 100 1 _ ‡a Esparza, Javier
-
-
- 100 1 _ ‡a Esparza, Javier
- 100 1 _ ‡a Esparza, Javier
-
-
- 100 1 _ ‡a Esparza, Javier ‡d 1964-
- 100 1 _ ‡a Esparza, Javier ‡d 1964-
- 100 1 _ ‡a Esparza, Javier ‡d 1964-
-
- 100 1 _ ‡a Esparza, Javier, ‡d 1964-....
-
- 100 0 _ ‡a Javier Esparza Estaun
4xx's: Alternate Name Forms (4)
5xx's: Related Names (2)
- 510 2 _ ‡a Technische Universität München ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Technische Universität München
Works
Title | Sources |
---|---|
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) | |
Abstraction refinement with craig interpolation and symbolic pushdown systems | |
Application and theory of Petri nets 2002 : 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002 : Proceedings | |
Assertions and measurements for mixed-signal simulation | |
Assertions et mesures pour la simulation en signaux mixtes. | |
asynchronous committee meeting problem | |
Automata, languages, and programming, (Springer) | |
Automata theory : an algorithmic approach | |
Automated technology for verification and analysis 17th international symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, proceedings | |
CARET model-checking d'automates à piles : application à la détection de malware. | |
Dependable software systems engineering | |
Distributed cost-optimal planning | |
Efficient algorithms for alternating pushdown systems application to certificate chain discovery with threshold subjects | |
ETAPS 2017 | |
Fine-Grained Complexity of Program Verification | |
Finite and algorithmic model theory, 2011: | |
FOSSACS 2017 | |
Free choice Petri nets | |
General refinement and recursion for the box calculus | |
Handles in Petri nets | |
ICALP 2014 | |
Logics and languages for reliability and security | |
Model checking of persistent petri nets | |
A note on on-the-fly verification algorithms | |
On model-checking pushdown systems models | |
Operational semantics for the Petri box calculus | |
Planification optimale distribuée. | |
polynomial time algorithm to decide liveness of bounded free choice nets | |
Reachability analysis of multithreaded software with asynchronous communication | |
Reachability in reversible free-choice systems | |
Shortest paths in reachability graphs | |
Synthese verteilter Systeme durch höhere Petrinetze mithilfe symbolischer Methoden | |
Synthesis rules for petri nets and how they lead to new results | |
TACAS 2010 | |
Taking Synthesis of Distributed Systems via Petri Games to High Level, Symbolically | |
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 | |
Unfoldings : a partial-order approach to model checking | |
Vérification de systèmes infinis et apprentissage automatique. | |
Verification of Infinite-State Systems and Machine Learning |