Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation

DOI10.1007/978-3-319-47958-3_18zbMath1483.68213OpenAlexW2528089582MaRDI QIDQ3179302

Kazuhide Yasukata, Takeshi Tsukada, Naoki Kobayashi

Publication date: 21 December 2016

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-47958-3_18

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• LOCKSMITH
• MoCHi

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
• Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking
• Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
• Model Checking Higher-Order Programs
• Computer Aided Verification

This page was built for publication: Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation