Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking-Reference-Cited by-同舟云学术

Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking

Published:2014 Issue: Volume: Page:312-326
ISSN:0302-9743
Container-title:CONCUR 2014 – Concurrency Theory
language:
Short-container-title:

Author:

Yasukata Kazuhide,Kobayashi Naoki,Matsuda Kazutaka

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-44584-6_22

Reference20 articles.

1. Broadbent, C.H., Kobayashi, N.: Saturation-based model checking of higher-order recursion schemes. In: Rocca, S.R.D. (ed.) CSL. LIPIcs, vol. 23, pp. 129–148. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)

2. Lecture Notes in Computer Science;E. D’Osualdo,2013

3. Feret, J.: Abstract interpretation of mobile systems. Journal of Logic and Algebraic Programming 63(1) (2005)

4. Lecture Notes in Computer Science;T.M. Gawlitza,2011

5. Hague, M.: Saturation of concurrent collapsible pushdown systems. In: Proceedings of FSTTCS 2013. LIPIcs, vol. 24, pp. 313–325 (2013)

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

1. Constrained Dynamic Tree Networks;Lecture Notes in Computer Science;2018

2. On the relationship between higher-order recursion schemes and higher-order fixpoint logic;ACM SIGPLAN Notices;2017-05-11

3. On the relationship between higher-order recursion schemes and higher-order fixpoint logic;Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages;2017-01

4. Generating Concurrency Checks Automatically;Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs;2016-07-17

5. Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation;Programming Languages and Systems;2016