Complexity of proving program correctness

DOI10.1007/3-540-54415-1_59MaRDI QIDQ5096233zbMATH OpenOpenAlexFDO

Authors 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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 512849
• Program correctness on finite fields
• Some general incompleteness results for partial correctness logics
• scientific article; zbMATH DE number 3900131
• scientific article; zbMATH DE number 4022609

Cites work

• Even Simple Programs Are Hard To Analyze
• scientific article; zbMATH DE number 3835316 (Why is no real title available?)
• scientific article; zbMATH DE number 4170889 (Why is no real title available?)
• scientific article; zbMATH DE number 3980461 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• On correct procedure parameter transmission in higher programming languages
• On static logics, dynamic logics, and complexity classes
• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
• Reasoning about procedures as parameters in the language L4
• Some relationships between logics of programs and complexity theory
• Soundness and Completeness of an Axiom System for Program Verification
• The Complexity of Finite Memory Programs with Recursion

Cited in

(2)

• scientific article; zbMATH DE number 512849 (Why is no real title available?)
• Program correctness and matricial iteration theories

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

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