Complexity of Model-Checking Call-by-Value Programs
From MaRDI portal
Publication:5410672
DOI10.1007/978-3-642-54830-7_12zbMath1405.68189OpenAlexW350391862MaRDI QIDQ5410672
Naoki Kobayashi, Takeshi Tsukada
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
Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items