922 search results - page 72 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
160
click to vote
FM
2008
Springer
15 years 7 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
151
click to vote
IJCAI
1997
15 years 7 months ago
1997
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...
133
click to vote
AML
2000
15 years 6 months ago
2000
We study a local version of the order property in several frameworks, with an emphasis on frameworks where the compactness theorem fails: (1) Inside a fixed model, (2) for classes ...
141
click to vote
SIGSOFT
2003
ACM
16 years 7 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
175
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...