Sciweavers

338 search results - page 7 / 68
» Soundness and Completeness of a Logic Programming Approach t...
Sort
View
ICLP
2011
Springer
12 years 11 months ago
Transaction Logic with Defaults and Argumentation Theories
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
Paul Fodor, Michael Kifer
CSL
2004
Springer
13 years 11 months 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
TCS
2008
13 years 7 months ago
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
Flavio D. Garcia, Peter van Rossum
ICCS
2009
Springer
14 years 2 months ago
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
Jean-François Baget, Madalina Croitoru, J&e...
ICFP
2003
ACM
14 years 7 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa