Result: A proof outline logic for object-oriented programming
Title:
A proof outline logic for object-oriented programming
Authors:
Source:
Formal Methods for Components and ObjectsTheoretical computer science. 343(3):413-442
Publisher Information:
Amsterdam: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 37 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Logique générale, General logic, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Logiciel, Software, Langages de programmation, Programming languages, Allocation dynamique, Dynamic allocation, Asignación dinámica, Assignation, Assignment, Asignación, Informatique théorique, Computer theory, Informática teórica, Langage orienté objet, Object-oriented languages, Langage programmation, Programming language, Lenguaje programación, Logique Hoare, Hoare logic, Lógica Hoare, Ombrage, Shadowing, Umbría, Programmation orientée objet, Object-oriented programming, Préconditionnement, Preconditioning, Precondicionamiento, Vérification, Verification, Verificación, Proof outline, Règle adaptation, Rule of adaptation, Sous typage, Proof outline logic: Hoare logic
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Utrecht University, Netherlands
CWI, Amsterdam, Netherlands
Leiden University, Netherlands
CWI, Amsterdam, Netherlands
Leiden University, Netherlands
ISSN:
0304-3975
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.17199682
Database:
PASCAL Archive
Further Information
This paper describes a proof outline logic that covers most typical object-oriented language constructs in the presence of inheritance and subtyping. The logic is based on a weakest precondition calculus for assignments and object allocation which takes field shadowing into account. Dynamically bound method calls are tackled with a variant of Hoare's rule of adaptation that deals with the dynamic allocation of objects in object-oriented programs. The logic is based on an assertion language that is closely tailored to the abstraction level of the programming language.