| Publication | Date of Publication | Type |
|---|
Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models
| 2024-02-01 | Paper |
Parameterized verification under TSO with data types
| 2023-12-13 | Paper |
Optimal stateless model checking for causal consistency
| 2023-12-13 | Paper |
Probabilistic total store ordering
Programming Languages and Systems | 2023-08-03 | Paper |
Regular model checking: evolution and perspectives
Model Checking, Synthesis, and Learning | 2023-05-26 | Paper |
Solving Not-Substring Constraint withFlat Abstraction
| 2023-03-29 | Paper |
scientific article; zbMATH DE number 7561313 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559472 (Why is no real title available?)
| 2022-07-18 | Paper |
Well structured transition systems with history
| 2021-12-03 | Paper |
The decidability of verification under PS 2.0
| 2021-10-18 | Paper |
Universal safety for timed Petri nets is PSPACE-complete
| 2021-08-04 | Paper |
Zenoness for timed pushdown automata
| 2021-06-21 | Paper |
Petri nets with time and cost
| 2021-05-06 | Paper |
Chain-free string constraints
Automated Technology for Verification and Analysis | 2020-07-20 | Paper |
Data multi-pushdown automata
| 2020-05-27 | Paper |
Comparing Source Sets and Persistent Sets for Partial Order Reduction
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Counter-example guided program verification
| 2020-01-03 | Paper |
scientific article; zbMATH DE number 7121861 (Why is no real title available?)
| 2019-10-24 | Paper |
Stateless model checking for TSO and PSO
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
Fragment abstraction for concurrent shape analysis
| 2019-09-13 | Paper |
Undecidable verification problems for programs with unreliable channels
Automata, Languages and Programming | 2019-04-29 | Paper |
Perfect timed communication is hard
| 2018-12-06 | Paper |
Source sets: a foundation for optimal dynamic partial order reduction
Journal of the ACM | 2018-05-17 | Paper |
Data communicating processes with unreliable channels
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Infinite-state energy games
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
The benefits of duality in verifying concurrent programs under TSO
| 2018-03-21 | Paper |
A load-buffer semantics for total store ordering
| 2018-01-23 | Paper |
Mending fences with self-invalidation and self-downgrade
| 2018-01-23 | Paper |
Stateless model checking for TSO and PSO
Acta Informatica | 2017-12-01 | Paper |
What's decidable about availability languages?
| 2017-07-13 | Paper |
Dense-timed pushdown automata
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Verification of dynamic register automata
| 2017-04-25 | Paper |
Timed lossy channel systems
| 2017-01-26 | Paper |
Verification of heap manipulating programs with ordered data by extended forest automata
Acta Informatica | 2016-06-28 | Paper |
Qualitative analysis of VASS-induced MDPs
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Parameterized verification of time-sensitive models of ad hoc network protocols
Theoretical Computer Science | 2015-12-15 | Paper |
Push-down automata with gap-order constraints
Fundamentals of Software Engineering | 2015-09-30 | Paper |
Monotonic abstraction in parameterized verification
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
Universality of R-automata with Value Copying
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Stochastic parity games on lossy channel systems
Logical Methods in Computer Science | 2015-01-15 | Paper |
Budget-bounded model-checking pushdown systems
Formal Methods in System Design | 2014-12-05 | Paper |
All for the price of few (parameterized verification through view abstraction)
Lecture Notes in Computer Science | 2014-11-03 | Paper |
Mediating for reduction (on minimizing alternating Büchi automata)
Theoretical Computer Science | 2014-09-10 | Paper |
A uniform (bi-)simulation-based framework for reducing tree automata
Electronic Notes in Theoretical Computer Science | 2014-07-23 | Paper |
Verification of heap manipulating programs with ordered data by extended forest automata
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Analysis of message passing programs using SMT-solvers
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Optimal dynamic partial order reduction
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
Computing optimal reachability costs in priced dense-timed pushdown automata
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Priced timed Petri nets
Logical Methods in Computer Science | 2013-11-28 | Paper |
Closed, open, and robust timed networks
| 2013-10-02 | Paper |
Solving parity games on integer vectors
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
An integrated specification and verification technique for highly concurrent data structures
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Monotonic abstraction for programs with multiply-linked structures
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
Mediating for reduction (on minimizing alternating Büchi automata)
| 2012-10-24 | Paper |
Counter-Example Guided Fence Insertion under TSO
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
Language and Automata Theory and Applications | 2012-06-08 | Paper |
On the Verification of Timed Ad Hoc Networks
Lecture Notes in Computer Science | 2011-10-07 | Paper |
Monotonic abstraction for programs with multiply-linked structures
Lecture Notes in Computer Science | 2011-10-07 | Paper |
Advanced Ramsey-based Büchi automata inclusion testing
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Carrying probabilities to the infinite world
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
A classification of the expressive power of well-structured transition systems
Information and Computation | 2011-07-27 | Paper |
Automatic verification of directory-based consistency protocols with graph constraints
International Journal of Foundations of Computer Science | 2011-07-14 | Paper |
Well (and better) quasi-ordered transition systems
The Bulletin of Symbolic Logic | 2011-01-13 | Paper |
Sampled semantics of timed automata
Logical Methods in Computer Science | 2010-09-21 | Paper |
Constrained monotonic abstraction: a CEGAR for parameterized verification
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
Tools and Algorithms for the Construction and Analysis of Systems | 2010-04-27 | Paper |
Algorithmic improvements in regular model checking.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Forcing monotonicity in parameterized verification: from multisets to words
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Approximated parameterized verification of infinite-state processes with global conditions
Formal Methods in System Design | 2009-11-23 | Paper |
MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
International Journal of Foundations of Computer Science | 2009-11-19 | Paper |
Automatic Verification of Directory-Based Consistency Protocols
Lecture Notes in Computer Science | 2009-11-19 | Paper |
COMPOSED BISIMULATION FOR TREE AUTOMATA
International Journal of Foundations of Computer Science | 2009-08-21 | Paper |
On the Qualitative Analysis of Conformon P Systems
Membrane Computing | 2009-07-28 | Paper |
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Comparing the Expressive Power of Well-Structured Transition Systems
Computer Science Logic | 2009-03-05 | Paper |
Composed Bisimulation for Tree Automata
Implementation and Applications of Automata | 2009-02-12 | Paper |
Universality analysis for one-clock timed automata
| 2009-02-10 | Paper |
Monotonic Abstraction in Action
Theoretical Aspects of Computing - ICTAC 2008 | 2009-01-27 | Paper |
Using forward reachability analysis for verification of timed Petri nets
| 2009-01-15 | Paper |
R-Automata
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Eager Markov Chains
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Monotonic Abstraction for Programs with Dynamic Memory Heaps
Computer Aided Verification | 2008-07-15 | Paper |
Zone-Based Universality Analysis for Single-Clock Timed Automata
Lecture Notes in Computer Science | 2008-07-01 | Paper |
BISIMULATION MINIMIZATION OF TREE AUTOMATA
International Journal of Foundations of Computer Science | 2008-05-20 | Paper |
Computing Simulations over Tree Automata
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Stochastic Games with Lossy Channels
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Handling Parameterized Systems with Non-atomic Global Conditions
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Decisive Markov Chains
Logical Methods in Computer Science | 2008-04-01 | Paper |
Monotonic and Downward Closed Games
Journal Of Logic And Computation | 2008-03-12 | Paper |
Parameterized Verification of Infinite-State Processes with Global Conditions
Computer Aided Verification | 2007-11-29 | Paper |
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
Logical Methods in Computer Science | 2007-10-11 | Paper |
Sampled Universality of Timed Automata
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Bisimulation Minimization of Tree Automata
Implementation and Application of Automata | 2007-09-06 | Paper |
Proving Liveness by Backwards Reachability
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Tree regular model checking: a simulation-based approach
The Journal of Logic and Algebraic Programming | 2006-08-17 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Verification of probabilistic systems with faulty communication
Information and Computation | 2005-11-22 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Lecture Notes in Computer Science | 2005-08-19 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Simulating perfect channels with probabilistic lossy channels
Information and Computation | 2005-05-12 | Paper |
scientific article; zbMATH DE number 2102701 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2102702 (Why is no real title available?)
| 2004-09-24 | Paper |
Using forward reachability analysis for verification of lossy channel systems
Formal Methods in System Design | 2004-09-09 | Paper |
SAT-solving the coverability problem for Petri nets
Formal Methods in System Design | 2004-09-09 | Paper |
scientific article; zbMATH DE number 1956504 (Why is no real title available?)
| 2003-07-30 | Paper |
scientific article; zbMATH DE number 1927558 (Why is no real title available?)
| 2003-06-12 | Paper |
scientific article; zbMATH DE number 1903380 (Why is no real title available?)
| 2003-05-01 | Paper |
scientific article; zbMATH DE number 1863156 (Why is no real title available?)
| 2003-02-03 | Paper |
Model checking of systems with many identical timed processes
Theoretical Computer Science | 2003-01-21 | Paper |
Algorithmic analysis of programs with well quasi-ordered domains.
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1759620 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1755138 (Why is no real title available?)
| 2002-06-13 | Paper |
scientific article; zbMATH DE number 1754626 (Why is no real title available?)
| 2002-06-12 | Paper |
scientific article; zbMATH DE number 1670797 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1629965 (Why is no real title available?)
| 2001-11-06 | Paper |
Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1304996 (Why is no real title available?)
| 1999-06-17 | Paper |
Undecidable verification problems for programs with unreliable channels
Information and Computation | 1997-03-06 | Paper |
Verifying programs with unreliable channels
Information and Computation | 1996-10-01 | Paper |
Automatic verification of a class of systolic circuits
Formal Aspects of Computing | 1992-09-26 | Paper |
