Sciweavers

1264 search results - page 125 / 253
» Abstract machines for programming language implementation
Sort
View
PLILP
1994
Springer
15 years 6 months ago
Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
John Field, Frank Tip
115
Voted
PLDI
2009
ACM
15 years 9 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
CEFP
2007
Springer
15 years 8 months ago
From Interpretation to Compilation
Abstract. In this paper we sketch some experiments with the construction of a simple compiler for a high level intermediate lazy functional language, with C++ as a target language....
Jan Martin Jansen, Pieter W. M. Koopman, Rinus Pla...
PVM
1999
Springer
15 years 6 months ago
JPT: A Java Parallelization Tool
Abstract. PVM is a succesfull programming environment for distributed computing in the languages C and Fortran. Recently several implementations of PVM for Java have been added, ma...
Kristof Beyls, Erik H. D'Hollander, Yijun Yu
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 2 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper