Complexity of proving program correctness

DOI10.1007/3-540-54415-1_59zbMath1493.68111OpenAlexW1602040124MaRDI QIDQ5096233

Hardi Hungar

Publication date: 16 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-54415-1_59

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Reasoning about procedures as parameters in the language L4
• Some relationships between logics of programs and complexity theory
• On correct procedure parameter transmission in higher programming languages
• On static logics, dynamic logics, and complexity classes
• Even Simple Programs Are Hard To Analyze
• The Complexity of Finite Memory Programs with Recursion
• Soundness and Completeness of an Axiom System for Program Verification
• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of proving program correctness