| The complexity of reasoning with cardinality restrictions and nominals in expressive description logics | 55 | 4.73 | 2011 |
| The 1st verified software competition: experience report | 39 | 1.75 | 2011 |
| Local verification of global invariants in concurrent programs | 27 | 1.26 | 2010 |
| VCC: Contract-based modular verification of concurrent C | 19 | 0.95 | 2009 |
| VCC: A Practical System for Verifying Concurrent C | 242 | 7.99 | 2009 |
| A Precise Yet Efficient Memory Model For C | 35 | 2.00 | 2009 |
| Invariants, Modularity, and Rights | 60 | 1.98 | 2009 |
| Sharing Intelligent Services Between Homes | 0 | 0.34 | 2007 |
| The Inverse Method Implements the Automata Approach for Modal Satisfiability | 20 | 0.97 | 2004 |
| Formal Test Purposes and The Validity of Test Cases | 3 | 0.50 | 2002 |
| Complexity Results and Practical Algorithms for Logics in Knowledge Representation | 187 | 14.75 | 2001 |
| PSPACE Reasoning for Graded Modal Logics | 22 | 1.55 | 2001 |
| Reasoning with Individuals for the Description Logic SHIQ | 148 | 15.68 | 2000 |
| A Tableau Algorithm for the Clique Guarded Fragment | 8 | 0.74 | 2000 |
| How to decide Query Containment under Constraints using a Description Logic | 45 | 6.45 | 2000 |
| Optimisation of Terminological Reasoning | 4 | 0.66 | 2000 |
| Reasoning with Axioms: Theory and Pratice | 26 | 3.01 | 2000 |
| Practical Reasoning for Very Expressive Description Logics | 370 | 46.31 | 2000 |
| A PSpace Algorithm for Graded Modal Logic | 10 | 1.93 | 1999 |
| Practical Reasoning for Expressive Description Logics | 241 | 41.84 | 1999 |
| Tractable and Decidable Fragments of Conceptual Graphs | 13 | 1.04 | 1999 |
| A Suggestion for an n-ary Description Logic | 11 | 0.76 | 1999 |
| On the Complexity of Counting in Description Logics | 1 | 0.38 | 1999 |
| A NExpTime-Complete Description Logic Strictly Contained in C2 | 5 | 0.59 | 1999 |
| Truth { A Verication Platform for Concurrent Systems | 8 | 0.70 | 1998 |
