A sound and complete Hoare logic for dynamically-typed, object-oriented programs
DOI10.1007/978-3-319-30734-3_13zbMATH Open1475.68085arXiv1509.08605OpenAlexW2347161843MaRDI QIDQ2026792
Ernst-Rรผdiger Olderog, Bjรถrn Engelmann
Publication date: 20 May 2021
Full work available at URL: https://arxiv.org/abs/1509.08605
soundnessrelative completenessaxiomatic semanticsprogram verificationdynamic typingcompleteness for total correctnessmultiple notions of correctnesspure object-orientationtagged Hoare logic
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Recommendations
- Title not available (Why is that?) ๐ ๐
- An observationally complete program logic for imperative higher-order functions ๐ ๐
- The axiomatic semantics of programs based on Hoare's logic ๐ ๐
- The propositional dynamic logic of deterministic, well-structured programs ๐ ๐
- Hoare-style logic for unstructured programs ๐ ๐
- A Hoare Logic for SIMT Programs ๐ ๐
- Verification: Theory and Practice ๐ ๐
- Theorem Proving in Higher Order Logics ๐ ๐
- A type system for logic programs ๐ ๐
- Formal Methods for Open Object-Based Distributed Systems ๐ ๐
This page was built for publication: A sound and complete Hoare logic for dynamically-typed, object-oriented programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2026792)