Formal Verification of an Executable LTL Model Checker with Partial Order Reduction-Reference-Cited by-同舟云学术

Formal Verification of an Executable LTL Model Checker with Partial Order Reduction

Published:2016 Issue: Volume: Page:307-321
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Brunner Julian,Lammich Peter

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-40648-0_23

Reference27 articles.

1. Graduate Texts in Computer Science;RJ Back,1998

2. Lecture Notes in Computer Science;JC Blanchette,2014

3. Brunner, J.: Implementation and Verification of Partial Order Reduction for On-The-Fly Model Checking. MA thesis. Technische Universität München, 83 p., 15 July 2014. http://www21.in.tum.de/brunnerj/documents/ivporotfmc.pdf

4. Lecture Notes in Computer Science;CT Chou,1996

5. Lecture Notes in Computer Science;J Esparza,2013

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

1. Efficient Verified (UN)SAT Certificate Checking;Journal of Automated Reasoning;2019-06-04

2. A Formally Verified Validator for Classical Planning Problems and Solutions;2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI);2018-11

3. Automatic Refinement to Efficient Data Structures: A Comparison of Two Approaches;Journal of Automated Reasoning;2018-03-22

4. Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata;Interactive Theorem Proving;2018

5. Formal Verification of an Executable LTL Model Checker with Partial Order Reduction;Journal of Automated Reasoning;2017-06-20