CÁC BÀI BÁO KHOA HỌC 06:03:35 Ngày 18/08/2019 GMT+7
On the stability semantics of combinational programs

In this paper we prove some properties of combinational programs which is an improvement of the results presented in our previous work. We prove the derivation of loop-programs for combinational ones by both event semantics and stability semantics. We give a normal form for syntactically well-formed combinational programs, and show that for them Dimitrov's multiple parallel approach and Zhu's shared store parallel approach are equivalent. © Springer-Verlag Berlin Heidelberg 2005.


 Van Dung T.
   691.pdf    Gửi cho bạn bè
  Từ khóa : Semantics; Stability; Theorem proving; Combinational programs; Loop-programs; Stability semantics; Program diagnostics