Sciweavers

213 search results - page 2 / 43
» A framework for checking proofs naturally
Sort
View
CADE
2008
Springer
14 years 5 months ago
A Small Framework for Proof Checking
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...
Hans de Nivelle, Piotr Witkowski
ECBS
2003
IEEE
145views Hardware» more  ECBS 2003»
13 years 10 months ago
Model Checking and Evidence Exploration
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka
ENTCS
2006
133views more  ENTCS 2006»
13 years 5 months ago
Linking Semantic Models to Support CSP || B Consistency Checking
Consistency checking in the CSP B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outsid...
Neil Evans, Helen Treharne
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 5 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
FLOPS
2006
Springer
13 years 9 months ago
A Computational Approach to Pocklington Certificates in Type Theory
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
Benjamin Grégoire, Laurent Théry, Be...