Willem P. de Roever

According to our database1, Willem P. de Roever authored at least 79 papers between 1972 and 2016.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Warmest Congratulations, Frank!
Proceedings of the Theory and Practice of Formal Methods, 2016

2015
Warmest Congratulations, Ernst-Rüdiger!
Proceedings of the Correct System Design, 2015

2010
Remembering Amir Pnueli, a great scientist and a great friend (April 22, 1941-November 2, 2009).
Sci. Comput. Program., 2010

What Is in a Step: New Perspectives on a Classical Question.
Proceedings of the Time for Verification, 2010

2008
A Deductive Proof System for Multithreaded Java with Exceptions.
Fundam. Inform., 2008

2006
Compositional Operational Semantics of a UML-Kernel-Model Language.
Electr. Notes Theor. Comput. Sci., 2006

Inductive Proof Outlines for Exceptions in Multithreaded Java.
Electr. Notes Theor. Comput. Sci., 2006

2005
An assertion-based proof system for multithreaded Java.
Theor. Comput. Sci., 2005

A Compositional Trace Logic for Behavioural Interface Specifications.
Nord. J. Comput., 2005

A Perspective on Program Verification.
Proceedings of the Verified Software: Theories, 2005

29 New Unclarities in the Semantics of UML 2.0 State Machines.
Proceedings of the Formal Methods and Software Engineering, 2005

Verifying Parameterized Refinement.
Proceedings of the 10th International Conference on Engineering of Complex Computer Systems (ICECCS 2005), 2005


2003
Inductive Proof Outlines for Monitors in Java.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2003

A Compositional Operational Semantics for JavaMT.
Proceedings of the Verification: Theory and Practice, 2003

2002
Verification for Java's Reentrant Multithreading Concept.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

A Tool-Supported Proof System for Multithreaded Java.
Proceedings of the Formal Methods for Components and Objects, 2002

2001
Concurrency Verification: Introduction to Compositional and Noncompositional Methods
Cambridge Tracts in Theoretical Computer Science 54, Cambridge University Press, ISBN: 0-521-80608-9, 2001

2000
Basic Principles of a textbook on the compositional and noncompositional verification of concurrent programs.
Proceedings of the Formale Beschreibungstechniken für verteilte Systeme, 2000

1999
The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Formal Justification of the Rely-Guarantee Paradigm for Shared-Variable Concurrency: A Semantic Approach.
Proceedings of the FM'99 - Formal Methods, 1999

1998
Data Refinement: Model-oriented Proof Theories and their Comparison
Cambridge Tracts in Theoretical Computer Science 46, Cambridge University Press, ISBN: 0-521-64170-5, 1998

1997
The Rely-Guarantee Method for Verifying Shared Variable Concurrent Programs.
Formal Asp. Comput., 1997

Hoare-Style Compositional Proof Systems for Reactive Shared Variable Concurency.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

A Compositional Proof System for Shared Variable Concurrency.
Proceedings of the FME '97: Industrial Applications and Strengthened Foundations of Formal Methods, 1997

A Dense-Time Temporal Logic with Nice Compositionality Properties.
Proceedings of the Computer Aided Systems Theory, 1997

The Need for Compositional Proof Systems: A Survey.
Proceedings of the Compositionality: The Significant Difference, International Symposium, 1997

Compositional Proof Methods for Concurrency: A Semantic Approach.
Proceedings of the Compositionality: The Significant Difference, International Symposium, 1997

1996
Simulation of Specification Statements in Hoare Logic.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Compositionality in Real-Time Shared Variable Concurrency.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development.
Proceedings of the FME '96: Industrial Benefit and Advances in Formal Methods, 1996

1995
Towards a Practitioners' Approach to Abadi and Lamport's Method.
Formal Asp. Comput., 1995

Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1994
A Principle for Sequential Reasoning about Distributed Algorithms.
Formal Asp. Comput., 1994

Formal Semantics for Ward & Mellor's Transformation Schemas.
Proceedings of the 6th Refinement Workshop, 1994

Formal Semantics for Ward & Mellor's Transformation Schemas and the Specification of Faul Tolerant Systems.
Proceedings of the Dependable Computing, 1994

