Automata-Based Abstraction Refinement for µHORS Model Checking

DOI10.1109/LICS.2015.71zbMATH Open1401.68202MaRDI QIDQ4635849FDOQ4635849

Authors: Naoki Kobayashi, Xin Li 

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Recommendations

• Equivalence-based abstraction refinement for \(\mu \)HORS model checking
• An efficient approach for abstraction-refinement in model checking
• The abstraction-refinement framework in model checking
• Computer Aided Verification
• A satisfiability-based approach to abstraction refinement in model checking
• Automated Technology for Verification and Analysis
• Abstraction and Refinement in Model Checking
• Making abstraction-refinement efficient in model checking
• scientific article; zbMATH DE number 1903350
• scientific article; zbMATH DE number 2110619

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (2)

• Equivalence-based abstraction refinement for \(\mu \)HORS model checking
• Model-checking higher-order programs with recursive types

This page was built for publication: Automata-Based Abstraction Refinement for µHORS Model Checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635849)