| Publication | Date of Publication | Type |
|---|
Checking robustness against snapshot isolation
Computer Aided Verification | 2024-02-16 | Paper |
Gradual consistency checking
Computer Aided Verification | 2024-02-16 | Paper |
Automated synthesis of asynchronizations
Static Analysis | 2023-07-28 | Paper |
Constrained properties, semilinear systems, and Petri nets
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
Reachability analysis of pushdown automata: Application to model-checking
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
On the completeness of verifying message passing programs under bounded asynchrony
Computer Aided Verification | 2023-05-05 | Paper |
Reasoning about TSO programs using reduction and abstraction
Computer Aided Verification | 2023-05-05 | Paper |
Robustness Against Transactional Causal Consistency.
(available as arXiv preprint) | 2023-02-03 | Paper |
Boosting Sequential Consistency Checking Using Saturation
1517.68086 | 2022-12-22 | Paper |
| Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes | 2022-12-07 | Paper |
Checking causal consistency of distributed databases
Computing | 2022-09-27 | Paper |
Proving linearizability using forward simulations
(available as arXiv preprint) | 2022-08-12 | Paper |
Checking robustness between weak transactional consistency models
(available as arXiv preprint) | 2021-10-18 | Paper |
| Verifying quantitative temporal properties of procedural programs | 2021-08-04 | Paper |
scientific article; zbMATH DE number 7327945 (Why is no real title available?)
(available as arXiv preprint) | 2021-03-26 | Paper |
| scientific article; zbMATH DE number 7327945 (Why is no real title available?) | 2021-03-26 | Paper |
| Verification of asynchronous programs with nested locks | 2020-11-25 | Paper |
| Formalizing and checking multilevel consistency | 2020-08-05 | Paper |
Checking linearizability of concurrent priority queues
(available as arXiv preprint) | 2020-05-27 | Paper |
Abstract Semantic Diffing of Evolving Concurrent Programs
Static Analysis | 2019-09-16 | Paper |
Abstract semantic diffing of evolving concurrent programs
Formal Methods in System Design | 2019-09-04 | Paper |
Model checking procedural programs
Handbook of Model Checking | 2018-07-20 | Paper |
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Automata, Languages and Programming | 2018-07-04 | Paper |
On reducing linearizability to state reachability
Information and Computation | 2018-06-14 | Paper |
| The benefits of duality in verifying concurrent programs under TSO | 2018-03-21 | Paper |
A load-buffer semantics for total store ordering
(available as arXiv preprint) | 2018-01-23 | Paper |
On verifying causal consistency
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Verifying robustness of event-driven asynchronous programs against concurrency
Programming Languages and Systems | 2017-05-19 | Paper |
| On bounded reachability analysis of shared memory systems | 2017-04-25 | Paper |
Tractable refinement checking for concurrent objects
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
On reducing linearizability to state reachability
Lecture Notes in Computer Science | 2015-11-04 | Paper |
A generic approach to the static analysis of concurrent programs with procedures
Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | Paper |
Analysis of recursively parallel programs
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | 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 |
Context-bounded analysis of TSO systems
From Programs to Systems. The Systems perspective in Computing | 2014-07-24 | Paper |
Verifying eventual consistency of optimistic replication systems
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
On symbolic verification of weakly extended PAD
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
| Abstract regular tree model checking | 2013-10-07 | Paper |
| Handling liveness properties in (\(\omega\)-)regular model checking | 2013-10-02 | Paper |
| Reachability analysis of synchronized PA systems | 2013-10-02 | Paper |
Checking and enforcing robustness against TSO
Programming Languages and Systems | 2013-08-05 | Paper |
Verifying concurrent programs against sequential specifications
Programming Languages and Systems | 2013-08-05 | Paper |
Accurate invariant checking for programs manipulating lists and arrays with infinite data
Automated Technology for Verification and Analysis | 2012-11-21 | 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 |
| Rewriting systems over nested data words | 2012-09-28 | Paper |
Bounded phase analysis of message-passing programs
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 |
Abstract domains for automated reasoning about list-manipulating programs with infinite data
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Context-bounded analysis for concurrent programs with dynamic creation of threads
Logical Methods in Computer Science | 2012-04-02 | Paper |
Deciding Robustness against Total Store Ordering
Automata, Languages and Programming | 2011-07-07 | Paper |
Programs with lists are counter automata
Formal Methods in System Design | 2011-05-23 | Paper |
Parametric verification of a group membership algorithm
Lecture Notes in Computer Science | 2011-04-08 | Paper |
Verification of parametric concurrent systems with prioritized FIFO resource management.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
A Logic-Based Framework for Reasoning about Composite Data Structures
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
COMPOSED BISIMULATION FOR TREE AUTOMATA
International Journal of Foundations of Computer Science | 2009-08-21 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
Logical Methods in Computer Science | 2009-06-30 | 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 |
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
Static Analysis | 2009-03-12 | Paper |
Composed Bisimulation for Tree Automata
Implementation and Applications of Automata | 2009-02-12 | Paper |
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
Implementation and Applications of Automata | 2009-02-12 | Paper |
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Rewriting Models of Boolean Programs
Lecture Notes in Computer Science | 2008-09-25 | Paper |
Monotonic Abstraction for Programs with Dynamic Memory Heaps
Computer Aided Verification | 2008-07-15 | Paper |
An efficient automata approach to some problems on context-free grammars.
Information Processing Letters | 2008-06-27 | Paper |
Computing Simulations over Tree Automata
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Verification of parametric concurrent systems with prioritised FIFO resource management
Formal Methods in System Design | 2008-04-11 | Paper |
Monotonic and Downward Closed Games
Journal Of Logic And Computation | 2008-03-12 | Paper |
Rewriting Systems with Data
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
Computer Aided Verification | 2007-11-29 | Paper |
Programs with Lists Are Counter Automata
Computer Aided Verification | 2007-09-05 | Paper |
A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
A logic of reachable patterns in linked data-structures
The Journal of Logic and Algebraic Programming | 2007-08-23 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Permutation rewriting and algorithmic verification
Information and Computation | 2007-02-20 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Parametric Verification of a Group Membership Algorithm
Theory and Practice of Logic Programming | 2006-07-14 | Paper |
Checking timed Büchi automata emptiness efficiently
Formal Methods in System Design | 2006-02-20 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-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 |
Automatic verification of recursive procedures with one integer parameter.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1903379 (Why is no real title available?) | 2003-05-01 | Paper |
| scientific article; zbMATH DE number 1834575 (Why is no real title available?) | 2003-02-25 | Paper |
| scientific article; zbMATH DE number 1848282 (Why is no real title available?) | 2003-01-01 | Paper |
| scientific article; zbMATH DE number 1796145 (Why is no real title available?) | 2002-09-04 | Paper |
| scientific article; zbMATH DE number 1754626 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1754582 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1670791 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1670792 (Why is no real title available?) | 2001-11-11 | Paper |
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1304329 (Why is no real title available?) | 1999-11-29 | Paper |
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design | 1995-04-10 | Paper |
| scientific article; zbMATH DE number 177515 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177241 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 4119599 (Why is no real title available?) | 1989-01-01 | Paper |
