2024
Verification under Intel-x86 with Persistency.
Proc. ACM Program. Lang., 2024
2022
Verifying Reachability for TSO Programs with Dynamic Thread Creation.
Proceedings of the Networked Systems - 10th International Conference, 2022
Consistency and Persistency in Program Verification: Challenges and Opportunities.
Proceedings of the Principles of Systems Design, 2022
2021
Deciding reachability under persistent x86-TSO.
Proc. ACM Program. Lang., 2021
Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains.
Proceedings of the Programming Languages and Systems, 2021
2019
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering.
CoRR, 2019
2018
Regular Separability of Well-Structured Transition Systems.
Proceedings of the 29th International Conference on Concurrency Theory, 2018
Verifying Quantitative Temporal Properties of Procedural Programs.
Proceedings of the 29th International Conference on Concurrency Theory, 2018
2017
Parity Games on Bounded Phase Multi-pushdown Systems.
Proceedings of the Networked Systems - 5th International Conference, 2017
Verification of Asynchronous Programs with Nested Locks.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017
2016
Acceleration in Multi-PushDown Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016
The complexity of regular abstractions of one-counter languages.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
2015
Checking conformance for time-constrained scenario-based specifications.
Theor. Comput. Sci., 2015
2014
Adjacent Ordered Multi-Pushdown Systems.
Int. J. Found. Comput. Sci., 2014
Distributed Timed Automata with Independently Evolving Clocks.
Fundam. Informaticae, 2014
On Bounded Reachability Analysis of Shared Memory Systems.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014
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), 2014
Controllers for the Verification of Communicating Multi-pushdown Systems.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014
Verifying Communicating Multi-pushdown Systems via Split-Width.
Proceedings of the Automated Technology for Verification and Analysis, 2014
2012
Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard
CoRR, 2012
Model Checking Languages of Data Words.
Proceedings of the Foundations of Software Science and Computational Structures, 2012
MSO Decidability of Multi-Pushdown Systems via Split-Width.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012
Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding.
Proceedings of the Automated Technology for Verification and Analysis, 2012
The Theory of Message Sequence Charts.
Proceedings of the Modern Applications of Automata Theory., 2012
2010
Analysing Message Sequence Graph Specifications.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010
Model checking time-constrained scenario-based specifications.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010
2009
Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009
2007
Local Testing of Message Sequence Charts Is Difficult.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
Checking Coverage for Infinite Collections of Timed Scenarios.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007
Anchored Concatenation of MSCs.
Proceedings of the Formal Models, 2007
2005
A theory of regular MSC languages.
Inf. Comput., 2005
Causal Closure for MSC Languages.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005
2004
An unfold/fold transformation framework for definite logic programs.
ACM Trans. Program. Lang. Syst., 2004
2003
Bounded time-stamping in message-passing systems.
Theor. Comput. Sci., 2003
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Netcharts: Bridging the gap between HMSCs and executable specifications.
Proceedings of the CONCUR 2003, 2003
2002
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs.
Int. J. Found. Comput. Sci., 2002
Resource-Constrained Model Checking of Recursive Programs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002
2001
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models.
Proceedings of the Logic Programming, 17th International Conference, 2001
2000
Verification of Parameterized Systems Using Logic Program Transformations.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000
Regular Collections of Message Sequence Charts.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
On Message Sequence Graphs and Finitely Generated Regular MSC Languages.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
Synthesizing Distributed Finite-State Systems from MSCs.
Proceedings of the CONCUR 2000, 2000
1999
A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs.
Proceedings of the Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29, 1999
Generalized Unfold/fold Transformation Systems for Normal Logic Programs.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999
Faster Model Checking for Open Systems.
Proceedings of the Advances in Computing Science, 1999
1998
Logic Programming and Model Checking.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998
Robust Asynchronous Protocols Are Finite-State.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
Infinite Probabilistic and Nonprobabilistic Testing.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998
Towards a Characterisation of Finite-State Message-Passing Systems.
Proceedings of the Advances in Computing Science, 1998
1995
Keeping Track of the Latest Gossip in Message-Passing Systems.
Proceedings of the International Workshop on Structures in Concurrency Theory, 1995
1994
On the Computational Power of Operators in ICSP with Fairness.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994
1993
Infinitary Parallelism without Unbounded Nondeterminism in CSP.
Acta Informatica, 1993
ICSP and Its Relationship with ACSP and CSP.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993