Sciweavers

ESOP
2010
Springer
14 years 8 months ago
Enforcing Stateful Authorization and Information Flow Policies in Fine
Proving software free of security bugs is hard. Languages that ensure that programs correctly enforce their security policies would help, but, to date, no security-typed language h...
Nikhil Swamy, Juan Chen and Ravi Chugh
ESOP
2010
Springer
14 years 8 months ago
Automating Security Mediation Placement
Abstract. We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy code to be retrofit with comprehensive s...
Dave King 0002, Divya Muthukumaran, Sanjit A. Sesh...
ESOP
2010
Springer
14 years 8 months ago
Separating Shape Graphs
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
Vincent Laviron, Bor-Yuh Evan Chang and Xavier Riv...
ESOP
2010
Springer
14 years 8 months ago
Amortised Resource Analysis with Separation Logic
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
Robert Atkey
ESOP
2010
Springer
14 years 8 months ago
A PolyTime Functional Language from Light Linear Logic
Patrick Baillot, Marco Gaboardi and Virgile Mogbil
ESOP
2010
Springer
14 years 8 months ago
Stateful Contracts for Affine Types
Affine type systems manage resources by preventing some values from being used more than once. This offers expressiveness and performance benefits, but difficulty arises in intera...
Jesse A. Tov, Riccardo Pucella
ESOP
2010
Springer
14 years 8 months ago
Generative Operational Semantics for Relaxed Memory Models
The specification of the Java Memory Model (JMM) is phrased in terms of acceptors of execution sequences rather than the standard generative view of operational semantics. This cre...
Radha Jagadeesan, Corin Pitcher and James Riely
ESOP
2010
Springer
14 years 8 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
ESOP
2010
Springer
14 years 8 months ago
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
Keiko Nakata and Tarmo Uustalu
ESOP
2010
Springer
14 years 8 months ago
Functional Programming in Sublinear Space
Ugo Dal Lago, Ulrich Schöpp