60 search results - page 2 / 12 » Bootstrapping higher-order program transformers from interpr... |
POPL
2010
ACM
15 years 7 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
CADE
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
AGP
1999
IEEE
15 years 1 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
156
click to vote
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
TAPSOFT
1995
Springer
15 years 1 months ago
1995
Springer
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...