597 search results - page 63 / 120 » Semantics for Dynamic Logic Programming: A Principle-Based A... |
LICS
2002
IEEE
14 years 17 days ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
TLDI
2010
ACM
14 years 4 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Current middleware systems suffer from drawbacks. Often one is forced to make decisions early in the design process about which classes may participate in inter-machine communicat...
APAL
2008
13 years 7 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...