192 search results - page 16 / 39 » Using Call Exit Analysis for Logic Program Transformation |
IWMM
2009
Springer
14 years 2 months ago
2009
Springer
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
SCAM
2006
IEEE
14 years 1 months ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
ASWEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...