215 search results - page 14 / 43 » Connecting a Logical Framework to a First-Order Logic Prover |
91
Voted
SARA
2007
Springer
15 years 5 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
125
click to vote
CORR
2011
Springer
14 years 6 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...
SYNTHESE
2010
14 years 10 months ago
2010
In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit (Synthese 140(1–2):2...
107
click to vote
TPHOL
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
187
click to vote
POPL
2007
ACM
15 years 12 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...