Proper termination of flow-of-control in programs involving concurrent processes

Autor:	Saul Volansky, Vincent G. Cerf, Kim Gostelow, Gerald Estrin
Rok vydání:	1972
Předmět:	Correctness Programming language Computer science Model of computation Distributed computing Bigraph Context (language use) Directed graph Deadlock computer.software_genre Computer Graphics and Computer-Aided Design Control flow Component (UML) computer Deadlock prevention algorithms Software
Zdroj:	ACM Annual Conference (2)
ISSN:	1558-1160 0362-1340
Popis:	This paper presents new results from a study of flow-of-control in programs involving concurrent processes. Within the framework of flow-of-control, this paper:1) defines a property of parallel program behavior called proper termination (PT);2) shows that any properly terminating program containing a specification of the resources it requires will be free of deadlock;3) identifies other important features of PT programs; and4) presents an algorithm to rapidly decide PT for a given program.This work is presented in the context of the control-flow component of a complex bigraph (complex bi-logic directed graph) model of computation [1,10].
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9022539a8ecdec61a0c97bd926cf620f https://doi.org/10.1145/987361.987365 Zobrazit plný text záznamu