Sciweavers

279 search results - page 13 / 56
» Determinacy Inference for Logic Programs
Sort
View
PLDI
2003
ACM
14 years 1 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, ...
ICSE
2010
IEEE-ACM
13 years 10 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
AGP
2003
IEEE
14 years 3 days ago
Using dynamic logic programming to model legal reasoning
Dynamic logic programming allows the representation and the inference of evolving knowledge. Legal knowledge reasoning needs the capability to model laws that change over time and ...
N. Graca, Paulo Quaresma
SEFM
2005
IEEE
14 years 2 months ago
Precise Analysis of Memory Consumption using Program Logics
Memory consumption policies provide a means to control resource usage on constrained devices, and play an important role in ensuring the overall quality of software systems, and i...
Gilles Barthe, Mariela Pavlova, Gerardo Schneider
ICLP
2007
Springer
14 years 9 days ago
User-Definable Resource Bounds Analysis for Logic Programs
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
Jorge Navas, Edison Mera, Pedro López-Garc&...