Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

30

(FIVE YEARS 0)

H-INDEX

12

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540237389, 9783540304944

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Bounded Verification of Past LTL

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_18 ◽

2004 ◽

pp. 245-259 ◽

Author(s):

Alessandro Cimatti ◽

Marco Roveri ◽

Daniel Sheridan

Download Full-text

Synchronization-at-Retirement for Pipeline Verification

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_9 ◽

2004 ◽

pp. 113-127 ◽

Author(s):

Mark D. Aagaard ◽

Nancy A. Day ◽

Robert B. Jones

Download Full-text

Proof Styles in Operational Semantics

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_6 ◽

2004 ◽

pp. 67-81 ◽

Author(s):

Sandip Ray ◽

J. Strother Moore

Keyword(s):

Operational Semantics

Download Full-text

Bloom Filters in Probabilistic Verification

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_26 ◽

2004 ◽

pp. 367-381 ◽

Author(s):

Peter C. Dillinger ◽

Panagiotis Manolios

Keyword(s):

Bloom Filters ◽

Probabilistic Verification

Download Full-text

Parameterized Vacuity

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_23 ◽

2004 ◽

pp. 322-336 ◽

Author(s):

Marko Samer ◽

Helmut Veith

Download Full-text

A Hybrid of Counterexample-Based and Proof-Based Abstraction

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_19 ◽

2004 ◽

pp. 260-274 ◽

Author(s):

Nina Amla ◽

Ken L. McMillan

Download Full-text

Scalable Automated Verification via Expert-System Guided Transformations

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_12 ◽

2004 ◽

pp. 159-173 ◽

Author(s):

Hari Mony ◽

Jason Baumgartner ◽

Viresh Paruthi ◽

Robert Kanzelman ◽

Andreas Kuehlmann

Keyword(s):

Expert System ◽

Automated Verification

Download Full-text

Extending Extended Vacuity

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_22 ◽

2004 ◽

pp. 306-321 ◽

Author(s):

Arie Gurfinkel ◽

Marsha Chechik

Download Full-text

Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_20 ◽

2004 ◽

pp. 275-289 ◽

Author(s):

Orna Grumberg ◽

Assaf Schuster ◽

Avi Yadgar

Keyword(s):

Reachability Analysis ◽

All Solutions ◽

Memory Efficient

Download Full-text

Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking

Formal Methods in Computer-Aided Design - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30494-4_25 ◽

2004 ◽

pp. 352-366 ◽

Author(s):

Luboš Brim ◽

Ivana Černá ◽

Pavel Moravec ◽

Jiří Šimša

Keyword(s):

Model Checking ◽

Ltl Model Checking ◽

Download Full-text