On the stability semantics of combinational programs

Authors:
Tran Van Dung
Affiliations:
Hanoi University of Communication and Transport
Venue:
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Year:
2005

Citing 4
Cited 0

Laws of programming

Communications of the ACM
Operational Semantics for Verilog

APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Deriving Operational Semantics from Denotational Semantics for Verilog

APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
A Theory of Combinational Programs

APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.