Habituate 发表于 2025-3-23 13:34:47

Transaction Calculus, long-running transactions. This paper presents a design model for specifying the behaviour of compensable programs. The new model for handling exception and compensation is built as conservative extension of the standard relational model. The paper puts forward a mathematical framework for transact

记成蚂蚁 发表于 2025-3-23 14:07:43

UTP and Temporal Logic Model Checking,Unifying Theories of Programming (UTP). Our perspective emphasizes the use of UTP designs, an alphabetised relational calculus expressed as a pre/post condition pair of relations, to verify state or temporal assertions about programs. The temporal model checking relation is derived from a satisfacti

关节炎 发表于 2025-3-23 19:41:22

A Note on Traces Refinement and the , Relation in the Unifying Theories of Programming,able in the failures-divergences model; the UTP theory is richer and can be used to give semantics to data-rich process algebras like .. Previously, we have defined functions that calculate the failures-divergences model of a CSP process characterised by a UTP relation. In this note, we use these fu

碎石 发表于 2025-3-24 00:06:29

Reasoning about Loops in Total and General Correctness,gebra. We demonstrate its utility in verifying the familiar loop-invariant rule for refining a total-correctness specification by a while loop. Total correctness equates non-termination with completely chaotic behaviour, with the consequence that any situation which admits non-termination must also

GRATE 发表于 2025-3-24 06:10:31

http://reply.papertrans.cn/95/9421/942056/942056_15.png

BILL 发表于 2025-3-24 08:33:38

Monadic Maps and Folds for Multirelations in an Allegory,nsformer semantics to algebraic semantics and the derivation of programs by calculation, as used in functional programming and relational program development. Two common ways to characterise iteration, namely the functional programming operators . and ., are extended to multirelations, using concept

改变 发表于 2025-3-24 12:16:50

Unifying Theories of Interrupts,ations to model failure, or to describe complex interactions between non co-operating components. It is frequently used in hardware to allow complex scheduling patterns. Although interrupts are ubiquitous in usage, the precise behaviour of a system incorporating interrupts can be difficult to reason

heterogeneous 发表于 2025-3-24 17:16:20

http://reply.papertrans.cn/95/9421/942056/942056_18.png

歌曲 发表于 2025-3-24 19:43:24

http://reply.papertrans.cn/95/9421/942056/942056_19.png

范例 发表于 2025-3-25 02:22:53

http://reply.papertrans.cn/95/9421/942056/942056_20.png
页: 1 [2] 3 4 5 6
查看完整版本: Titlebook: Unifying Theories of Programming; Second International Andrew Butterfield Conference proceedings 2010 Springer-Verlag Berlin Heidelberg 201