Sciweavers

Share
TCS
2008
8 years 12 months ago
Integration of a security type system into a program logic
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
Reiner Hähnle, Jing Pan, Philipp Rümmer,...
ENTCS
2007
128views more  ENTCS 2007»
8 years 12 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
CONCUR
2010
Springer
9 years 1 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
FMCO
2007
Springer
124views Formal Methods» more  FMCO 2007»
9 years 3 months ago
Certification Using the Mobius Base Logic
This paper describes a core component of Mobius' Trusted Code Base, the Mobius base logic. This program logic facilitates the transmission of certificates that are generated u...
Lennart Beringer, Martin Hofmann, Mariela Pavlova
CSFW
2007
IEEE
9 years 4 months ago
Secure information flow and program logics
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
Lennart Beringer, Martin Hofmann
APLAS
2007
ACM
9 years 4 months ago
Local Reasoning for Storable Locks and Threads
We present a resource oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks and threads. T...
Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rin...
FOSSACS
2001
Springer
9 years 4 months ago
On Garbage and Program Logic
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
Cristiano Calcagno, Peter W. O'Hearn
APLAS
2006
ACM
9 years 6 months ago
A Bytecode Logic for JML and Types
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
Lennart Beringer, Martin Hofmann
OOPSLA
2007
Springer
9 years 6 months ago
No ifs, ands, or buts: uncovering the simplicity of conditionals
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...
Jonathan Edwards
ESOP
2007
Springer
9 years 6 months ago
On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
We study the relationship between Concurrent Separation Logic (CSL) and the assume-guarantee (A-G) method (a.k.a. rely-guarantee method). We show in three steps that CSL can be tre...
Xinyu Feng, Rodrigo Ferreira, Zhong Shao
books