TACAS
1997
Springer
13 years 9 months ago
1997
Springer
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 ...
TPHOL
1996
IEEE
13 years 9 months ago
1996
IEEE
Nuprl and HOL are both tactic-based interactive theorem provers for higher-order logic, and both have been used in many substantial applications over the last decade. However, the ...
COMPOS
1997
Springer
13 years 9 months ago
1997
Springer
The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parall...
ICCAD
1996
IEEE
13 years 9 months ago
1996
IEEE
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
ICCAD
1996
IEEE
13 years 9 months ago
1996
IEEE
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...
ISSAC
1998
Springer
13 years 9 months ago
1998
Springer
In this paper we demonstrate the use of formal methods tools to provide a semantics for the type hierarchy of the AXIOM computer algebra system, and a methodology for Aldor progra...
IH
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Currently knownbasic anonymitytechniques dependon identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a gene...
SIGSOFT
1998
ACM
13 years 9 months ago
1998
ACM
Implicit invocation SN92, GN91] has become an important architectural style for large-scale system design and evolution. This paper addresses the lack of speci cation and veri cat...
CAV
1998
Springer
13 years 9 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
CAV
1998
Springer
13 years 9 months ago
1998
Springer
Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system veri cation. Re nement mappings (homomorphisms) have long bee...