Sciweavers

2291 search results - page 291 / 459
» Logic Programming and Model Checking
Sort
View
ECAI
2000
Springer
14 years 2 months ago
Turning High-Level Plans into Robot Programs in Uncertain Domains
The actions of a robot like lifting an object are often best thought of as low-level processes with uncertain outcome. A highlevel robot plan can be seen as a description of a task...
Henrik Grosskreutz, Gerhard Lakemeyer
ICFP
2004
ACM
14 years 10 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
ICFP
2004
ACM
14 years 10 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester
LOBJET
2008
104views more  LOBJET 2008»
13 years 10 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
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 10 months ago
Static Analysis using Parameterised Boolean Equation Systems
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
María-del-Mar Gallardo, Christophe Joubert,...