J. W. de Bakker

According to our database1, J. W. de Bakker authored at least 54 papers between 1966 and 2000.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2000
A transition system semantics for the control-driven coordination language MANIFOLD.
Theor. Comput. Sci., 2000

Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice.
Proceedings of the First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2000

Fixed Points in Metric Semantics.
Proceedings of the First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2000

From Banach to Milner: metric semantics for second order communication and concurrency.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
Full Abstractness of a Metric Semantics for Action Refinement.
Fundam. Informaticae, 1999

1996
Control flow semantics.
MIT Press, ISBN: 978-0-262-04154-6, 1996

1995
The Three Dimensions of Semantics.
Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

1994
Fully Abstract Denotational Models for Nonuniform Concurrent Languages
Inf. Comput., November, 1994

Bisimulation Semantics for Concurrency with Atomicity and Action Refinement.
Fundam. Informaticae, 1994

1993
Rendez-Vous with Metric Semantics.
New Gener. Comput., 1993

Topological Models for Higher Ordr Control Flow.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1991
Comparative Semantics for Flow of Control in Logic Programming without Logic
Inf. Comput., October, 1991

Four Domains for Concurrency.
Theor. Comput. Sci., 1991

CCS for OO and LP.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Rendezvous with Metric Semantics.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

1990
Comparative Metric Semantics for Concurrent Prolog.
Theor. Comput. Sci., 1990

Metric Pomset Semantics for a Concurrnt Language with Recursion.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

1989
Denotational Semantics of a Parallel Object-Oriented Language
Inf. Comput., November, 1989

Designing Concurrency Semantics.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988
Designing Equivalent Semantic Models for Process Creation.
Theor. Comput. Sci., 1988

Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency.
J. Comput. Syst. Sci., 1988

Metric Semantics for Concurrency.
BIT, 1988

Uniform Abstraction, Atomicity and Contractions in the Comparative Semantics of Concurrent Prolog.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

1987
Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency.
Theor. Comput. Sci., 1987

Order and Metric in the Stream Semantics of Elemental Concurrency.
Acta Informatica, 1987

1986
Operational Semantics of a Parallel Object-Oriented Language.
Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986

Designing Equvialent Semantic Models for Process Creation.
Proceedings of the Mathematical Models for the Semantics of Parallelism, Advanced School, Rome, Italy, September 24, 1986

Contrasting Themes in the Semantics of Imperative Concurrency.
Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986

1985
Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Towards a Uniform Topological Treatment of Streams and Functions on Streams.
Proceedings of the Automata, 1985

1984
Linear Time and Branching Time Semantics for Recursion with Merge.
Theor. Comput. Sci., 1984

1983
On Infinite Computations in Denotational Semantics.
Theor. Comput. Sci., 1983

Compactness in Semantics for Merge and Fair Merge.
Proceedings of the Logics of Programs, 1983

Processes and a Fair Semantics for the Ada Rendez-Vous.
Proceedings of the Automata, 1983

1982
Processes and the Denotational Semantics of Concurrency
Inf. Control., 1982

Denotational Semantics of Concurrency
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Session Discussion.
Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

1981
Correctness of Programs with Function Procedures.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

1980
Mathematical theory of program correctness.
Prentice-Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-562132-5, 1980

1979
A Sound and Complete Proof System for Partial Program Correctness.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977
Semantics of Infinite Processes Using Generalized Trees.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Recursive Programs as Predicate Transformers.
Proceedings of the Formal Description of Programming Concepts: Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, 1977

Semantics and the Foundations of Program Proving.
Proceedings of the Information Processing, 1977

Semantics and Proof Theory of Pascal Procedures.
Proceedings of the Automata, 1977

1976
Least Fixed Points Revisited.
Theor. Comput. Sci., 1976

Exercises in Denotational Semantics.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

Semantics and Termination of Nondeterministic Recursive Programs.
Proceedings of the Third International Colloquium on Automata, 1976

1975
On the Completeness of the Inductive Assertion Method.
J. Comput. Syst. Sci., 1975

Flow of Control in the Proof Theory of Structured Programming
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1972
A Calculus for Recursive Program Schemes.
Proceedings of the Automata, 1972

1971
A property of linear conditionals.
Proceedings of the Symposium on Semantics of Algorithmic Languages, 1971

Axiom systems for simple assignment statements.
Proceedings of the Symposium on Semantics of Algorithmic Languages, 1971

1966
On AXLE.
Commun. ACM, 1966


  Loading...