A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis

DOI10.1007/11901914_7zbMath1161.68561OpenAlexW1576346079MaRDI QIDQ3522894

Andy Jinqing Yu, Ming-Ying Chung, Gianfranco Ciardo

Publication date: 4 September 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11901914_7

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Improving Saturation Efficiency with Implicit Relations

This page was built for publication: A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis