Sciweavers

1055 search results - page 94 / 211
» On the Semantics of Logic Programs with Preferences
Sort
View
EPIA
2007
Springer
15 years 11 months ago
Prospective Logic Agents
As we face the real possibility of modelling agent systems capable of non-deterministic self-evolution, we are confronted with the problem of having several different possible futu...
Luís Moniz Pereira, Gonçalo Lopes
POPL
2002
ACM
16 years 5 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
ENTCS
2002
97views more  ENTCS 2002»
15 years 4 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott
CADE
2007
Springer
16 years 5 months ago
KeY-C: A Tool for Verification of C Programs
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...
Daniel Larsson, Oleg Mürk, Reiner Hähnle
FOSSACS
2000
Springer
15 years 8 months ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
Kai Engelhardt, Ron van der Meyden, Yoram Moses