On the role of automated theorem proving in the compile-time derivation of concurrency

DOI10.1007/BF00244290zbMath0614.68067MaRDI QIDQ1819947

Christian Lengauer

Publication date: 1985

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

program transformationconcurrencyautomated program synthesis and validation

Mathematics Subject Classification ID

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

Related Items (1)

The automated proof of a trace transformation for a bitonic sort

This page was built for publication: On the role of automated theorem proving in the compile-time derivation of concurrency