Kai Engelhardt

According to our database, Kai Engelhardt authored at least 23 papers between 1993 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2018

COVERN: A Logic for Compositional Verification of Information Flow Control.

Toby C. Murray, Robert Sison, Kai Engelhardt

Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018

2017

A Better Composition Operator for Quantitative Information Flow Analyses.

Kai Engelhardt

Proceedings of the Computer Security - ESORICS 2017, 2017

2015

Relaxing Safely: Verified On-the-Fly Garbage Collection for x86-TSO.

Peter Gammie, Tony Hosking, Kai Engelhardt

Arch. Formal Proofs, 2015

2012

Intransitive noninterference in nondeterministic systems.

Kai Engelhardt, Ron van der Meyden, Chenyi Zhang

Proceedings of the ACM Conference on Computer and Communications Security, 2012

2010

seL4: formal verification of an operating-system kernel.

Gerwin Klein, June Andronick, Kevin Elphinstone, Gernot Heiser, David A. Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt, Rafal Kolanski, Michael Norrish, Thomas Sewell, Harvey Tuch, Simon Winwood

Commun. ACM, 2010

Smaller Abstractions for FOR ALL CTL* without Next.

Kai Engelhardt, Ralf Huuck

Proceedings of the Concurrency, 2010

2009

Causing communication closure: safe program composition with reliable non-FIFO channels.

Kai Engelhardt, Yoram Moses

Distributed Comput., 2009

seL4: formal verification of an OS kernel.

Gerwin Klein, Kevin Elphinstone, Gernot Heiser, June Andronick, David A. Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt, Rafal Kolanski, Michael Norrish, Thomas Sewell, Harvey Tuch, Simon Winwood

Proceedings of the 22nd ACM Symposium on Operating Systems Principles 2009, 2009

2008

Single-bit messages are insufficient for data link over duplicating channels.

Kai Engelhardt, Yoram Moses

Inf. Process. Lett., 2008

2007

Model Checking Knowledge and Linear Time: PSPACE Cases.

Kai Engelhardt, Peter Gammie, Ron van der Meyden

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

2005

Causing Communication Closure: Safe Program Composition with Non-FIFO Channels.

Kai Engelhardt, Yoram Moses

Proceedings of the Distributed Computing, 19th International Conference, 2005

Safe Composition of Distributed Programs Communicating over Order-Preserving Imperfect Channels.

Kai Engelhardt, Yoram Moses

Proceedings of the Distributed Computing, 2005

Single-Bit Messages Are Insufficient in the Presence of Duplication.

Kai Engelhardt, Yoram Moses

Proceedings of the Distributed Computing, 2005

2002

Towards a refinement theory that supports reasoning about knowledge and time for multiple agents.

Kai Engelhardt

Proceedings of the BCS FACS Refinement Workshop 2002, 2002

Modal Logics with a Linear Hierarchy of Local Propositional Quantifiers.

Kai Engelhardt, Ron van der Meyden, Kaile Su

Proceedings of the Advances in Modal Logic 4, papers from the fourth conference on "Advances in Modal logic," held in Toulouse, France, 30 September, 2002

2001

A Refinement Theory that Supports Reasoning About Knowledge and Time.

Kai Engelhardt, Ron van der Meyden, Yoram Moses

Proceedings of the Logic for Programming, 2001

2000

A Program Refinement Framework Supporting Reasoning about Knowledge and Time.

Kai Engelhardt, Ron van der Meyden, Yoram Moses

Proceedings of the Foundations of Software Science and Computation Structures, 2000

1998

Knowledge and the Logic of Local Propositions.

Kai Engelhardt, Ron van der Meyden, Yoram Moses

Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-98), 1998

Data Refinement: Model-oriented Proof Theories and their Comparison

Willem P. de Roever, Kai Engelhardt

Cambridge Tracts in Theoretical Computer Science 46, Cambridge University Press, ISBN: 0-521-64170-5, 1998

1997

Model oriented data refinement.

Kai Engelhardt

PhD thesis, 1997

1996

Simulation of Specification Statements in Hoare Logic.

Kai Engelhardt, Willem P. de Roever

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

Towards a Practitioners' Approach to Abadi and Lamport's Method.

Kai Engelhardt, Willem P. de Roever

Formal Aspects Comput., 1995

1993

Generalizing Abadi & Lamport's Method to Solve a Problem Posed by A. Pnueli.

Kai Engelhardt, Willem P. de Roever

Proceedings of the FME '93: Industrial-Strength Formal Methods, 1993