22 search results - page 4 / 5 » aplas 2007 |
169
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Gordon and Jeffrey developed a type system for checking correspondence assertions. The correspondence assertions, proposed by Woo and Lam, state that when a certain event (called a...
202
click to vote
APLAS
2007
ACM
2007
ACM
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
15 years 10 months ago
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...
158
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Pattern matching makes ML programs more concise and readable, and these qualities are also sought in object-oriented settings. However, objects and classes come with open erarchie...
142
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
161
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...