Sciweavers

6274 search results - page 173 / 1255
» Proofs, Programs, Processes
Sort
View
ESOP
2005
Springer
15 years 12 months ago
A Type System Equivalent to a Model Checker
ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...
Mayur Naik, Jens Palsberg
POPL
1999
ACM
15 years 10 months ago
A Core Calculus of Dependency
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency commo...
Martín Abadi, Anindya Banerjee, Nevin Heint...
KR
1998
Springer
15 years 10 months ago
What Robots Can Do
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
Hector J. Levesque
ADBIS
1995
Springer
130views Database» more  ADBIS 1995»
15 years 10 months ago
Magic Sets vs. SLD-Resolution
It is by now folklore that the bottom-up evaluation of a program after the “magic set” transformation is “as efficient as” top-down evaluation. There are a number of forma...
Stefan Brass
LOBJET
2008
104views more  LOBJET 2008»
15 years 6 months ago
Une approche formelle de la reconfiguration dynamique
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...
M. Simonot, M. Aponte