A system for compositional verification of asynchronous objects
type: Item
instance of: scholarly article
title: A system for compositional verification of asynchronous objects
zbMATH Open document ID: 1264.68050
author: Wolfgang Ahrendt
author: Maximilian Dylla
published in: Science of Computer Programming
publication date: 2013-06-06T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68N19
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 6171347
zbMATH Keywords: verification
zbMATH Keywords: concurrency
zbMATH Keywords: semantics
zbMATH Keywords: object-orientation
describes a project that uses: ANTLR
describes a project that uses: Why3
describes a project that uses: KeYmaera
describes a project that uses: Boogie
describes a project that uses: ASMKeY
describes a project that uses: KeY-C
describes a project that uses: KRAKATOA
describes a project that uses: Caduceus
describes a project that uses: ESC/Java
describes a project that uses: Creol
MaRDI profile type: Publication
full work available at URL: j.scico.2010.08.003
OpenAlex ID: W2016286256
cites work: An assertion-based proof system for multithreaded Java
cites work: The B-Book
cites work: A Proof System for Communicating Sequential Processes
cites work: Mathematics of Program Construction
cites work: Q4539645
cites work: Concurrency verification. Introduction to compositional and noncompositional methods
cites work: A Hoare logic for dynamic networks of asynchronously communicating deterministic processes
cites work: Observable behavior of dynamic systems: component reasoning for concurrent objects
cites work: Generating Unit Tests from Formal Proofs
cites work: Q4525781
cites work: An axiomatic basis for computer programming
cites work: Q3777424
cites work: Q4790344
cites work: Object-Oriented Specification and Open Distributed Systems
cites work: Creol: A type-safe object-oriented model for distributed concurrent systems
cites work: A calculus of communicating systems
cites work: Q4248252
cites work: Proofs of Networks of Processes
cites work: An axiomatic proof technique for parallel programs
cites work: KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
cites work: Axiomatic semantics of communicating sequential processes
cites work: Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
DOI: 10.1016/J.SCICO.2010.08.003
description: scientific article; zbMATH DE number 6171347