1993
Specifying Fault Tolerance within Stark's Formalism.
Proceedings of the Digest of Papers: FTCS-23, 1993

Generalizing Abadi & Lamport's Method to Solve a Problem Posed by A. Pnueli.
Proceedings of the FME '93: Industrial-Strength Formal Methods, 1993

Using Relative Refinement for Fault Tolerance.
Proceedings of the FME '93: Industrial-Strength Formal Methods, 1993

1992
A Compositional Axiomatization of Statecharts.
Theor. Comput. Sci., 1992

A Note on Compositional Refinement.
Proceedings of the 5th Refinement Workshop, 1992

Formalising Dijkstra's Development Strategy within Stark's Formalism.
Proceedings of the 5th Refinement Workshop, 1992

1991
Introduction to Design Choices in the Semantics of Statecharts.
Inf. Process. Lett., 1991

1989
The upsilon-Calculus as an Assertion-Language for Fairness Arguments
Inf. Comput., September, 1989

Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract).
Proceedings of the Distributed Algorithms, 1989

Design and verification in real-time distributed computing: an introduction to compositional methods.
Proceedings of the Protocol Specification, 1989

Predicates are Predicate Transformers: A Unified Compositional Theory for Concurrency.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988
Compositional Semantics for Real-Time Distributed Computing
Inf. Comput., December, 1988

Modeling Statecharts Behaviour in a Fully Abstract Way.
Proceedings of the CAAP '88, 1988

1987
Compositionality and Modularity in Process Specification and Design: A Trace-State Based Approach.
Proceedings of the Temporal Logic in Specification, 1987

Full Abstraction of a Real-Time Denotational Semantics for an Occam-like Language.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

A Correctness Proof of a Distributed Minimum-Weight Spanning Tree Algorithm (extended abstract).
Proceedings of the 7th International Conference on Distributed Computing Systems, 1987

1986
Program Derivation Through Transformations: The Evolution of List-Copying Algorithms.
Sci. Comput. Program., 1986

Process Constructors and Interpretations - Response.
Proceedings of the Information Processing 86, 1986

The Quest Goes on: A Survey of Proofsystems for Partial Correctness of CSP.
Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986

1985
A Proof Rule for Fair Termination of Guarded Commands
Information and Control, 1985

Compositional Semantics for Real-time Distributed Computing.
Proceedings of the Logics of Programs, 1985

Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem.
Proceedings of the Automata, 1985

1984
A Proof System for Concurrent ADA Programs.
Sci. Comput. Program., 1984

1983
Real-Time Programming and Asynchronous Message Passing.
Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983

A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract).
Proceedings of the Logics of Programs, 1983

Examples of a Real-Time Temporal Logic Specification.
Proceedings of the Analysis of Concurrent Systems, 1983

1982
Procedures and concurrency: A study in proof.
Proceedings of the International Symposium on Programming, 1982

Fairness Assumptions for CSP in a Temporal Logic Framework.
Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

1981
A Formalism for Reasoning about Fair Termination.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

A Proof System for Brinch Hansen's Distributed Processes.
Proceedings of the GI, 1981

1980
A Proof System for Communicating Sequential Processes.
ACM Trans. Program. Lang. Syst., 1980

1979
Semantics of Nondeterminism, Concurrency, and Communication.
J. Comput. Syst. Sci., 1979

The Evolution of List-Copying Algorithms.
Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979

1978
Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
On Backtracking and Greatest Fixpoints.
Proceedings of the Formal Description of Programming Concepts: Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, 1977

On Backtracking and Greatest Fixpoints.
Proceedings of the Automata, 1977

1976
Recursive program schemes: semantics and proof theory.
PhD thesis, 1976

Dijkstra's Predicate Transformer, Non-Determinism, Recursion and Termination.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
First-Order Reductions of Call-by-Name to Call-by-Value.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

1974
Call-by-Value versus Call-by-Name: A proof-Theoretic Comparison.
Proceedings of the Mathematical Foundations of Computer Science, 1974

Recursion and Parameter Mechanisms: An Axiomatic Approach.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973
Operational and Mathematical Semantics for Recursive Polyadic Program Schemata.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

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


  Loading...