Sciweavers

1322 search results - page 127 / 265
» Unsound Theorem Proving
Sort
View
POPL
2007
ACM
14 years 10 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
CADE
2005
Springer
14 years 10 months ago
The Model Evolution Calculus with Equality
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
Peter Baumgartner, Cesare Tinelli
CADE
2004
Springer
14 years 10 months ago
TaMeD: A Tableau Method for Deduction Modulo
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
Richard Bonichon
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
14 years 4 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
CONTEXT
1999
Springer
14 years 2 months ago
Contextual Inference in Computational Semantics
Appeared in: P. Bouquet, P. Br´ezillon, L. Serafini, M. Benerecetti, F. Castellani (Eds.), 2nd International and Interdisciplinary Conference on Modeling and Using Context (CONT...
Christof Monz