On Computability of Logical Approaches to Branching-Time Property Verification of Programs

DOI10.1145/3373718.3394766OpenAlexW3029393106WikidataQ130947770 ScholiaQ130947770MaRDI QIDQ5145688

Takeshi Tsukada

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373718.3394766

zbMATH Keywords

computabilityanalytical hierarchyprogram verificationfixed-point logicbranching-time propertyconstrained Horn clause

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

On higher-order reachability games vs may reachability

This page was built for publication: On Computability of Logical Approaches to Branching-Time Property Verification of Programs