Sciweavers

597 search results - page 63 / 120
» Semantics for Dynamic Logic Programming: A Principle-Based A...
Sort
View
LICS
2002
IEEE
15 years 7 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
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...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
183
Voted
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
15 years 11 months ago
F-ing modules
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...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
134
Voted
BIRTHDAY
2005
Springer
15 years 8 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
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...
Jürgen Dix, Ugur Kuter, Dana S. Nau
113
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 2 months ago
A Reflective Approach to Providing Flexibility in Application Distribution
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...
Álvaro J. Rebón Portillo, Scott M. W...
138
Voted
APAL
2008
104views more  APAL 2008»
15 years 2 months ago
Infinite trace equivalence
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...
Paul Blain Levy