Sciweavers

86 search results - page 6 / 18
» Classical BI: Its Semantics and Proof Theory
Sort
View
FMOODS
2007
13 years 9 months ago
A Mechanized Model of the Theory of Objects
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
Ludovic Henrio, Florian Kammüller
CADE
1992
Springer
13 years 11 months ago
Implementing the Meta-Theory of Deductive Systems
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
Frank Pfenning, Ekkehard Rohwedder
STTT
2010
113views more  STTT 2010»
13 years 2 months ago
Proved development of the real-time properties of the IEEE 1394 Root Contention Protocol with the event-B method
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
Joris Rehm
PODS
1997
ACM
124views Database» more  PODS 1997»
13 years 11 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
POPL
2004
ACM
14 years 8 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton