Bernhard Reus

Orcid: 0000-0002-5807-856X

Affiliations:
  • University of Sussex, Brighton, UK


According to our database1, Bernhard Reus authored at least 45 papers between 1992 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Interpreting Knowledge-based Programs (Extended Version with Proofs).
CoRR, 2023

Interpreting Knowledge-based Programs.
Proceedings of the Programming Languages and Systems, 2023

2020
Model Checking Software-Defined Networks with Flow Entries that Time Out.
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

Towards Model Checking Real-World Software-Defined Networks.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2016
Limits of Computation - From a Programming Perspective
Undergraduate Topics in Computer Science, Springer, ISBN: 978-3-319-27889-6, 2016

2015
Symbolic Execution Proofs for Higher Order Store Programs.
J. Autom. Reason., 2015

2013
A step-indexed Kripke model of hidden state.
Math. Struct. Comput. Sci., 2013

Specification patterns for reasoning about recursion through the store.
Inf. Comput., 2013

2012
A synthetic theory of sequential domains.
Ann. Pure Appl. Log., 2012

Crowfoot: A Verifier for Higher-Order Store Programs.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

Verifying the reflective visitor pattern.
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs, 2012

2011
Nested Hoare Triples and Frame Rules for Higher-order Store
Log. Methods Comput. Sci., 2011

Step-indexed kripke models over recursive worlds.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Formal reasoning about runtime code update.
Proceedings of the Workshops Proceedings of the 27th International Conference on Data Engineering, 2011

Specification Patterns and Proofs for Recursion through the Store.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Relative Completeness for Logics of Functional Programs.
Proceedings of the Computer Science Logic, 2011

2010
Preface for the special issue on domains.
Math. Struct. Comput. Sci., 2010

A Semantic Foundation for Hidden State.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009
A decidable class of verification conditions for programs with higher order store.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009

2008
A Simple Model of Separation Logic for Higher-Order Store.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2006
Denotational semantics for a program logic of objects.
Math. Struct. Comput. Sci., 2006

Separation Logic for Higher-Order Store.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
About Hoare Logics for Higher-Order Store.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

A Complete Temporal and Spatial Logic for Distributed Systems.
Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005

Denotational Semantics for Abadi and Leino's Logic of Objects.
Proceedings of the Programming Languages and Systems, 2005

2004
Semantics and logic of object calculi.
Theor. Comput. Sci., 2004

2003
Modular Semantics and Logics of Classes.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Class-Based versus Object-Based: A Denotational Comparison.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Preface.
Theor. Comput. Sci., 2001

A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models.
Proceedings of the Fundamental Approaches to Software Engineering, 2001

2000
Towards a Machine-Checked Java Specification Book.
Proceedings of the Theorem Proving in Higher Order Logics, 13th International Conference, 2000

1999
General synthetic domain theory - a logical approach.
Math. Struct. Comput. Sci., 1999

Formalizing Synthetic Domain Theory.
J. Autom. Reason., 1999

Realizability Models for Type Theories.
Proceedings of the Tutorial Workshop on Realizability Semantics and Applications, associated to FLoC'99, the 1999 Federated Logic Conference, Trento, Italy, June 30, 1999

Extensional Sigma-Spaces in Type Theory.
Appl. Categorical Struct., 1999

An Event-Based Structural Operational Semantics of Multi-Threaded Java.
Proceedings of the Formal Syntax and Semantics of Java, 1999

A Logic of Recursive Objects.
Proceedings of the Object-Oriented Technology, ECOOP'99 Workshop Reader, 1999

Monadic Presentations of Lambda Terms Using Generalized Inductive Types.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
Classical Logic, Continuation Semantics and Abstract Machines.
J. Funct. Program., 1998

1997
Verifying a compiler optimization for Multi-Threaded Java.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

From Sequential to Multi-Threaded Java: An Event-Based Operational Semantics.
Proceedings of the Algebraic Methodology and Software Technology, 1997

1996
Program verification in synthetic domain theory.
PhD thesis, 1996

Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions.
Proceedings of the Theorem Proving in Higher Order Logics, 9th International Conference, 1996

1993
Verifying Properties of Module Construction in Type Theory.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
Implementing Higher-Order Functions in an Algebraic Specification Language with Narrowing.
Proceedings of the Programming Language Implementation and Logic Programming, 1992


  Loading...