TAPSOFT ’91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991

Luca Aceto (auth.), S. Abramsky, T. S. E. Maibaum (eds.)3540539824, 9783540539827

TAPSOFT ’91 is the Fourth International Joint Conference on Theory and Practice of Software Development. It was held in Brighton, April 8-12, 1991, and was organized by the Department of Computing, Imperial College, London. The proceedings of TAPSOFT ’91 are organized into three parts: – Colloquium on Trees in Algebra and Programming (CAAP); – Advances in Distributed Computing (ADC); – Colloquium on Combining Paradigms for Software Development (CCPSD). The first part (CAAP) is contained in Vol. 1, the other two parts constitute Vol. 2. CAAP ’91 focuses on the following topics: – Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered in the broad sense as that of sets of discrete structures and the theory of rewriting systems over them. – Application of discrete structures in computer science: syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures, complexity of algorithms and implementation aspects, proof techniques for nonnumerical algorithms, formal specifications, and visualization of structured objects. The ADC talks by distinguished invited speakers survey current developments in distributed computing, including the integration of different paradigms for concurrency, algebraic, logical and operational foundations, and applications to software engineering and formal methods. The CCPSD papers address aspects of the trend in software engineering towards unification and synthesis combining theory and practice, and merging hitherto diverse approaches.

---

Table of contents :
Full abstraction for series-parallel pomsets….Pages 1-25
On causality observed incrementally, finally….Pages 26-41
On the domain of traces and sequential composition….Pages 42-56
Compilation of pattern matching with associative-commutative functions….Pages 57-73
Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties….Pages 74-89
Algebraic graph rewriting using a single pushout….Pages 90-102
Unifying initial and loose semantics of parameterized specifications in an arbitrary institution….Pages 103-120
Non-strict don’t care algebras and specifications….Pages 121-142
Program specification and data refinement in type theory….Pages 143-168
Static analysis of linear congruence equalities among variables of a program….Pages 169-192
Simple solutions for approximate tree matching problems….Pages 193-201
The tree inclusion problem….Pages 202-214
Introducing a calculus of trees….Pages 215-240
Domains in a realizability framework….Pages 241-263
Iteration algebras extended abstract….Pages 264-274
Logic programming as hypergraph Rewriting….Pages 275-295
A fully abstract model for concurrent constraint programming….Pages 296-319
A solved form algorithm for ask and tell Herbrand constraints….Pages 320-337
A calculus of broadcasting systems….Pages 338-358
Object-based concurrency : A process calculus analysis….Pages 359-380
On the complexity of equation solving in process algebra….Pages 381-396
Comparative semantics for a real-time programming language with integration….Pages 397-411
A complete proof system for timed observations….Pages 412-440
Type inference with inequalities….Pages 441-455