Verification of Fine-grain Concurrent Programs

DOI10.1016/j.entcs.2008.04.010zbMath1279.68261OpenAlexW2147727237WikidataQ126030093 ScholiaQ126030093MaRDI QIDQ2870197

C. A. R. Hoare

Publication date: 17 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.010

zbMATH Keywords

Petri netsflowchartsfine-grain concurrent programsFloyd assertions

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)

Related Items (1)

Guest editors' preface to special issue on interval temporal logics

This page was built for publication: Verification of Fine-grain Concurrent Programs