Sciweavers

29 search results - page 4 / 6
» Assertion-based Debugging of Imperative Programs by Abstract...
Sort
View
POPL
2007
ACM
14 years 8 months ago
Extracting queries by static analysis of transparent persistence
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
Ben Wiedermann, William R. Cook
LISP
2008
96views more  LISP 2008»
13 years 7 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
APLAS
2007
ACM
13 years 11 months ago
A Systematic Approach to Probabilistic Pointer Analysis
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...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
SC
1992
ACM
13 years 11 months ago
Heterogeneous Parallel Programming in Jade
This paper presents Jade, a high-level parallel programming language for managing coarse-grain concurrency. Jade simplifies programming by providing the programmer with the abstra...
Martin C. Rinard, Daniel J. Scales, Monica S. Lam
ESOP
1999
Springer
13 years 12 months ago
Interprocedural Control Flow Analysis
Control Flow Analysis is a widely used approach for analysing functional and object oriented programs. Once the applications become more demanding also the analysis needs to be mor...
Flemming Nielson, Hanne Riis Nielson