46 search results - page 9 / 10 » Synthesizing Proofs from Programs in the Calculus of Inducti... |
ICFP
2007
ACM
14 years 8 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
ICFP
2006
ACM
14 years 8 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
ICFP
2008
ACM
14 years 8 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
PLDI
2006
ACM
14 years 2 months ago
2006
ACM
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
TLDI
2005
ACM
14 years 2 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...