Sciweavers

6960 search results - page 851 / 1392
» Continuity Analysis of Programs
Sort
View
SCAM
2006
IEEE
16 years 1 months ago
Stop-List Slicing
Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the...
Keith Gallagher, David Binkley, Mark Harman
ASPLOS
2004
ACM
16 years 14 days ago
Low-overhead memory leak detection using adaptive statistical profiling
Sampling has been successfully used to identify performance optimization opportunities. We would like to apply similar techniques to check program correctness. Unfortunately, samp...
Matthias Hauswirth, Trishul M. Chilimbi
ESOP
2008
Springer
15 years 8 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
LFP
1992
140views more  LFP 1992»
15 years 8 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
FAC
2010
121views more  FAC 2010»
15 years 4 months ago
Blaming the client: on data refinement in the presence of pointers
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
Ivana Filipovic, Peter W. O'Hearn, Noah Torp-Smith...