A prover for parallel processes
Masahiro Hirata, Toshio Nishimura
Abstract
Masahiro Hirata, Toshio Nishimura
Abstract
We give an automatic prover for verifying logical properties of parallel processes. The prover bases on a subsystem of the system given in [8]. We mechanize it so that a proof-tree is automatically constructed. The prover reduces a parallel program into possible serial ones by applying rules of inference 'interruption' etc.. This paper includes some examples processed by the prover.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We give an automatic prover for verifying logical properties of parallel processes. The prover bases on a subsystem of the system given in [8]. We mechanize it so that a proof-tree is automatically constructed. The prover reduces a parallel program into possible serial ones by applying rules of inference 'interruption' etc.. This paper includes some examples processed by the prover.
Key concepts: Gas meter prover, Computer science, Automated theorem proving, Inference, Programming language, Rule of inference, Algorithm, Theoretical computer science