A scalable parallel algorithm for reachability analysis of very large circuits

DOI10.1023/A:1020373206491zbMath1020.68107MaRDI QIDQ1871864

Assaf Schuster, Danny Geist, Tamir Heyman, Orna Grumberg

Publication date: 4 May 2003

Published in: Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

verificationmodel checkingdistributed space requirementsymbolic slicing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (5)

GSTE is partitioned model checking ⋮ A work-efficient distributed algorithm for reachability analysis ⋮ Dealing with practical limitations of distributed timed model checking for timed automata ⋮ VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND ⋮ Distributed symbolic model checking for \(\mu\)-calculus

This page was built for publication: A scalable parallel algorithm for reachability analysis of very large circuits