Sciweavers

290 search results - page 47 / 58
» Theorem Proving Using Lazy Proof Explication
Sort
View
ACL2
2006
ACM
15 years 3 months ago
An embedding of the ACL2 logic in HOL
We describe an embedding of the ACL2 logic into higherorder logic. An implementation of this embedding allows ACL2 to be used as an oracle for higher-order logic provers. Categori...
Michael J. C. Gordon, Warren A. Hunt Jr., Matt Kau...
CSFW
1997
IEEE
15 years 1 months ago
Eliminating Covert Flows with Minimum Typings
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
Dennis M. Volpano, Geoffrey Smith
TACAS
1997
Springer
87views Algorithms» more  TACAS 1997»
15 years 1 months ago
Integration in PVS: Tables, Types, and Model Checking
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
Sam Owre, John M. Rushby, Natarajan Shankar
DAM
2010
92views more  DAM 2010»
14 years 9 months ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
AMC
2006
79views more  AMC 2006»
14 years 9 months ago
Church's thesis meets the N-body problem
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
Warren D. Smith