Axiomatic characterization of trace reachability for concurrent objects

DOI10.1007/978-3-030-34968-4_9MaRDI QIDQ6536350zbMATH OpenFDO

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

Publication date 19 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-34968-4_9

zbMATH Keywords

completenessconcurrencycompositionalityprogram synthesis

Mathematics Subject Classification ID

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

Recommendations

• A fully abstract may testing semantics for concurrent objects
• Model-checking of correctness conditions for concurrent objects
• scientific article; zbMATH DE number 3902009
• Connections between a concrete and an abstract model of concurrent systems
• scientific article; zbMATH DE number 3932376

Cites work

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

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)