Sciweavers

1549 search results - page 51 / 310
» On the rules of intermediate logics
Sort
View
PPDP
2005
Springer
14 years 2 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
PLDI
2003
ACM
14 years 2 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
ICLP
2001
Springer
14 years 1 months ago
A Multi-adjoint Logic Approach to Abductive Reasoning
Multi-adjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the ru...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
CSL
2004
Springer
14 years 20 days ago
Towards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
Tjark Weber
ECAI
2006
Springer
14 years 18 days ago
On the Existence of Answer Sets in Normal Extended Logic Programs
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...
Martin Caminada, Chiaki Sakama