A fixpoint semantics for nondeterministic data flow
Journal of the ACM (JACM)
Modeling concurrency with partial orders
International Journal of Parallel Programming
A fully abstract trace model for dataflow networks
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Full abstraction and fixed-point principles for indeterminate computation
Full abstraction and fixed-point principles for indeterminate computation
A model of concurrency with fair merge and full recursion
Information and Computation
The expressive power of indeterminate dataflow primitives
Information and Computation
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Generalized Kahn Principle for Abstract Asynchronous Networks
Proceedings of the 5th International Conference on Mathematical Foundations of Programming Semantics
Computations, Residuals, and the POwer of Indeterminancy
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
On the Semantics of Fair Parallelism
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Definable Operation in General Algebras, and the Theory of Automata and Flowcharts
Programming Languages and Their Definition - Hans Bekic (1936-1982)
The Relationship Between Multiway and Two-Way Fair Merges
The Relationship Between Multiway and Two-Way Fair Merges
Permission accounting in separation logic
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Variables as Resource in Hoare Logics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A semantics for concurrent separation logic
Theoretical Computer Science
Resources, concurrency, and local reasoning
Theoretical Computer Science
Local Action and Abstract Separation Logic
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Variables as Resource in Separation Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Variables as Resource for Shared-Memory Programs: Semantics and Soundness
Electronic Notes in Theoretical Computer Science (ENTCS)
Concurrent Separation Logic and Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Fair interleaving plays a fundamental role in denotational semantic models for shared-memory parallel programs, beginning with Park's trace semantics, based on a fairmerge relation designed so that (@a,@b,@c)@?fairmerge if and only if @c can be obtained by interleaving @a and @b. Park's formulation of fairmerge used nested greatest and least fixed points of monotone functions over traces, but he remarked that fixed point induction principles seem unsuitable for proving natural algebraic properties such as associativity. Such properties are needed to validate intuitive laws of program equivalence and to support hierarchical analysis of programs. Recent models and logics for shared-memory programs with mutable state and pointers build on and extend Park's foundations, with emphasis on resources and logical rules that embody separation principles. For example, concurrent separation logic is based on a race-detecting, resource-sensitive variant of fairmerge. For the kinds of interleaving employed in these models, and other more sophisticated variants of fairmerge, the algebraic difficulties are exacerbated. Rather than search for ad hoc techniques, we develop here a general framework for defining k-ary fairmerge operators, parameterized first by a choice of a resource model and then refined by a choice of a conflict or interference relation. Our formulation avoids nested fixed points, and supports inductive reasoning based on the length of finite prefixes of a trace. We prove a generalized associativity property, and obtain associativity proofs for prior models as a by-product.