Correct Hardware Design and Verification Methods正确的硬件设计与验证法/会议录
|
读过这本书吗？
最近在读
读过
想读
还不熟悉
|
图书城书列：
加入到博客或社交网站：
|
|
我来评论这本书：
内容提要：
This book constitutes the refereed proceedings of the 13th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME 2005, held in Saarbrücken, Germany, in October 2005. The 21 revised full papers and 18 short papers presented together with 2 invited talks and one tutorial were carefully reviewed and selected from 79 submissions. The papers are organized in topical sections on functional approaches to design description, game solving approaches, abstraction, algorithms and techniques for speeding (DD-based) verification, real time and LTL model checking, evaluation of SAT-based tools, model reduction, and verification of memory hierarchy mechanisms.
目录：
Invited Talks
Is Formal Verification Bound to Remain a Junior Partner of Simulation? Verification Challenges in Configurable Processor Design with ASIP Meister Tutorial Towards the Pervasive Verification of Automotive Systems Functional Approaches to Design Description Wired: Wire-Aware Circuit Design Formalization of the DE2 Language Game Solving Approaches Finding and Fixing Faults Verifying Quantitative Properties Using Bound Functions Abstraction How Thorough Is Thorough Enough? Interleaved Invariant Checking with Dynamic Abstraction Automatic Formal Verification of Liveness for Pipelined Processors with Multicycle Functional Units Algorithms and Techniques for Speeding (DD-Based) Verification 1 Efficient Symbolic Simulation via Dynamic Scheduling, Don't Caring, and Case Splitting Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning Real Time and LTL Model Checking Real-Time Model Checking Is Really Simple Temporal Modalities for Concisely Capturing Timing Diagrams Regular Vacuity Algorithms and Techniques for Speeding Verification 2 Automatic Generation of Hints for Symbolic Traversal Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies A New SAT-Based Algorithm for Symbolic Trajectory Evaluation Evaluation of SAT-Based Tools Model Reduction Verification of Memory Hierarchy Mechanisms Short Papers Author Index |