Sciweavers

439 search results - page 55 / 88
» On Aperiodic Trace Languages
Sort
View
POPL
2007
ACM
14 years 7 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
POPL
2001
ACM
14 years 7 months ago
Type-preserving garbage collectors
By combining existing type systems with standard typebased compilation techniques, we describe how to write strongly typed programs that include a function that acts as a tracing ...
Daniel C. Wang, Andrew W. Appel
POPL
2009
ACM
14 years 2 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...
MODELS
2009
Springer
14 years 2 months ago
Reviving QVT Relations: Model-Based Debugging Using Colored Petri Nets
The standardized QVT Relations language, one cornerstone of Model-Driven Architecture (MDA), has not yet gained widespread use in practice, not least due to missing tool support in...
Manuel Wimmer, Angelika Kusel, Johannes Schön...
TLCA
2009
Springer
14 years 2 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann