A verification system for concurrent programs based on the Boyer-Moore prover
type: Item
instance of: scholarly article
title: A verification system for concurrent programs based on the Boyer-Moore prover
zbMATH Open document ID: 0758.68047
DOI: 10.1007/BF03180564
author: David M. Russinoff
published in: Formal Aspects of Computing
publication date: 1993-02-04T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 110526
zbMATH Keywords: Boyer-Moore theorem prover
zbMATH Keywords: concurrent programming
zbMATH Keywords: Manna-Pnueli model
zbMATH Keywords: program verification
zbMATH Keywords: temporal logic
describes a project that uses: NQTHM
describes a project that uses: UNITY
MaRDI profile type: Publication
cites work: Q4040283
cites work: The addition of bounded quantification and partial functions to a computational logic and its theorem prover
cites work: Q4016540
cites work: Q4692502
cites work: Adequate proof principles for invariance and liveness properties of concurrent programs
full work available at URL: https://doi.org/10.1007/bf03180564
OpenAlex ID: W2034892041
description: scientific article; zbMATH DE number 110526