ESOP
2010
Springer
14 years 3 months ago
2010
Springer
Language-based information flow methods offer a principled way to enforce strong security properties, but enforcing noninterference is too inflexible for realistic applications. Se...
ESOP
2010
Springer
14 years 3 months ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
ESOP
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. The hiding of internal invariants creates a mismatch between procedure specifications in an interface and proof obligations on the implementations of those procedures. T...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Modern software systems have frequently to face unexpected events, reacting so to reach a consistent state. In the field of concurrent and mobile systems (e.g., for web services) ...
ESOP
2010
Springer
14 years 7 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
ESOP
2010
Springer
14 years 7 months ago
2010
Springer
ESOP
2010
Springer
14 years 7 months ago
2010
Springer
Stream processing applications such as algorithmic trading, MPEG processing, and web content analysis are ubiquitous and essential to business and entertainment. Language designers...
ESOP
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...
ESOP
2010
Springer
14 years 9 months ago
2010
Springer
The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That...