Sciweavers

12774 search results - page 36 / 2555
» A Framework for Proof Systems
Sort
View
FSTTCS
2006
Springer
14 years 13 days ago
Context-Sensitive Dependency Pairs
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
Beatriz Alarcón, Raúl Gutiérr...
FASE
2000
Springer
14 years 12 days ago
Verification of Object Oriented Programs Using Class Invariants
A proof system is presented for the verification and derivation of object oriented programs with as main features strong typing, dynamic binding, and inheritance. The proof system...
Kees Huizing, Ruurd Kuiper
JAR
2008
95views more  JAR 2008»
13 years 8 months ago
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
Marc Bezem, Dimitri Hendriks
IANDC
2010
141views more  IANDC 2010»
13 years 7 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
IGPL
2008
78views more  IGPL 2008»
13 years 8 months ago
Heterogeneous Fibring of Deductive Systems Via Abstract Proof Systems
Luís Cruz-Filipe, Amílcar Sernadas, ...