Sciweavers

3546 search results - page 538 / 710
» A Causal Logic of Logic Programming
Sort
View
MIDDLEWARE
2007
Springer
14 years 4 months ago
Life cycle support for sensor network applications
Developing applications for sensor networks is a challenging task. Most programming systems narrowly focus on programming issues while ignoring that programming represents only a ...
Urs Bischoff, Gerd Kortuem
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
14 years 4 months ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
ICLP
2005
Springer
14 years 3 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
PLDI
2009
ACM
14 years 3 months ago
Flow-sensitive semantics for dynamic information flow policies
Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that ...
Niklas Broberg, David Sands
PPDP
2009
Springer
14 years 3 months ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki