Result: An assertion-based proof system for multithreaded Java

Title:
An assertion-based proof system for multithreaded Java
Source:
Formal Methods for Components and ObjectsTheoretical computer science. 331(2-3):251-290
Publisher Information:
Amsterdam: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 52 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 des langages et analyse syntaxique, Language theory and syntactical analysis, Théorie programmation, Programming theory, Logiciel, Software, Langages de programmation, Programming languages, Consistance sémantique, Soundness, Consistencia semantica, Envoi message, Message passing, Flot commande, Control flow, Flujo control, Indice conditionnement, Condition number, Numero de condicionamiento, Informatique théorique, Computer theory, Informática teórica, Langage orienté objet, Object-oriented languages, Logique Hoare, Hoare logic, Lógica Hoare, Moniteur, Monitor, Multitâche, Multithread, Multitarea, Simultanéité informatique, Concurrency, Simultaneidad informatica, Synchronisation, Synchronization, Sincronización, Vérification, Verification, Verificación, 05B40, 68N19, 68Q60, Complétude relative, Relative completeness, Concurrence, PVS, Hoare-logic, Java, Monitors, Multithreading, Soundness and relative completeness
Subject Geographic:
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Christian-Albrechts-University Kiel, Germany
CWI Amsterdam, 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
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.16576134
Database:
PASCAL Archive

Further Information

Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread classes, allowing for a multithreaded flow of control. The concurrency model includes synchronous message passing, dynamic thread creation, shared-variable concurrency via instance variables, and coordination via reentrant synchronization monitors. To reason about safety properties of multithreaded Java programs, we introduce an assertional proof method for a multithreaded sublanguage of Java, covering the mentioned concurrency issues as well as the object-based core of Java. The verification method is formulated in terms of proof-outlines, where the assertions are layered into local ones specifying the behavior of a single instance, and global ones taking care of the connections between objects. We establish the soundness and the relative completeness of the proof system. From an annotated program, a number of verification conditions are generated and handed over to the interactive theorem prover PVS.