11 search results - page 1 / 3 » Semantic Foundations of Binding Time Analysis for Imperative... |
PEPM
1995
ACM
13 years 8 months ago
1995
ACM
PEPM
1993
ACM
13 years 9 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
ENTCS
2008
13 years 5 months ago
2008
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
DOCENG
2008
ACM
13 years 7 months ago
2008
ACM
Semantic web researchers tend to assume that XML Schema and OWL-S are the correct means for representing the types, structure, and semantics of XML data used for documents and int...
APLAS
2007
ACM
13 years 9 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...