Sciweavers

1536 search results - page 23 / 308
» The Underlying Logic of Hoare Logic
Sort
View
ISIPTA
2005
IEEE
137views Mathematics» more  ISIPTA 2005»
14 years 2 months ago
Basing Probabilistic Logic on Gambles
This article presents a probabilistic logic whose sentences can be interpreted as asserting the acceptability of gambles described in terms of an underlying logic. This probabilis...
Peter R. Gillett, Richard B. Scherl, Glenn Shafer
POPL
2008
ACM
14 years 8 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
POPL
2010
ACM
13 years 8 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
POPL
2006
ACM
14 years 8 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
AMAST
2004
Springer
14 years 1 months ago
Generic Exception Handling and the Java Monad
We develop an equational definition of exception monads that characterizes Moggi’s exception monad transformer. This axiomatization is then used to define an extension of previ...
Lutz Schröder, Till Mossakowski