Share on TelegramComputer aided verification : 12th international conference, CAV 2000, Chicago, IL, USA, July 15 19, 2000 ;
Author: Emerson, E. Allen, Sistla, Aravinda Prasad, CAV 12 2000 Chicago, Ill. (DE-601)319008533 (DE-588)2184141-X, CAV (12 2000.07.15-19 Chicago, Ill.), International Conference on Computer Aided Verification (12 2000.07.15-19 Chicago, Ill.)
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Artificial intelligence, Computer Science, Computer science, Logic design, Software engineering, Verifikation, Kongress, Chicago
Publishers: Berlin [u.a.] Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540677704, 9783540677703
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 641.26 MB
PDF Size: 4.99 MB
Extensions: djvu, epub, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 550
Views: 600
Total Files: 20
Media Type: texts
Total Files: 7
Last Modified: 2024-01-30 12:28:52
Size: 29.43 KB
Description
Author: E. Allen Emerson, Aravinda Prasad Sistla
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67770-3
DOI: 10.1007/10722167
Table of Contents:
- Keynote Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion
- Invited Address: Applying Formal Methods to Cryptographic Protocol Analysis
- Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation
- Invited Tutorial: Verification of Infinite-state and Parameterized Systems
- An Abstraction Algorithm for the Verification of Generalized C-Slow Designs
- Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
- An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
- Automatic Verification of Parameterized Cache Coherence Protocols
- Binary Reachability Analysis of Discrete Pushdown Timed Automata
- Boolean Satisfiability with Transitivity Constraints
- Bounded Model Construction for Monadic Second-Order Logics
- Building Circuits from Relations
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
- On the Completeness of Compositional Reasoning
- Counterexample-Guided Abstraction Refinement
- Decision Procedures for Inductive Boolean Functions Based on Alternating Automata
- Detecting Errors Before Reaching Them
- A Discrete Strategy Improvement Algorithm for Solving Parity Games
- Distributing Timed Model Checking — How the Search Order Matters
- Efficient Algorithms for Model Checking Pushdown Systems
Literaturangaben
