Jan A. Bergstra

Proceedings of the Algebraic and Logic Programming, 1988

1987

Algebraic Specifications of Computable and Semicomputable Data Types.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

On the Consistency of Koomen's Fair Abstraction Rule.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator.

[BibT_eX]

[DOI]

Comput. J., 1987

Term Rewriting Systems with Priorities.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

Failures without chaos: a new process semantics for fair abstraction.

[BibT_eX]

Ernst-Rüdiger Olderog

Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

Conditional axioms and α/β-calculus in process algebra.

[BibT_eX]

Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

ACT<sub>tau</sub>: A Universal Axiom System for Process Specification.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methods: Theory, 1987

1986

Conditional Rewrite Rules: Confluence and Termination.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

1985

Algebra of Communicating Processes with Abstraction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Top-Down Design and the Algebra of Communicating Processes.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1985

Verification of an alternating bit protocol by means of process algebra.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Methods of Specification and Synthesis of Software Systems '85, 1985

1984

Hoare's Logic for Programming Languages with two Data Types.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

Proving Program Inclusion Using Hoare's Logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

Linear Time and Branching Time Semantics for Recursion with Merge.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

Process Algebra for Synchronous Communication

[BibT_eX]

[DOI]

Inf. Control., 1984

On Specifying Sets of Integers.

[BibT_eX]

J. Inf. Process. Cybern., 1984

The Axiomatic Semantics of Programs Based on Hoare's Logic.

[BibT_eX]

[DOI]

Acta Informatica, 1984

The Algebra of Recursively Defined Processes and the Algebra of Regular Processes.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

Process Algebra with Asynchronous Communication Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Seminar on Concurrency, 1984

1983

Hoare's Logic and Peano's Arithmetic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

A proof rule for restoring logic circuits.

[BibT_eX]

[DOI]

Integr., 1983

Initial Algebra Specifications for Parametrized Data Types.

[BibT_eX]

J. Inf. Process. Cybern., 1983

Standard Model Semantics for DSL A Data Type Specification Language.

[BibT_eX]

[DOI]

J. Terlouw

Acta Informatica, 1983

PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, 1983

Algebraic Tools for System Construction.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, 1983

1982

The Completeness of the Algebraic Specification Methods for Computable Data Types

[BibT_eX]

[DOI]

Inf. Control., September, 1982

Another Incompleteness Result for Hoare's Logic

[BibT_eX]

[DOI]

Anna Chmielinska

Inf. Control., February, 1982

Floyds Principle, Correctness Theories and Program Equivalence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Expressiveness and the Completeness of Hoare's Logic.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

Two Theorems About the Completeness of Hoare's Logic.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

A Simple Transfer Lemma for Algebraic Specifications.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

Strong Normalization and Perpetual Reductions in the Lambda Calculus.

[BibT_eX]

J. Inf. Process. Cybern., 1982

A formalized proof system for total correctness of while programs.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Programming, 1982

Formal Proof Systems for Program Equivalence.

[BibT_eX]

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

Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1982

Specification of Parameterized Data Types.

[BibT_eX]

Proceedings of the Proceedings 1st Workshop on Abstract Data Type, 1982

1981

I/O-computable data structures.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 1981

Regular extensions of iterative algebras and metric interpretations.

[BibT_eX]

Fundam. Informaticae, 1981

Algorithmic degrees of algebraic structures.

[BibT_eX]

Fundam. Informaticae, 1981

Logic of effective definitions.

[BibT_eX]

Fundam. Informaticae, 1981

On the quantifier-free fragment of 'Logic of effective definitions'.

[BibT_eX]

Fundam. Informaticae, 1981

On the Power of Algebraic Specifications.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

The Refinement of Specifications and the Stabiliy of Hoare's Logic.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

Hoare's Logic is Incomplete When It Does Not Have To Be.

[BibT_eX]

[DOI]

Anna Chmielinska

Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

Algebraically Specified Programming Systems and Hoare's Logic.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1981

A Characterization of Program Equivalence in Terms of Hoare's Logic.

[BibT_eX]

[DOI]

J. Terlouw

Proceedings of the GI, 1981

1980

Invertible Terms in the Lambda Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

Discourse between processes.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1980

A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

Church-Rosser Strategies in the Lambda Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

Recursive Assertions are not enough - or are they?

[BibT_eX]

[DOI]

Krzysztof R. Apt

Lambert G. L. T. Meertens

Theor. Comput. Sci., 1979

On the adequacy of finite equational methods for data type specification.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 1979

Effective Transformations on Probabilistic Data.

[BibT_eX]

[DOI]

Math. Log. Q., 1979

Implicit definability of algebraic structures by means of program properties.

[BibT_eX]

Proceedings of the Fundamentals of Computation Theory, 1979

1978

Degrees of partial functions.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1978

Degrees of Sensible Lambda Theories.

[BibT_eX]

[DOI]

J. Symb. Log., 1978

What is an Abstract Datatype?

[BibT_eX]

[DOI]

Inf. Process. Lett., 1978

Decision Problems Concerning Parallel Programming.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977

An Axiomatization of the Rational Data Objects.

[BibT_eX]

[DOI]