632 search results - page 101 / 127 » Explicit Substitutions and Programming Languages |
POPL
2008
ACM
14 years 7 months ago
2008
ACM
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
PEPM
1999
ACM
13 years 11 months ago
1999
ACM
A certifying compiler takes a source language program and produces object code, as well as a certi cate" that can be used to verify that the object code satis es desirable pr...
ECOOP
2005
Springer
14 years 1 months ago
2005
Springer
In Java 2 and Microsoft .NET Common Language Runtime (CLR), trusted code has often been programmed to perform accessrestricted operations not explicitly requested by its untrusted ...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...