APLAS
2010
ACM
13 years 1 months ago
2010
ACM
Abstract. The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the
APLAS
2010
ACM
13 years 1 months ago
2010
ACM
APLAS
2010
ACM
13 years 1 months ago
2010
ACM
We present a framework for defining abstract interpreters for liveness properties, in particular program termination. The framework makes use of the theory of metric spaces to defi...
APLAS
2010
ACM
13 years 2 months ago
2010
ACM
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
APLAS
2010
ACM
13 years 3 months ago
2010
ACM
APLAS
2010
ACM
13 years 3 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
APLAS
2010
ACM
13 years 4 months ago
2010
ACM
APLAS
2010
ACM
13 years 4 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
APLAS
2010
ACM
13 years 4 months ago
2010
ACM
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...
APLAS
2010
ACM
13 years 4 months ago
2010
ACM
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...