繁忙
发表于 2025-3-28 15:30:43
Programs as Transformations of Algebraic Theories (Extended Abstract)ras. The second class of approaches is concerned with programs as implementations of abstractly specified data types. Programs are viewed as data type specifications that extend the base type by the . (variables, functions, types) it computes , , , , , among other
即席演说
发表于 2025-3-28 22:24:51
http://reply.papertrans.cn/39/3801/380087/380087_42.png
photophobia
发表于 2025-3-29 01:50:51
978-3-540-10884-9Springer-Verlag Berlin Heidelberg 1981
GRAVE
发表于 2025-3-29 05:38:06
http://reply.papertrans.cn/39/3801/380087/380087_44.png
Foam-Cells
发表于 2025-3-29 07:50:17
http://reply.papertrans.cn/39/3801/380087/380087_45.png
山间窄路
发表于 2025-3-29 15:15:45
http://reply.papertrans.cn/39/3801/380087/380087_46.png
控诉
发表于 2025-3-29 16:45:20
https://doi.org/10.1007/978-3-663-05132-9A DP program consists of a fixed number of concurrent and persistent processes, that are started simultaneously. We assume the processes as being numbered, hence the program is denoted as (P. ||... || P.), n≥ 2. A process does not contain parallel statements, nor shared variables. The syntax of a process is as follows:
吹牛大王
发表于 2025-3-29 20:29:38
Semantics of Distributed Processes Derived by TranslationThe aim of this paper is to show a technique for getting an operational semantics for the language of Distributed Processes(DP) introduced in /BH/, by means of a translation into the language of behaviour expressions in CCS, the Calculus of Communicating Systems developed in /M/.
胆汁
发表于 2025-3-30 00:41:07
A Proof System for Brinch Hansen’s Distributed ProcessesA DP program consists of a fixed number of concurrent and persistent processes, that are started simultaneously. We assume the processes as being numbered, hence the program is denoted as (P. ||... || P.), n≥ 2. A process does not contain parallel statements, nor shared variables. The syntax of a process is as follows:
闲荡
发表于 2025-3-30 07:56:00
,Weltberühmt durch einen Irrtum?, method of abstract interpretation within various data flow analysis frameworks. Each transformation, as it changes the program, may render the flow information derived for the original program suboptimal or even invalid with respect to the new program. Although the outdated flow information may ser