Titlebook: Computer Aided Verification; 5th International Co Costas Courcoubetis Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Ad

滋養(yǎng)

Symbolic equivalence checking,l; this minimality is relative to an equivalence relation. The method relies on a symbolic representation of the state space. We compute the minimal labeled transition system using the Binary Decision Diagram structures to represent the set of equivalence classes. Some experiments are presented, using a model obtained from LOTOS specifications.

結(jié)合

Combining model checking and theorem proving to verify parallel processes,nents whose correctness w.r.t. local specifications is checked via model checking. The correctness of the composition w.r.t. the global specification is then established by constructing a formal proof in a derivation system with the help of a theorem prover.

Hiatal-Hernia

禁令

煉油廠

https://doi.org/10.1007/978-3-8349-9889-7The toolset includes a graphical editor that allows the user to compose and edit graphical formulas on a workstation display and a theorem prover that mechanically checks the validity of proofs in the logic. This paper describes the toolset and illustrates its use.

有其法作用

貞潔

Halfhearted

Cognizance

卜聞

Corina Ahlers,Sonja Kinigadner-Janese several common causes of BDD-size blowup and show how these problems can be alleviated by a new verification approach based on partially evaluating the invariant being checked into an implicit conjunction of small BDDs. We describe the new method and give several examples of its application.