Sciweavers

15 search results - page 2 / 3
» Explaining and Controlling Ambiguity in Dynamic Programming
Sort
View
PLDI
1999
ACM
15 years 1 months ago
Whole Program Paths
Whole program paths (WPP) are a new approach to capturing and representing a program’s dynamic—actually executed—control flow. Unlike other path profiling techniques, which ...
James R. Larus
ICSE
2004
IEEE-ACM
15 years 9 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury
ICFP
2009
ACM
15 years 10 months ago
A theory of typed coercions and its applications
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
Nikhil Swamy, Michael W. Hicks, Gavin M. Bierman
PLDI
1998
ACM
15 years 1 months ago
Units: Cool Modules for HOT Languages
A module system ought to enable assembly-line programming using separate compilation and an expressive linking language. Separate compilation allows programmers to develop parts o...
Matthew Flatt, Matthias Felleisen
SOCO
2007
Springer
15 years 3 months ago
Debugging Aspect-Enabled Programs
Abstract. The ability to debug programs composed using aspect-oriented programming (AOP) techniques is critical to the adoption of AOP. Nevertheless, many AOP systems lack adequate...
Marc Eaddy, Alfred V. Aho, Weiping Hu, Paddy McDon...