scientific article
From MaRDI portal
Publication:3871899
zbMath0433.68020MaRDI QIDQ3871899
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
verificationcorrectnessnon-terminationabsence of deadlockinvariance proof methodnetworks of nondeterministic sequential processessemantic analysis techniques for concurrent programs
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items (4)
A proof technique for communicating sequential processes ⋮ Data flow analysis of distributed communicating processes ⋮ Semantics of algorithmic languages ⋮ A weakest precondition semantics for communicating processes
This page was built for publication: