Higher-Order Program Verification via HFL Model Checking-Reference-Cited by-同舟云学术

Higher-Order Program Verification via HFL Model Checking

Published:2018 Issue: Volume: Page:711-738
ISSN:0302-9743
Container-title:Programming Languages and Systems
language:
Short-container-title:

Author:

Kobayashi Naoki,Tsukada Takeshi,Watanabe Keiichi

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-89884-1_25

Reference44 articles.

1. Axelsson, R., Lange, M., Somla, R.: The complexity of model checking higher-order fixpoint logic. Logical Methods Comput. Sci. 3(2), 1–33 (2007)

2. Lecture Notes in Computer Science;N Bjørner,2015

3. Bjørner, N., McMillan, K.L., Rybalchenko, A.: Program verification as satisfiability modulo theories. In: SMT 2012, EPiC Series in Computing, vol. 20, pp. 3–11. EasyChair (2012)

4. Bjørner, N., McMillan, K.L., Rybalchenko, A.: Higher-order program verification as satisfiability modulo theories with algebraic data-types. CoRR, abs/1306.5264 (2013)

5. Lecture Notes in Computer Science;A Blass,1987

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System;Proceedings of the ACM on Programming Languages;2024-08-15

2. Inductive Approach to Spacer;Proceedings of the ACM on Programming Languages;2024-06-20

3. Productivity Verification for Functional Programs by Reduction to Termination Verification;Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11

4. Higher-Order Property-Directed Reachability;Proceedings of the ACM on Programming Languages;2023-08-30

5. Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification;Proceedings of the ACM on Programming Languages;2023-01-09