intimate
发表于 2025-3-23 10:36:07
http://reply.papertrans.cn/84/8304/830394/830394_11.png
FISC
发表于 2025-3-23 15:49:45
http://reply.papertrans.cn/84/8304/830394/830394_12.png
lactic
发表于 2025-3-23 18:23:16
http://reply.papertrans.cn/84/8304/830394/830394_13.png
STRIA
发表于 2025-3-24 00:37:35
Relaxing Restrictions on Invariant Composition in the , Method by Ownership Control ,,,nsure soundness of component compositions with a few additional proof obligations. On the other hand, in the context of the verification of object oriented programs, . proposes a more expressive approach, but at the price of more complex specifications, and more numerous proof obligations. In this p
defray
发表于 2025-3-24 06:02:48
Designing Old and New Distributed Algorithms by Replaying an Incremental Proof-Based Development,plex to verify in practice. Using the event B method, we develop a famous distributed algorithm, namely the leader election protocol for an acyclic network, generally known as the IEEE 1394. The algorithm exists and the refinement helps us to model it entirely in an elegant way. The final model is v
Alcove
发表于 2025-3-24 09:12:15
http://reply.papertrans.cn/84/8304/830394/830394_16.png
probate
发表于 2025-3-24 13:45:26
An ASM-Characterization of a Class of Distributed Algorithms,etc. Gurevich’s . take a more liberal position: . first-order structure may serve as a state. In Gurevich characterizes the expressive power of .: he defines the class of . by means of only a few, amazingly general requirements and proves this class to be equivalent to sequential ASMs..In this p
GRAVE
发表于 2025-3-24 16:30:49
Using Abstract State Machines for the Design of Multi-level Transaction Schedulers,vel conflicts to be ignored by taking higher-level application semantics into account. In this paper, we approach the formal specification of a multi-level transaction scheduler using Abstract State Machines. We are particularly interested in showing that concrete protocols for multi-level transacti
linear
发表于 2025-3-24 19:46:44
Validating and Animating Higher-Order Recursive Functions in B, complicated functions which cannot be represented explicitly by a tool. We present a scheme with which higher-order recursive functions can be encoded in B, and establish soundness of this scheme. We then describe a symbolic representation for such functions. This representation enables . to succes
fiction
发表于 2025-3-25 00:27:28
http://reply.papertrans.cn/84/8304/830394/830394_20.png