Z. Zhu and C.-J.H. Seger. The Completeness of a Hardware Inference System. In Dill [10], pages 286--298.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generating and Model Checking a Hierarchy of Abstract Models - Hazelhurst (1999) (3 citations) (Correct)
....a practical way of creating abstraction with relatively minimal human intervention. This abstraction in turn can be used for practical verification. In a similar technical setting to the one presented here, Zhu and Seger also proposed a method of model construction from a set of assertions [27]. However, not only is the model construction very different to the one presented here, but the purpose of the construction was different. Their goal was to explore the completeness of an inference system based on a compositional theory of trajectory evaluation [17] whereas the goal of this paper ....
Z. Zhu and C.-J.H. Seger. The Completeness of a Hardware Inference System. In Dill [10], pages 286--298.
Compositional Model Checking Of Partially Ordered State Spaces - Hazelhurst (1996) (10 citations) (Correct)
....Although equivalence checking is also attractive, this thesis explores one model checking because of its success in verifying large state spaces. Moreover, in some situations it is not appropriate or possible to have a formal model to compare an implementation against (although work such as [130] offers some ideas in how such a model could be built from a set of properties) Chapter 2. Issues in Verification 39 Theorem provers and model checkers both have strong adherents because both methods have had successes. However, they both have weaknesses. Automatic verification techniques have ....
....part of the verification showing that when connected together the multipliers produce the correct answer is essentially performing symbolic simulation. Zhu and Seger have shown that given a set of trajectory assertion results, there is a weakest machine which satisfies these assertions [130]; this weakest machine is a conservative approximation of the circuit as any assertion that is true of the approximation is also true of the circuit. This suggests an alternative verification methodology. The verification of the correctness of each of the multipliers extracts the essence of the ....
[Article contains additional citation context not shown here]
Z. Zhu and C.-J.H. Seger. The Completeness of a Hardware Inference System. In Dill
Symbolic Trajectory Evaluation - Hazelhurst, Seger (1996) (6 citations) Self-citation (Seger) (Correct)
....in various ways. There is also an antecedent truncation rule which uses causality (events at time t cannot affect events at time t Gamma 1) to allow precondition weakening in some situations. For some discussion of the deductive power of an earlier version of this compositional theory see [53]. 5.3.1 Voss This is the rule of Symbolic Trajectory Evaluation: Delta t (h) vP T t (g) j= hj g= AEh ji 5.3.2 Identity This trivial rule says: j= hj g= AEg ji : Although it is very simple, it does have occasional use in a proof. In much the same way a piece of code summing variables ....
Z. Zhu and C.-J.H. Seger. The Completeness of a Hardware Inference System. In Dill [33], pages 286--298.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC