3481 search results - page 558 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
231
Voted
POPL
2007
ACM
16 years 3 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
137
click to vote
IWMM
2009
Springer
15 years 10 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
129
click to vote
EMSOFT
2007
Springer
15 years 9 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
118
Voted
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
125
click to vote
PLDI
2005
ACM
15 years 9 months ago
2005
ACM
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...