| Publication | Date of Publication | Type |
|---|
Partial order reductions for timed systems
| 2025-01-27 | Paper |
Exposing inter-process information for efficient PDEs of spatial stochastic systems on multicores
ACM Transactions on Modeling and Computer Simulation | 2024-09-08 | Paper |
An active learning approach to synthesizing program contracts
| 2024-06-05 | Paper |
Assumption/guarantee specifications in linear-time temporal logic (extended abstract)
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
Deciding bisimulation equivalences for a class of non-finite-state programs
STACS 89 | 2022-08-16 | Paper |
Towards a complete hierarchy of compositional dataflow models
Lecture Notes in Computer Science | 2022-08-16 | Paper |
Combining black-box and white-box techniques for learning register automata
| 2022-02-16 | Paper |
Proving refinement using transduction
| 2020-12-03 | Paper |
Comparing Source Sets and Persistent Sets for Partial Order Reduction
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Stateless model checking for TSO and PSO
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
Optimal dynamic partial order reduction with observers
| 2019-09-16 | 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 |
Source sets: a foundation for optimal dynamic partial order reduction
Journal of the ACM | 2018-05-17 | Paper |
Stateless model checking for TSO and PSO
Acta Informatica | 2017-12-01 | Paper |
Active learning for extended finite state machines
Formal Aspects of Computing | 2016-08-04 | Paper |
Verification of heap manipulating programs with ordered data by extended forest automata
Acta Informatica | 2016-06-28 | Paper |
Mediator Synthesis in a Component Algebra with Data
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Generating models of infinite-state communication protocols using regular inference with abstraction
Formal Methods in System Design | 2015-03-24 | Paper |
A succinct canonical register automaton model
Journal of Logical and Algebraic Methods in Programming | 2014-12-03 | Paper |
An algebraic theory of interface automata
Theoretical Computer Science | 2014-08-27 | Paper |
Verification of heap manipulating programs with ordered data by extended forest automata
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 |
Inference of timed transition systems
| 2013-10-02 | Paper |
Insights to Angluin's learning
| 2013-09-20 | 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 |
Using refinement calculus techniques to prove linearizability
Formal Aspects of Computing | 2013-03-22 | Paper |
A succinct canonical register automaton model for data domains with binary relations
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Demonstrating Learning of Register Automata
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
A compositional specification theory for component behaviours
Programming Languages and Systems | 2012-06-22 | Paper |
Inferring canonical register automata
Lecture Notes in Computer Science | 2012-06-15 | Paper |
A Succinct Canonical Register Automaton Model
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Eliminating queues from RT UML model representations
Lecture Notes in Computer Science | 2011-04-08 | Paper |
Learning of event-recording automata
Theoretical Computer Science | 2010-11-11 | Paper |
Algorithmic improvements in regular model checking.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Systematic Acceleration in Regular Model Checking
Computer Aided Verification | 2007-11-29 | Paper |
Inference of Event-Recording Automata Using Timed Decision Trees
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Proving Liveness by Backwards Reachability
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Formal Approaches to Software Testing
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Fundamental Approaches to Software Engineering
Lecture Notes in Computer Science | 2005-09-13 | 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 |
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 |
Using forward reachability analysis for verification of lossy channel systems
Formal Methods in System Design | 2004-09-09 | Paper |
scientific article; zbMATH DE number 2077125 (Why is no real title available?)
| 2004-07-01 | Paper |
scientific article; zbMATH DE number 2017361 (Why is no real title available?)
| 2003-12-14 | 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 |
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science | 2002-07-15 | Paper |
scientific article; zbMATH DE number 1759620 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1728525 (Why is no real title available?)
| 2002-04-15 | Paper |
Incremental requirement specification for evolving systems
Nordic Journal of Computing | 2002-01-31 | Paper |
scientific article; zbMATH DE number 1670791 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1670560 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1638655 (Why is no real title available?)
| 2001-08-29 | Paper |
Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science | 2001-08-20 | Paper |
Probabilistic extensions of process algebras.
| 2001-01-01 | Paper |
scientific article; zbMATH DE number 1538041 (Why is no real title available?)
| 2000-12-03 | Paper |
A fully abstract semantics for concurrent constraint programming
Information and Computation | 1999-03-23 | Paper |
Undecidable verification problems for programs with unreliable channels
Information and Computation | 1997-03-06 | Paper |
Assumption/guarantee specifications in linear-time temporal logic
Theoretical Computer Science | 1997-02-27 | Paper |
Verifying programs with unreliable channels
Information and Computation | 1996-10-01 | Paper |
A logic for reasoning about time and reliability
Formal Aspects of Computing | 1995-02-09 | Paper |
A fully abstract trace model for dataflow and asynchronous networks
Distributed Computing | 1994-09-13 | Paper |
Deciding bisimulation equivalences for a class of non-finite-state programs
Information and Computation | 1994-03-24 | Paper |
scientific article; zbMATH DE number 140247 (Why is no real title available?)
| 1993-03-28 | Paper |
scientific article; zbMATH DE number 4213439 (Why is no real title available?)
| 1990-01-01 | Paper |
