Towards a pomset semantics for a shared-variable parallel language

Authors:
Yongxin Zhao;Xu Wang;Huibiao Zhu
Affiliations:
Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China;International Institute for Software Technology, United Nations University, Macau, China;Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China
Venue:
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Year:
2010

Citing 13
Cited 0

Modeling concurrency with partial orders

International Journal of Parallel Programming
Trace theory

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Defining conditional independence using collapses

Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
A logical view of composition

Selected papers of the 3rd workshop on Concurrency and compositionality
Designing memory consistency models for shared-memory multiprocessors

Designing memory consistency models for shared-memory multiprocessors
Resource traces: a domain for processes sharing exclusive resources

Theoretical Computer Science
Shared Memory Consistency Models: A Tutorial

Computer
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Partial orders and the axiomatic theory of shuffle (pomsets)

Partial orders and the axiomatic theory of shuffle (pomsets)
Dynamic partial-order reduction for model checking software

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resources, concurrency, and local reasoning

Theoretical Computer Science
Stateful dynamic partial-order reduction

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a pomset semantics for a shared-variable parallel language which is an extension of the one studied by Brookes in [5]. The pomset semantics lifts the transition trace semantics to the non-interleaving setting, where parallel events in a pomset transition trace are labeled by conditionally independent actions. Most of the important laws from the interleaving setting also hold in the noninterleaving setting. Similarities and differences with other related works are discussed.