| Publication | Date of Publication | Type |
|---|
Bounded quantifier instantiation for checking inductive invariants
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Bounded quantifier instantiation for checking inductive invariants
(available as arXiv preprint) | 2019-09-13 | Paper |
| The $k$-Dimensional Weisfeiler-Leman Algorithm | 2019-07-22 | Paper |
An \(n!\) lower bound on formula size
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Decidability of inferring inductive invariants
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Decentralizing SDN policies
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Modular reasoning about heap paths via effectively propositional formulas
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
Solving geometry problems using a combination of symbolic and numerical reasoning
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Applicability conditions for plans with loops: computability results and algorithms
Artificial Intelligence | 2013-08-23 | Paper |
Experimental descriptive complexity
Logic and Program Semantics | 2012-07-16 | Paper |
A new representation and associated algorithms for generalized planning
Artificial Intelligence | 2011-06-17 | Paper |
Finding Reductions Automatically
Fields of Logic and Computation | 2010-09-03 | Paper |
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
Logical Methods in Computer Science | 2009-08-20 | Paper |
Simulating reachability using first-order logic with applications to verification of linked data structures
Logical Methods in Computer Science | 2009-06-30 | Paper |
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences | 2009-04-30 | Paper |
First-Order and Temporal Logics for Nested Words
Logical Methods in Computer Science | 2009-04-29 | Paper |
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words
Computer Science Logic | 2009-03-05 | Paper |
Constructing Specialized Shape Analyses for Uniform Change
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
The Complexity of Decentralized Control of Markov Decision Processes
Mathematics of Operations Research | 2005-11-11 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Journal of Computer and System Sciences | 2005-05-12 | Paper |
Tree canonization and transitive closure
Information and Computation | 2003-01-14 | Paper |
Embedding linkages on an integer lattice
Algorithmica | 2002-05-21 | Paper |
Descriptive complexity: a logician's approach to computation.
Notices of the American Mathematical Society | 2002-02-04 | Paper |
Number of variables is equivalent to space
The Journal of Symbolic Logic | 2001-12-06 | Paper |
On the unusual effectiveness of logic in computer science
The Bulletin of Symbolic Logic | 2001-09-10 | Paper |
On the unusual effectiveness of logic in computer science
The Bulletin of Symbolic Logic | 2001-09-10 | Paper |
| scientific article; zbMATH DE number 1343480 (Why is no real title available?) | 2001-05-06 | Paper |
| scientific article; zbMATH DE number 1860653 (Why is no real title available?) | 2001-01-01 | Paper |
Reachability logic: an efficient fragment of transitive closure logic
Logic Journal of the IGPL | 2000-11-14 | Paper |
| scientific article; zbMATH DE number 1414308 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1302020 (Why is no real title available?) | 1999-12-07 | Paper |
| scientific article; zbMATH DE number 1254648 (Why is no real title available?) | 1999-02-24 | Paper |
Dyn-FO: A parallel, dynamic complexity class
Journal of Computer and System Sciences | 1998-06-11 | Paper |
| scientific article; zbMATH DE number 1072527 (Why is no real title available?) | 1997-10-08 | Paper |
Reachability and the power of local ordering
Theoretical Computer Science | 1997-09-29 | Paper |
A First-Order Isomorphism Theorem
SIAM Journal on Computing | 1997-05-26 | Paper |
The expressiveness of a family of finite set languages
Theoretical Computer Science | 1997-02-27 | Paper |
The complexity of iterated multiplication
Information and Computation | 1995-04-10 | Paper |
| scientific article; zbMATH DE number 512825 (Why is no real title available?) | 1994-03-10 | Paper |
An optimal lower bound on the number of variables for graph identification
Combinatorica | 1993-03-10 | Paper |
| scientific article; zbMATH DE number 17544 (Why is no real title available?) | 1992-06-26 | Paper |
On uniformity within \(NC^ 1\)
Journal of Computer and System Sciences | 1990-01-01 | Paper |
Definability with bounded number of bound variables
Information and Computation | 1989-01-01 | Paper |
Expressibility and Parallel Complexity
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4106276 (Why is no real title available?) | 1989-01-01 | Paper |
Relativizing relativized computations
Theoretical Computer Science | 1989-01-01 | Paper |
Nondeterministic Space is Closed under Complementation
SIAM Journal on Computing | 1988-01-01 | Paper |
Languages that Capture Complexity Classes
SIAM Journal on Computing | 1987-01-01 | Paper |
Interpreting logics of knowledge in propositional dynamic logic
Information Processing Letters | 1987-01-01 | Paper |
Relational queries computable in polynomial time
Information and Control | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3921977 (Why is no real title available?) | 1985-01-01 | Paper |
Sparse sets in NP-P: EXPTIME versus NEXPTIME
Information and Control | 1985-01-01 | Paper |
Upper and lower bounds for first order expressibility
Journal of Computer and System Sciences | 1982-01-01 | Paper |
Number of quantifiers is better than number of tape cells
Journal of Computer and System Sciences | 1981-01-01 | Paper |
McColm conjecture
(available as arXiv preprint) | N/A | Paper |
