Complexity of model-checking call-by-value programs

DOI10.1007/978-3-642-54830-7_12MaRDI QIDQ5410672zbMATH OpenOpenAlexFDO

Authors Takeshi Tsukada, Naoki Kobayashi

Publication date 16 April 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54830-7_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18)

Recommendations

• The complexity of model checking (collapsible) higher-order pushdown systems
• Model checking higher-order programs
• Higher-order model checking in direct style
• Model checking procedural programs
• Mathematical Foundations of Computer Science 2005

Cited in

(4)

• scientific article; zbMATH DE number 2044494 (Why is no real title available?)
• Game-theoretic analysis of call-by-value computation
• System \(T\), call-by-value and the minimum problem
• Higher-order model checking in direct style

This page was built for publication: Complexity of model-checking call-by-value programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5410672)