default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernhard Reus
Person information
- affiliation: University of Sussex, Brighton, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c31]Alexander Knapp
, Heribert Mühlberger, Bernhard Reus:
Interpreting Knowledge-based Programs. ESOP 2023: 253-280- [i3]Alexander Knapp, Heribert Mühlberger, Bernhard Reus:
Interpreting Knowledge-based Programs (Extended Version with Proofs). CoRR abs/2301.10807 (2023) - 2020
- [c30]Vasileios Klimis, George Parisis, Bernhard Reus:
Towards Model Checking Real-World Software-Defined Networks. CAV (2) 2020: 126-148 - [c29]Vasileios Klimis, George Parisis, Bernhard Reus:
Model Checking Software-Defined Networks with Flow Entries that Time Out. FMCAD 2020: 179-184 - [i2]Vasileios Klimis, George Parisis, Bernhard Reus:
Towards Model Checking Real-World Software-Defined Networks. CoRR abs/2004.11988 (2020) - [i1]Vasileios Klimis, George Parisis, Bernhard Reus:
Model Checking Software-Defined Networks with Flow Entries that Time Out. CoRR abs/2008.06149 (2020)
2010 – 2019
- 2016
- [b2]Bernhard Reus:
Limits of Computation - From a Programming Perspective. Undergraduate Topics in Computer Science, Springer 2016, ISBN 978-3-319-27887-2, pp. 1-329 - 2015
- [j14]Bernhard Reus, Nathaniel Charlton, Ben Horsfall:
Symbolic Execution Proofs for Higher Order Store Programs. J. Autom. Reason. 54(3): 199-284 (2015) - 2013
- [j13]Nathaniel Charlton, Bernhard Reus:
Specification patterns for reasoning about recursion through the store. Inf. Comput. 231: 167-203 (2013) - [j12]Jan Schwinghammer, Lars Birkedal, François Pottier, Bernhard Reus, Kristian Støvring, Hongseok Yang:
A step-indexed Kripke model of hidden state. Math. Struct. Comput. Sci. 23(1): 1-54 (2013) - 2012
- [j11]Bernhard Reus, Thomas Streicher:
A synthetic theory of sequential domains. Ann. Pure Appl. Log. 163(8): 1062-1074 (2012) - [c28]Ben Horsfall, Nathaniel Charlton, Bernhard Reus:
Verifying the reflective visitor pattern. FTfJP@ECOOP 2012: 27-34 - [c27]Nathaniel Charlton, Ben Horsfall, Bernhard Reus:
Crowfoot: A Verifier for Higher-Order Store Programs. VMCAI 2012: 136-151 - 2011
- [j10]Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang:
Nested Hoare Triples and Frame Rules for Higher-order Store. Log. Methods Comput. Sci. 7(3) (2011) - [c26]Bernhard Reus, Thomas Streicher:
Relative Completeness for Logics of Functional Programs. CSL 2011: 470-480 - [c25]Nathaniel Charlton, Bernhard Reus:
Specification Patterns and Proofs for Recursion through the Store. FCT 2011: 310-321 - [c24]Nathaniel Charlton, Ben Horsfall, Bernhard Reus:
Formal reasoning about runtime code update. ICDE Workshops 2011: 134-138 - [c23]Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Kristian Støvring, Jacob Thamsborg, Hongseok Yang:
Step-indexed kripke models over recursive worlds. POPL 2011: 119-132 - 2010
- [j9]Bernhard Reus, Achim Jung, Klaus Keimel, Thomas Streicher:
Preface for the special issue on domains. Math. Struct. Comput. Sci. 20(2): 105-106 (2010) - [c22]Jan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, Bernhard Reus:
A Semantic Foundation for Hidden State. FoSSaCS 2010: 2-17
2000 – 2009
- 2009
- [j8]Nathaniel Charlton, Bernhard Reus:
A decidable class of verification conditions for programs with higher order store. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 23 (2009) - [c21]Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang:
Nested Hoare Triples and Frame Rules for Higher-Order Store. CSL 2009: 440-454 - 2008
- [c20]Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Hongseok Yang:
A Simple Model of Separation Logic for Higher-Order Store. ICALP (2) 2008: 348-360 - 2006
- [j7]Bernhard Reus, Jan Schwinghammer:
Denotational semantics for a program logic of objects. Math. Struct. Comput. Sci. 16(2): 313-358 (2006) - [c19]Bernhard Reus, Jan Schwinghammer:
Separation Logic for Higher-Order Store. CSL 2006: 575-590 - 2005
- [c18]Bernhard Reus, Jan Schwinghammer:
Denotational Semantics for Abadi and Leino's Logic of Objects. ESOP 2005: 263-278 - [c17]Dirk Pattinson, Bernhard Reus:
A Complete Temporal and Spatial Logic for Distributed Systems. FroCoS 2005: 122-137 - [c16]Bernhard Reus, Thomas Streicher:
About Hoare Logics for Higher-Order Store. ICALP 2005: 1337-1348 - 2004
- [j6]Bernhard Reus, Thomas Streicher:
Semantics and logic of object calculi. Theor. Comput. Sci. 316(1): 191-213 (2004) - 2003
- [c15]Bernhard Reus:
Modular Semantics and Logics of Classes. CSL 2003: 456-469 - 2002
- [c14]Bernhard Reus:
Class-Based versus Object-Based: A Denotational Comparison. AMAST 2002: 473-488 - [c13]Bernhard Reus, Thomas Streicher:
Semantics and Logic of Object Calculi. LICS 2002: 113- - 2001
- [j5]Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus:
Preface. Theor. Comput. Sci. 264(2): 169 (2001) - [c12]Bernhard Reus, Martin Wirsing, Rolf Hennicker:
A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models. FASE 2001: 300-317 - 2000
- [c11]Bernhard Reus, Tatjana Hein:
Towards a Machine-Checked Java Specification Book. TPHOLs 2000: 480-497
1990 – 1999
- 1999
- [j4]Bernhard Reus:
Extensional Sigma-Spaces in Type Theory. Appl. Categorical Struct. 7(1-2): 159-183 (1999) - [j3]Bernhard Reus:
Formalizing Synthetic Domain Theory. J. Autom. Reason. 23(3-4): 411-444 (1999) - [j2]Bernhard Reus, Thomas Streicher:
General synthetic domain theory - a logical approach. Math. Struct. Comput. Sci. 9(2): 177-223 (1999) - [c10]Thorsten Altenkirch, Bernhard Reus:
Monadic Presentations of Lambda Terms Using Generalized Inductive Types. CSL 1999: 453-468 - [c9]Bernhard Reus:
A Logic of Recursive Objects. ECOOP Workshops 1999: 107 - [c8]Pietro Cenciarelli, Alexander Knapp, Bernhard Reus, Martin Wirsing:
An Event-Based Structural Operational Semantics of Multi-Threaded Java. Formal Syntax and Semantics of Java 1999: 157-200 - [c7]Bernhard Reus:
Realizability Models for Type Theories. Realizability Semantics and Applications@FLoC 1999: 128-158 - [e1]Thorsten Altenkirch, Wolfgang Naraschewski, Bernhard Reus:
Types for Proofs and Programs, International Workshop TYPES '98, Kloster Irsee, Germany, March 27-31, 1998, Selected Papers. Lecture Notes in Computer Science 1657, Springer 1999, ISBN 3-540-66537-4 [contents] - 1998
- [j1]Thomas Streicher, Bernhard Reus:
Classical Logic, Continuation Semantics and Abstract Machines. J. Funct. Program. 8(6): 543-572 (1998) - 1997
- [c6]Pietro Cenciarelli, Alexander Knapp, Bernhard Reus, Martin Wirsing:
From Sequential to Multi-Threaded Java: An Event-Based Operational Semantics. AMAST 1997: 75-90 - [c5]Bernhard Reus, Thomas Streicher:
General Synthetic Domain Theory - A Logical Approach. Category Theory and Computer Science 1997: 293-313 - [c4]Bernhard Reus, Alexander Knapp, Pietro Cenciarelli, Martin Wirsing:
Verifying a compiler optimization for Multi-Threaded Java. WADT 1997: 402-417 - 1996
- [b1]Bernhard Reus:
Program verification in synthetic domain theory. Ludwig Maximilians University Munich, Shaker 1996, ISBN 3-8265-1352-5, pp. 1-293 - [c3]Bernhard Reus:
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions. TPHOLs 1996: 365-380 - 1993
- [c2]Bernhard Reus, Thomas Streicher:
Verifying Properties of Module Construction in Type Theory. MFCS 1993: 660-670 - 1992
- [c1]Bernhard Reus:
Implementing Higher-Order Functions in an Algebraic Specification Language with Narrowing. PLILP 1992: 483-484
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
