Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

V. L. Nguyen

dblp:24/5502 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 50% Concurrent programming · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Concurrent programming › concurrent processes
asynchronous processes
0.011985
A Fixpoint Semantics for Nondeterministic Data Flow · J. ACM 1985
Programming languages and type systems › language semantics
dataflow semantics
0.011985
A Fixpoint Semantics for Nondeterministic Data Flow · J. ACM 1985
Programming languages and type systems
language semantics
0.011985
A Fixpoint Semantics for Nondeterministic Data Flow · J. ACM 1985
Concurrent programming › concurrency models
nondeterminism
0.011985
A Fixpoint Semantics for Nondeterministic Data Flow · J. ACM 1985

Methods — techniques the papers use, named apart from their topics

partially ordered multiset · 0.0fixpoint semantics · 0.0
YearPublicationVenuePosition
1985 A Fixpoint Semantics for Nondeterministic Data Flow
abstract
Criteria for adequacy of a data flow semantics are discussed and Kahn's successful semantics for functional (deterministic) data flow is reviewed. Problems arising from nondeterminism are introduced and the paper's approach to overcoming them is introduced. The approach is based on generalizing the notion of input-output relation, essentially to a partially ordered multiset of input-output histories. The Brock-Ackerman anomalies concerning the input-output relation model of nondeterministic data flow are reviewed, and it is indicated how the proposed approach avoids them. A new anomaly is introduced to motivate the use of multisets. A formal theory of asynchronous processes is then developed. The main result is that the operation of forming a process from a network of component processes is associative. This result shows that the approach is not subject to anomalies such as that of Brock and Ackerman.
John Staples, V. L. Nguyen
J. ACM2
1983 Computing the Behaviour of Asynchronous Processes
John Staples, V. L. Nguyen
Theor. Comput. Sci.2
1982 Fixed Point Theorems and Semantics: A Folk Tale
Jean-Louis Lassez, V. L. Nguyen, Liz Sonenberg
Inf. Process. Lett.2
1981 A Dual Problem to Least Fixed Points
V. L. Nguyen, Jean-Louis Lassez
Theor. Comput. Sci.1