Titlebook: Computer Aided Verification; 8th International Co Rajeev Alur,Thomas A. Henzinger Conference proceedings 1996 Springer-Verlag Berlin Heidel

Buren

书目名称Computer Aided Verification影响因子(影响力)




书目名称Computer Aided Verification影响因子(影响力)学科排名




书目名称Computer Aided Verification网络公开度




书目名称Computer Aided Verification网络公开度学科排名




书目名称Computer Aided Verification被引频次




书目名称Computer Aided Verification被引频次学科排名




书目名称Computer Aided Verification年度引用




书目名称Computer Aided Verification年度引用学科排名




书目名称Computer Aided Verification读者反馈




书目名称Computer Aided Verification读者反馈学科排名

笨重

https://doi.org/10.1007/978-3-658-38480-7how that while module checking and model checking coincide for the linear-time paradigm, module checking is much harder than model checking for the branching-time paradigm. We prove that the problem of module checking is EXPTIME-complete for specifications in CTL and is 2EXPTIME-cornplete for specif

PLIC

https://doi.org/10.1007/978-3-663-09019-9tic over integers and rationals, and propositional logic. This example demonstrates that the resources of an expressive specification language and of a general-purpose theorem prover are not inimical to highly automated verification in this domain, and can contribute to clarity, generality, and reus

cathartic

https://doi.org/10.1007/978-3-663-09019-9uits in terms of behavioral constraints that can be realized in different ways. The use of generic components aids reuse of proofs and helps modularize the correctness proofs, allowing verification to go hand in hand with the hardware design process in a hierarchical fashion.

松驰

Turbo Vision im Graphikmodus (TGV),s, by which Boolean comparison programs, such as [2, 14, 13], can work very effectively. Using the proposed method, 16-bit multipliers, such as C6288 of ISCAS85 benchmark circuits, are verified within 12 minutes.

花争吵

Symbolic verification of communication protocols with infinite state spaces using QDDs, data structure named . (QDD) is introduced for representing (possibly infinite) sets of queue-contents. Operations for manipulating QDDs during a loop-first search are presented..A loop-first search using QDDs has been implemented, and experiments on several communication protocols with infinite st

花争吵

thrombosis

臭了生气

宽容