| Publication | Date of Publication | Type |
|---|
Proof of the Penrose Conjecture for Maximally Parameterized Initial Data Sets
(available as arXiv preprint) | 2026-01-01 | Paper |
A categorical interpretation of Landin's correspondence principle
Lecture Notes in Computer Science | 2023-04-28 | Paper |
Comparison of Distributed Beamforming Algorithms for MIMO Interference Networks
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Combining model checking and data-flow analysis
Handbook of Model Checking | 2018-07-20 | Paper |
Finite-Length MMSE Tomlinson–Harashima Precoding for Frequency Selective Vector Channels
IEEE Transactions on Signal Processing | 2018-06-12 | Paper |
Abstract interpretation from a denotational-semantics perspective
Electronic Notes in Theoretical Computer Science | 2016-05-10 | Paper |
Guards, failure, and partiality: Dijkstra's guarded-command language formulated topologically
Semantics, Logics, and Calculi | 2016-03-23 | Paper |
Extracting program logics from abstract interpretations defined by logical relations
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Inverse-limit and topological aspects of abstract interpretation
Theoretical Computer Science | 2012-05-30 | Paper |
An Action Semantics Based on Two Combinators
Semantics and Algebraic Specification | 2009-10-22 | Paper |
Abstract Interpretation from a Topological Perspective
Static Analysis | 2009-08-18 | Paper |
Underapproximating Predicate Transformers
Static Analysis | 2009-03-12 | Paper |
Comparing Completeness Properties of Static Analyses and Their Logics
Programming Languages and Systems | 2008-05-06 | Paper |
Internal and External Logics of Abstract Interpretations
Lecture Notes in Computer Science | 2008-04-04 | Paper |
State-transition machines for lambda-calculus expressions
Higher-Order and Symbolic Computation | 2007-12-17 | Paper |
State-transition machines, revisited
Higher-Order and Symbolic Computation | 2007-12-17 | Paper |
A calculus of logical relations for over- and underapproximating static analyses
Science of Computer Programming | 2007-01-22 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2005-08-24 | Paper |
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science | 2004-09-24 | Paper |
Structure-preserving binary relations for program abstraction
Lecture Notes in Computer Science | 2003-07-27 | Paper |
Polymorphic lambda calculus and subtyping.
Theoretical Computer Science | 2002-07-15 | Paper |
Accuracy and conservation properties of a three-dimensional unstructured staggered mesh scheme for fluid dynamics
Journal of Computational Physics | 2002-07-04 | Paper |
Modal transition systems: A foundation for three-valued program analysis
Lecture Notes in Computer Science | 2002-01-22 | Paper |
Model-checking. A tutorial introduction
Lecture Notes in Computer Science | 2001-01-04 | Paper |
Stackability in the simply-typed call-by-value lambda calculus
Science of Computer Programming | 2000-07-05 | Paper |
Induction, domains, calculi: Strachey's contributions to programming-language engineering
Higher-Order and Symbolic Computation | 2000-06-04 | Paper |
Cumbersome coordination in repeated games
International Journal of Game Theory | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1231612 (Why is no real title available?) | 1999-01-06 | Paper |
scientific article; zbMATH DE number 1089041 (Why is no real title available?)
(available as arXiv preprint) | 1998-03-02 | Paper |
Full sign-invertibility and symplectic matrices
Linear Algebra and its Applications | 1996-05-30 | Paper |
| scientific article; zbMATH DE number 709368 (Why is no real title available?) | 1995-01-11 | Paper |
Type inference for action semantics
Lecture Notes in Computer Science | 1993-05-18 | Paper |
A security flow control algorithm and its denotational semantics correctness proof
Formal Aspects of Computing | 1993-02-04 | Paper |
Category-sorted algebra-based action semantics
Theoretical Computer Science | 1990-01-01 | Paper |
Detecting stack-based environments in denotational definitions
Science of Computer Programming | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3960977 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3982494 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4008457 (Why is no real title available?) | 1986-01-01 | Paper |
Detecting global variables in denotational specifications
ACM Transactions on Programming Languages and Systems | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3870643 (Why is no real title available?) | 1984-01-01 | Paper |
Approximation properties of abstract data types
Theoretical Computer Science | 1983-01-01 | Paper |
