On the programs-as-formulas interpretation of parallel programs in Peano arithmetic

DOI10.1016/0168-0072(88)90024-3zbMath0641.68022OpenAlexW1985657481MaRDI QIDQ1100878

E. J. Farkas, Manfred E. Szabo

Publication date: 1988

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(88)90024-3

zbMATH Keywords

Peano arithmeticparallel programsnon-deterministic sequential process

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25) Inductive definability (03D70)

Related Items (1)

A faithful embedding of parallel computations in star-finite models

Cites Work

• Ten years of Hoare's logic: A survey. II: Nondeterminism
• Recursive assertions and parallel programs
• Programs and program verifications in a general setting
• An axiomatic proof technique for parallel programs
• Unnamed Item
• Unnamed Item

This page was built for publication: On the programs-as-formulas interpretation of parallel programs in Peano arithmetic