| Publication | Date of Publication | Type |
|---|
Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models
| 2024-02-01 | Paper |
Optimal stateless model checking for causal consistency
| 2023-12-13 | Paper |
Probabilistic total store ordering
Programming Languages and Systems | 2023-08-03 | Paper |
Solving Not-Substring Constraint withFlat Abstraction
| 2023-03-29 | Paper |
Boosting Sequential Consistency Checking Using Saturation
1517.68086 | 2022-12-22 | 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 |
The decidability of verification under PS 2.0
| 2021-10-18 | Paper |
Verifying quantitative temporal properties of procedural programs
| 2021-08-04 | Paper |
Universal safety for timed Petri nets is PSPACE-complete
| 2021-08-04 | Paper |
Zenoness for timed pushdown automata
| 2021-06-21 | Paper |
Verification of asynchronous programs with nested locks
| 2020-11-25 | Paper |
Chain-free string constraints
Automated Technology for Verification and Analysis | 2020-07-20 | Paper |
Data multi-pushdown automata
| 2020-05-27 | Paper |
scientific article; zbMATH DE number 7204383 (Why is no real title available?)
| 2020-05-26 | Paper |
Counter-example guided program verification
| 2020-01-03 | Paper |
Acceleration in multi-pushdown systems
| 2019-09-17 | Paper |
Stateless model checking for TSO and PSO
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
Perfect timed communication is hard
| 2018-12-06 | Paper |
Emptiness of ordered multi-pushdown automata is 2ETIME-complete
International Journal of Foundations of Computer Science | 2018-05-14 | Paper |
The complexity of regular abstractions of one-counter languages
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 |
Data communicating processes with unreliable channels
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 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 |
On bounded reachability analysis of shared memory systems
| 2017-04-25 | Paper |
Verification of dynamic register automata
| 2017-04-25 | Paper |
Timed lossy channel systems
| 2017-01-26 | Paper |
Push-down automata with gap-order constraints
Fundamentals of Software Engineering | 2015-09-30 | Paper |
On the verification problem for weak memory models
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-06-11 | Paper |
Adjacent ordered multi-pushdown systems
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Budget-bounded model-checking pushdown systems
Formal Methods in System Design | 2014-12-05 | Paper |
Context-bounded analysis of TSO systems
From Programs to Systems. The Systems perspective in Computing | 2014-07-24 | Paper |
Analysis of message passing programs using SMT-solvers
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Computing optimal reachability costs in priced dense-timed pushdown automata
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Adjacent ordered multi-pushdown systems
Developments in Language Theory | 2013-06-28 | Paper |
Linear-time model-checking for multithreaded programs under scope-bounding
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Analyzing Asynchronous Programs with Preemption
| 2012-10-19 | Paper |
Model-checking of ordered multi-pushdown automata
Logical Methods in Computer Science | 2012-09-25 | Paper |
Approximating Petri net reachability along context-free traces
| 2012-08-31 | Paper |
Global model checking of ordered multi-pushdown systems
| 2012-08-29 | Paper |
Counter-Example Guided Fence Insertion under TSO
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
What's decidable about weak memory models?
Programming Languages and Systems | 2012-06-22 | Paper |
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Context-bounded analysis for concurrent programs with dynamic creation of threads
Logical Methods in Computer Science | 2012-04-02 | Paper |
ON YEN'S PATH LOGIC FOR PETRI NETS
International Journal of Foundations of Computer Science | 2011-07-14 | Paper |
Verifying parallel programs with dynamic communication structures
Theoretical Computer Science | 2010-10-07 | Paper |
From multi to single stack automata
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
On Yen’s Path Logic for Petri Nets
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Verifying Parallel Programs with Dynamic Communication Structures
Implementation and Application of Automata | 2009-07-09 | Paper |
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
Developments in Language Theory | 2008-10-30 | Paper |
