Bernhard Reus

51 papers A* 3A 2B 11Journal 17Unranked 15
YearRankTypeTitle / Venue / Authors
2023 J jnl
Interpreting Knowledge-based Programs (Extended Version with Proofs).
CoRR
Alexander Knapp, Heribert Mühlberger, Bernhard Reus
2023 A conf
Interpreting Knowledge-based Programs.
ESOP
Alexander Knapp, Heribert Mühlberger, Bernhard Reus
2020 B conf
Model Checking Software-Defined Networks with Flow Entries that Time Out.
FMCAD
Vasileios Klimis, George Parisis, Bernhard Reus
2020 J jnl
Model Checking Software-Defined Networks with Flow Entries that Time Out.
CoRR
Vasileios Klimis, George Parisis, Bernhard Reus
2020 — conf
Towards Model Checking Real-World Software-Defined Networks.
CAV (2)
Vasileios Klimis, George Parisis, Bernhard Reus
2020 J jnl
Towards Model Checking Real-World Software-Defined Networks.
CoRR
Vasileios Klimis, George Parisis, Bernhard Reus
2016 — book
Limits of Computation - From a Programming Perspective
Bernhard Reus
2015 J jnl
Symbolic Execution Proofs for Higher Order Store Programs.
J. Autom. Reason.
Bernhard Reus, Nathaniel Charlton, Ben Horsfall
2013 J jnl
A step-indexed Kripke model of hidden state.
Math. Struct. Comput. Sci.
Jan Schwinghammer, Lars Birkedal, François Pottier, Bernhard Reus, Kristian Støvring, Hongseok Yang
2013 J jnl
Specification patterns for reasoning about recursion through the store.
Inf. Comput.
Nathaniel Charlton, Bernhard Reus
2012 J jnl
A synthetic theory of sequential domains.
Ann. Pure Appl. Log.
Bernhard Reus, Thomas Streicher
2012 B conf
Crowfoot: A Verifier for Higher-Order Store Programs.
VMCAI
Nathaniel Charlton, Ben Horsfall, Bernhard Reus
2012 — conf
Verifying the reflective visitor pattern.
FTfJP@ECOOP
Ben Horsfall, Nathaniel Charlton, Bernhard Reus
2011 — conf
Formal reasoning about runtime code update.
ICDE Workshops
Nathaniel Charlton, Ben Horsfall, Bernhard Reus
2011 J jnl
Nested Hoare Triples and Frame Rules for Higher-order Store
Log. Methods Comput. Sci.
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang
2011 B conf
Relative Completeness for Logics of Functional Programs.
CSL
Bernhard Reus, Thomas Streicher
2011 B conf
Specification Patterns and Proofs for Recursion through the Store.
FCT
Nathaniel Charlton, Bernhard Reus
2011 A* conf
Step-indexed kripke models over recursive worlds.
POPL
Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Kristian Støvring, Jacob Thamsborg, Hongseok Yang
2010 B conf
A Semantic Foundation for Hidden State.
FoSSaCS
Jan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, Bernhard Reus
2010 J jnl
Preface for the special issue on domains.
Math. Struct. Comput. Sci.
Bernhard Reus, Achim Jung, Klaus Keimel, Thomas Streicher
2009 J jnl
A decidable class of verification conditions for programs with higher order store.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol.
Nathaniel Charlton, Bernhard Reus
2009 B conf
Nested Hoare Triples and Frame Rules for Higher-Order Store.
CSL
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang
2008 — conf
A Simple Model of Separation Logic for Higher-Order Store.
ICALP (2)
Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Hongseok Yang
2006 J jnl
Denotational semantics for a program logic of objects.
Math. Struct. Comput. Sci.
Bernhard Reus, Jan Schwinghammer
2006 B conf
Separation Logic for Higher-Order Store.
CSL
Bernhard Reus, Jan Schwinghammer
2005 — conf
A Complete Temporal and Spatial Logic for Distributed Systems.
FroCoS
Dirk Pattinson, Bernhard Reus
2005 A* conf
About Hoare Logics for Higher-Order Store.
ICALP
Bernhard Reus, Thomas Streicher
2005 A conf
Denotational Semantics for Abadi and Leino's Logic of Objects.
ESOP
Bernhard Reus, Jan Schwinghammer
2004 J jnl
Semantics and logic of object calculi.
Theor. Comput. Sci.
Bernhard Reus, Thomas Streicher
2003 B conf
Modular Semantics and Logics of Classes.
CSL
Bernhard Reus
2002 — conf
Class-Based versus Object-Based: A Denotational Comparison.
AMAST
Bernhard Reus
2002 A* conf
Semantics and Logic of Object Calculi.
LICS
Bernhard Reus, Thomas Streicher
2001 B conf
A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models.
FASE
Bernhard Reus, Martin Wirsing, Rolf Hennicker
2001 J jnl
Preface.
Theor. Comput. Sci.
Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus
2000 — conf
Towards a Machine-Checked Java Specification Book.
TPHOLs
Bernhard Reus, Tatjana Hein
1999 — conf
A Logic of Recursive Objects.
ECOOP Workshops
Bernhard Reus
1999 — conf
An Event-Based Structural Operational Semantics of Multi-Threaded Java.
Formal Syntax and Semantics of Java
Pietro Cenciarelli, Alexander Knapp, Bernhard Reus, Martin Wirsing
1999 J jnl
Extensional Sigma-Spaces in Type Theory.
Appl. Categorical Struct.
Bernhard Reus
1999 J jnl
Formalizing Synthetic Domain Theory.
J. Autom. Reason.
Bernhard Reus
1999 J jnl
General synthetic domain theory - a logical approach.
Math. Struct. Comput. Sci.
Bernhard Reus, Thomas Streicher
1999 B conf
Monadic Presentations of Lambda Terms Using Generalized Inductive Types.
CSL
Thorsten Altenkirch, Bernhard Reus
1999 — conf
Realizability Models for Type Theories.
Realizability Semantics and Applications@FLoC
Bernhard Reus
1999 — ed.
Types for Proofs and Programs, International Workshop TYPES '98, Kloster Irsee, Germany, March 27-31, 1998, Selected Papers
TYPES
Thorsten Altenkirch, Wolfgang Naraschewski, Bernhard Reus
1998 J jnl
Classical Logic, Continuation Semantics and Abstract Machines.
J. Funct. Program.
Thomas Streicher, Bernhard Reus
1997 — conf
From Sequential to Multi-Threaded Java: An Event-Based Operational Semantics.
AMAST
Pietro Cenciarelli, Alexander Knapp, Bernhard Reus, Martin Wirsing
1997 — conf
General Synthetic Domain Theory - A Logical Approach.
Category Theory and Computer Science
Bernhard Reus, Thomas Streicher
1997 — conf
Verifying a compiler optimization for Multi-Threaded Java.
WADT
Bernhard Reus, Alexander Knapp, Pietro Cenciarelli, Martin Wirsing
1996 — —
Program verification in synthetic domain theory.
Bernhard Reus
1996 — conf
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions.
TPHOLs
Bernhard Reus
1993 B conf
Verifying Properties of Module Construction in Type Theory.
MFCS
Bernhard Reus, Thomas Streicher
1992 — conf
Implementing Higher-Order Functions in an Algebraic Specification Language with Narrowing.
PLILP
Bernhard Reus