Sciweavers

4355 search results - page 5 / 871
» From Interpretation to Compilation
Sort
View
CASES
2007
ACM
13 years 11 months ago
Scratch-pad memory allocation without compiler support for java applications
ABSTRACT This paper presents the first scratch-pad memory allocation scheme that requires no compiler support for interpreted-language based applications. A scratch-pad memory (SPM...
Nghi Nguyen, Angel Dominguez, Rajeev Barua
ML
2008
ACM
115views Machine Learning» more  ML 2008»
13 years 7 months ago
Calling variadic functions from a strongly-typed language
The importance of providing a mechanism to call C functions from high-level languages has been understood for many years and, these days, almost all statically-typed high-level-la...
Matthias Blume, Mike Rainey, John H. Reppy
ISSTA
1993
ACM
13 years 11 months ago
Mutation Analysis Using Mutant Schemata
Mutation analysis is a powerful technique for assessing and improving the quality of test data used to unit test software. Unfortunately, current automated mutation analysis syste...
Roland H. Untch, A. Jefferson Offutt, Mary Jean Ha...
IWPC
2003
IEEE
14 years 28 days ago
Design Recovery of a Two Level System
Many applications have one or more important modules that are written in a language other than conventional procedural or object oriented languages. These languages are often tran...
Thomas R. Dean, Yuling Chen
PPDP
2007
Springer
14 years 1 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty