Front matter
1-5
Challenges in System-Level Design
Wayne Wolf
6-20
Generating Fast Multipliers Using Clever Circuits
Mary Sheeran
21-36
Verification of Analog and Mixed-Signal Circuits Using Hybrid System Techniques
Thao Dang, Alexandre Donzé and Oded Maler
37-51
A Methodology for the Formal Verification of FFT Algorithms in HOL
Behzad Akbarpour and Sofiène Tahar
52-66
A Functional Approach to the Formal Specification of Networks on Chip
Julien Schmaltz and Dominique Borrione
67-81
Proof Styles in Operational Semantics
Sandip Ray and J. Strother Moore
82-97
Integrating Reasoning About Ordinal Arithmetic into ACL2
Panagiotis Manolios and Daron Vroon
98-112
Combining Equivalence Verification and Completion Functions
Mark D. Aagaard, Vlad C. Ciubotariu, Jason T. Higgins and Farzad Khalvati
113-127
Synchronization-at-Retirement for Pipeline Verification
Mark D. Aagaard, Nancy A. Day and Robert B. Jones
128-143
Late Design Changes (ECOs) for Sequentially Optimized Esterel Designs
Laurent Arditi, Gerard Berry and Michael Kishinevsky
144-158
Non-miter-based Combinational Equivalence Checking by Comparing BDDs with Different Variable Orders
In-Ho Moon and Carl Pixley
159-173
Scalable Automated Verification via Expert-System Guided Transformations
Hari Mony, Jason Baumgartner, Viresh Paruthi, Robert Kanzelman and Andreas Kuehlmann
174-185
Simple Yet Efficient Improvements of SAT Based Bounded Model Checking
Emmanuel Zarpas
186-200
Simple Bounded LTL Model Checking
Timo Latvala, Armin Biere, Keijo Heljanko and Tommi Junttila
201-213
QuBE++: An Efficient QBF Solver
Enrico Giunchiglia, Massimo Narizzano and Armando Tacchella
214-229
Bounded Probabilistic Model Checking with the Murφ Verifier
Giuseppe Della Penna, Benedetto Intrigila, Igor Melatti, Enrico Tronci and Marisa Venturini Zilli
230-244
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Mohammad Awedh and Fabio Somenzi
245-259
Bounded Verification of Past LTL
Alessandro Cimatti, Marco Roveri and Daniel Sheridan
260-274
A Hybrid of Counterexample-Based and Proof-Based Abstraction
Nina Amla and Ken L. McMillan
275-289
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
Orna Grumberg, Assaf Schuster and Avi Yadgar
290-305
Approximate Symbolic Model Checking for Incomplete Designs
Tobias Nopper and Christoph Scholl
306-321
Extending Extended Vacuity
Arie Gurfinkel and Marsha Chechik
322-336
Parameterized Vacuity
Marko Samer and Helmut Veith
337-351
An Operational Semantics for Weak PSL
Koen Claessen and Johan Mårtensson
352-366
Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking
Luboš Brim, Ivana Černá, Pavel Moravec and Jiří Šimša
367-381
Bloom Filters in Probabilistic Verification
Peter C. Dillinger and Panagiotis Manolios
382-398
A Simple Method for Parameterized Verification of Cache Coherence Protocols
Ching-Tsun Chou, Phanindra K. Mannava and Seungjoon Park
399-413
A Partitioning Methodology for BDD-Based Verification
Debashis Sahoo, Subramanian Iyer, Jawahar Jain, Christian Stangier and Amit Narayan, et al.
414-429
Invariant Checking Combining Forward and Backward Traversal
Christian Stangier and Thomas Sidle
430-444
Variable Reuse for Efficient Image Computation
Zijiang Yang and Rajeev Alur
Back matter