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

DOI10.1007/978-3-662-44584-6_22zbMath1417.68107OpenAlexW226250722MaRDI QIDQ3190126

Naoki Kobayashi, Kazuhide Yasukata, Kazutaka Matsuda

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44584-6_22

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation

This page was built for publication: Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking