Sciweavers

213 search results - page 34 / 43
» Logic programs with annotated disjunctions
Sort
View
204
Voted
POPL
2003
ACM
16 years 2 months ago
Static prediction of heap space usage for first-order functional programs
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
Martin Hofmann, Steffen Jost
195
Voted
PLDI
2003
ACM
15 years 7 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
118
Voted
FSTTCS
1999
Springer
15 years 6 months ago
A Foundation for Hybrid Knowledge Bases
Abstract. Hybrid knowledge bases (HKB’s) [11] were developed to provide formal models for the mediation of data and knowledge bases [14,15]. They are based on Generalized Annotat...
James J. Lu, Neil V. Murray, Erik Rosenthal
131
Voted
CADE
2010
Springer
15 years 3 months ago
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
Angelo Brillout, Daniel Kroening, Philipp Rüm...
134
Voted
PPDP
2005
Springer
15 years 8 months ago
Self-tuning resource aware specialisation for prolog
The paper develops a self-tuning resource aware partial evaluation technique for Prolog programs, which derives its own control strategies tuned for the underlying computer archit...
Stephen-John Craig, Michael Leuschel