Sciweavers

1342 search results - page 76 / 269
» Ordered Programs as Abductive Systems
Sort
View
SIGSOFT
1998
ACM
14 years 1 months ago
Effective Whole-Program Analysis in the Presence of Pointers
Understanding large software systems is difficult. Traditionally, automated tools are used to assist program understanding. However, the representations constructed by these tool...
Darren C. Atkinson, William G. Griswold
ICML
2008
IEEE
14 years 10 months ago
Space-indexed dynamic programming: learning to follow trajectories
We consider the task of learning to accurately follow a trajectory in a vehicle such as a car or helicopter. A number of dynamic programming algorithms such as Differential Dynami...
J. Zico Kolter, Adam Coates, Andrew Y. Ng, Yi Gu, ...
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 9 months ago
A Peer-to-Peer Middleware Framework for Resilient Persistent Programming
The persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be eng...
Alan Dearle, Graham N. C. Kirby, Stuart J. Norcros...
ICLP
1997
Springer
14 years 1 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
ICFP
2006
ACM
14 years 9 months ago
Access control in a core calculus of dependency
The Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in information-f...
Martín Abadi