446 search results - page 46 / 90 » A Theorem Prover for a Computational Logic |
148
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
118
click to vote
TPHOL
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
211
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
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: ...
103
click to vote
JUCS
2006
15 years 1 months ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
102
click to vote
TCS
2002
15 years 1 months ago
2002
In this work, we investigate various specification languages and their relation to Casl, the recently developed Common Algebraic Specification Language. In particular, we consider...