Sciweavers

1322 search results - page 173 / 265
» Unsound Theorem Proving
Sort
View
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
14 years 1 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
TACAS
1997
Springer
87views Algorithms» more  TACAS 1997»
14 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
CADE
1994
Springer
14 years 1 months ago
Pi: an Interactive Derivation Editor for the Calculus of Partial Inductive Definitions
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical ...
Lars-Henrik Eriksson
ICML
1989
IEEE
14 years 29 days ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
ATVA
2009
Springer
141views Hardware» more  ATVA 2009»
14 years 27 days ago
Formal Verification for High-Assurance Behavioral Synthesis
We present a framework for certifying hardware designs generated through behavioral synthesis, by using formal verification to certify the associated synthesis transformations. We ...
Sandip Ray, Kecheng Hao, Yan Chen, Fei Xie, Jin Ya...