Sciweavers

3658 search results - page 185 / 732
» The logic of proofs, semantically
Sort
View
LPNMR
2009
Springer
16 years 1 months ago
A Deductive System for FO(ID) Based on Least Fixpoint Logic
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
Ping Hou, Marc Denecker
JUCS
2006
131views more  JUCS 2006»
15 years 6 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
AGP
1997
IEEE
15 years 10 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
TPHOL
2008
IEEE
16 years 29 days ago
A Brief Overview of HOL4
The HOL4 proof assistant supports specification and proof in classical higher order logic. It is the latest in a long line of similar systems. In this short overview, we give an o...
Konrad Slind, Michael Norrish
FMICS
2008
Springer
15 years 8 months ago
Automated Certification of Non-Interference in Rewriting Logic
Abstract. In this paper we propose a certification technique for noninterference of Java programs based on rewriting logic, a very general logical and semantic framework efficientl...
Mauricio Alba-Castro, María Alpuente, Santi...