| Publication | Date of Publication | Type |
|---|
Checking observational purity of procedures
Fundamental Approaches to Software Engineering | 2023-11-24 | Paper |
Sequential verification of serializability
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-06-11 | Paper |
Generalized lattice agreement
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Fault tolerance via idempotence
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
Checking linearizability of encapsulated extended operations
Programming Languages and Systems | 2014-04-16 | Paper |
Reference count analysis with shallow aliasing
Information Processing Letters | 2013-04-04 | Paper |
Mining quantified temporal rules: formalism, algorithms, and evaluation
Science of Computer Programming | 2012-07-20 | Paper |
Logical concurrency control from sequential proofs
Logical Methods in Computer Science | 2012-04-02 | Paper |
Logical Concurrency Control from Sequential Proofs
Programming Languages and Systems | 2010-05-04 | Paper |
| Semantics of program representation graphs | 2010-02-05 | Paper |
Bottom-Up Shape Analysis
Static Analysis | 2009-08-18 | Paper |
Heap Decomposition for Concurrent Shape Analysis
Static Analysis | 2008-08-28 | Paper |
Thread Quantification for Concurrent Shape Analysis
Computer Aided Verification | 2008-07-15 | Paper |
Abstract Counterexample-Based Refinement for Powerset Domains
Program Analysis and Compilation, Theory and Practice | 2007-09-24 | Paper |
Shape Analysis by Graph Decomposition
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Typestate verification: abstraction techniques and complexity results
Science of Computer Programming | 2005-10-10 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2090861 (Why is no real title available?) | 2004-08-13 | Paper |
| scientific article; zbMATH DE number 1948397 (Why is no real title available?) | 2003-07-13 | Paper |
On sparse evaluation representations
Theoretical Computer Science | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1638664 (Why is no real title available?) | 2001-08-29 | Paper |
On competitive on-line algorithms for the dynamic priority-ordering problem
Information Processing Letters | 2000-08-14 | Paper |
On the computational complexity of dynamic graph problems
Theoretical Computer Science | 1997-02-27 | Paper |
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
Journal of Algorithms | 1996-10-16 | Paper |
Bounded incremental computation
Lecture Notes in Computer Science | 1996-07-24 | Paper |
New sequential and parallel algorithms for interval graph recognition
Information Processing Letters | 1990-01-01 | Paper |
A unified approach to domination problems on interval graphs
Information Processing Letters | 1988-01-01 | Paper |
Total domination in interval graphs revisited
Information Processing Letters | 1988-01-01 | Paper |
