3342 search results - page 218 / 669 » Automating Abstract Interpretation |
134
click to vote
PEPM
1994
ACM
15 years 7 months ago
1994
ACM
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
125
click to vote
APLAS
2007
ACM
15 years 6 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...
139
click to vote
BIRTHDAY
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We develop an abstract operational model for configuration management under service-oriented computing. This semantics is based on a graph-based representation of the con...
94
Voted
JFP
2008
15 years 2 months ago
2008
In this paper, we introduce Applicative functors--an abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread. it i...
135
click to vote
VMCAI
2012
Springer
13 years 10 months ago
2012
Springer
We present a sound method for clustering alarms from static analyzers. Our method clusters alarms by discovering sound dependencies between them such that if the dominant alarm of ...