scientific article; zbMATH DE number 512849

MaRDI QIDQ4281545zbMATH OpenFDO

Authors Hardi Hungar

Publication date 10 March 1994

zbMATH Keywords

Clarke's language L4complexity classesdenotational semanticsfunctional programming languagesprogram logicsrecursive functionsspectra of partial correctness formulae

Mathematics Subject Classification ID

Theory of programming languages (68N15) Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Complexity of proving program correctness
• Problems of verification of functional programs
• scientific article; zbMATH DE number 2242587
• scientific article; zbMATH DE number 4041241
• scientific article; zbMATH DE number 1163990

Cited in

(9)

• Analysing the complexity of functional programs: higher-order meets first-order
• Certifying and Reasoning on Cost Annotations of Functional Programs
• COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES
• Problems of verification of functional programs
• scientific article; zbMATH DE number 4030949 (Why is no real title available?)
• scientific article; zbMATH DE number 4041241 (Why is no real title available?)
• Verification of non-functional programs using interpretations in type theory
• Complexity of proving program correctness
• Program analysis is harder than verification: a computability perspective

This page was built for publication:

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