An Extensional Treatment of Lazy Data Flow Deadlock

@article{Matthews1995AnET,
  title={An Extensional Treatment of Lazy Data Flow Deadlock},
  author={S. G. Matthews},
  journal={Theor. Comput. Sci.},
  year={1995},
  volume={151},
  pages={195-205}
}
  • S. Matthews
  • Published 13 November 1995
  • Computer Science
  • Theor. Comput. Sci.
View via Publisher
doi.org
63 Citations
Highly Influential Citations
5
Background Citations
21
Methods Citations
10
Results Citations
2

63 Citations

Towards a Deadlock Analysis for Erlang Programs 1

It is argued that there is a need for automated veri cation of absence of deadlocks in concurrent programs, and detailed models of the semantics of the Erlang messaging system and its synchronization primitives both in terms of synchronously communicating sequential processes and of Concurrent Constraint Programming are given.

From Semantics to Computer Science: The semantics of dataflow with firing

It is shown that sequences of firings define a continuous Kahn process as the least fixed point of an appropriately constructed functional, and solve some compositionality problems in the dataflow model.

A causality interface for deadlock analysis in dataflow

This paper develops a causality interface for dataflow actors based on the general framework introduced in [1] and shows how this causality information can be algebraically composed so that composition of components acquire causality interfaces that are inferred from their components and the interconnections.

Stratified negation in temporal logic programming and the cycle-sum test

Order and containment in concurrent system design

The contents of this dissertation show that no methodology is currently available that can concisely, accurately and graphically model both the order and containment relations found in complex, concurrent systems and offers a solution to this problem with the introduction of the diposet.

A framework for comparing models of computation

We give a denotational framework (a "meta model") within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible…

Mathematics of Domains

Two groups of naturally arising questions in the mathematical theory of domains for denotational semantics are addressed and a novel approach is presented, and the answers are supplied with much more compelling and clear justifications, than were known before.

Valuations revisited

The main purpose of this short note is to provide a basic introduction to the notion of a semivaluation independent of the domain theoretic considerations of [Sch98] and to discuss a recently obtained characterization of valuations in terms of semivaluations.

On 0-Complete Partial Metric Spaces and Quantitative Fixed Point Techniques in Denotational Semantics

In 1994, Matthews introduced the notion of partial metric space with the aim of providing a quantitative mathematical model suitable for program verification. Concretely, Matthews proved a partial…

Modeling concurrent real-time processes using discrete events

A formal framework for studying real-time discrete-event systems that describes concurrent processes as sets of possible behaviors and defines Zeno conditions, which ensure determinacy under certain technical conditions.
...

References

SHOWING 1-10 OF 12 REFERENCES

An Extensional Treatment of Dataflow Deadlock

  • W. Wadge
  • Computer Science
    Theor. Comput. Sci.
  • 1979

An Operational Semantics for Pure Dataflow

This paper proves the equivalence of an operational and a denotational semantics for pure dataflow, and it is proved that the operational behaviour of apure dataflow net is exactly described by the least fixed point solution to the net's associated set of equations.

Lucid, the dataflow programming language

Lucid is a functional language, but one which supports variables, i.e. values which change with time, so programmers can use iteration (repetition) as well as recursion.

An axiomatic basis for computer programming

An attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics by elucidation of sets of axioms and rules of inference.

Partial Metric Topology

This paper presents a symmetric generalised metric for such topologies, an approach which sheds new light on how metric tools such as Banach's Theorem can be extended to non‐Hausdorff topologies.

A metalogical analysis of vagueness : an exploratory study into the geometry of logic

This thesis investigates Hayes' suggestion of developing Tolerance Geometry into a formal framework in which one can capture such intuitive terms as bodies touching, and characterising such vague terms as being tall, and reveals that Zadeh has confused the notions of continuity and the continuum, and therefore his theory of fuzzy sets rest on a mistaken assumption.

CONS Should Not Evaluate its Arguments

On Observing Nondeterminism and Concurrency

Inhtroduction to Metric and Topological Spaces (Oxford

  • 1975

Topologie, Vol. 1 (Warsaw

  • 1958