Axiomatic characterization of trace reachability for concurrent objects

DOI10.1007/978-3-030-34968-4_9zbMATH Open1540.68149MaRDI QIDQ6536350

Frank S. de Boer, Hans-Dieter A. Hiep

Publication date: 19 April 2024

zbMATH Keywords

completenesscompositionalityconcurrencyprogram synthesis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• A sound and complete reasoning system for asynchronous communication with shared futures
• N. G. de Bruijn (1918--2012) and his road to Automath, the earliest proof checker
• Concurrency verification. Introduction to compositional and noncompositional methods
• A Complete Guide to the Future

This page was built for publication: Axiomatic characterization of trace reachability for concurrent objects

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