Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse

DOI10.29007/2s1qzbMath1415.68149OpenAlexW2907427247MaRDI QIDQ5222973

Gianfranco Ciardo, Chuan Jiang

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/2s1q

zbMATH Keywords

counterexampleSATbounded model checkingdeadlockwitnessACTLECTL

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

This page was built for publication: Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse