Abstract
ACTL formulas with linear counterexamples have been studied and the templates of ACTL formulas for which linear counterexamples exist have been identified. This paper further studies ACTL formulas having linear counterexamples in light of bounded semantics, and an application of this to SAT-based verification (in particular, bounded correctness checking) of ACTL properties is developed. In addition to the analysis on the semantic aspects, one goal is to provide a good solution to embedding the subset of ACTL that has linear counterexamples into an existing verification approach of ACTL. Due to that ECTL formulas are dual to ACTL formulas, we develop a refined bounded semantics for ECTL for the purpose of showing unsatisfiability of ACTL properties. Experimental data and experimental comparison are reported.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
