## Algebraic Methodology and Software Technology: 4th International Conference, AMAST '95, Montreal, Canada, July 3-7, 1995. ProceedingsThis volume constitutes the proceedings of the 4th International Conference on Algebraic Methodology and Software Technology, held in Montreal, Canada in July 1995. It includes full papers or extended abstracts of the invited talks, refereed selected contributions, and research prototype tools. The invited speakers are David Gries, Jeanette Wing, Dan Craigen, Ted Ralston, Ewa Orlowska, Krzysztof Apt, Joseph Goguen, and Rohit Parikh. The 29 refereed papers presented were selected from some 100 submissions; they are organized in sections on algebraic and logical foundations, concurrent and reactive systems, software technology, logic programming and databases. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Equational Logic as a Tool | 1 |

Teaching Mathematics to Software Engineers | 18 |

The Role of Education and Training in the Industrial Application of Formal Methods | 41 |

Information Algebras | 50 |

Verification of Logic Programs with Delay Declarations | 66 |

An Introduction to CategoryBased Equational Logic | 91 |

KnowledgeBased Computation Extended Abstract | 127 |

Ordersorted Algebraic Specifications with Higherorder Functions | 133 |

CPO models for infinite Term rewriting | 368 |

Completeness Results for TwoSorted Metric Temporal Logics | 385 |

On Mechanizing Proofs within a Complete Proof System for Unity | 400 |

Automated Reasoning about Parallel Algorithms using Powerlists | 416 |

Representing Verifying and Applying Software Development Steps using the PVS System | 431 |

An Algebraic Development Technique for Information Systems | 446 |

A Framework for MachineAssisted User Interface Verification | 461 |

A Comparative Case Study | 475 |

Proving the Correctness of Behavioural Implementations | 152 |

On the Decidability of Process Equivalences for the 𝜋calculus | 169 |

Detecting Isomorphisms of Modular Specifications with Diagrams | 184 |

HigherOrder Narrowing with Convergent Systems | 199 |

ContextFree Event Domains are Recognizable | 214 |

Encoding Natural Semantics in Coq | 230 |

Mongruences and Cofree Coalgebras | 245 |

Semantic Typing for Parametric Algebraic Specifications | 261 |

A Dataflow Analysis of the PiCalculus Extended Abstract | 277 |

Verification in Continuous Time by Discrete Reasoning | 292 |

Dynamic Matrices and the Cost Analysis of Concurrent Programs | 307 |

Petri Nets Traces and Local Model Checking | 322 |

An Algebraic Framework for Developing and Maintaining RealTime Systems | 338 |

Logical Foundations for Compositional Verification and Development of Concurrent Programs in UNITY | 353 |

A Calculus of Countable Broadcasting Systems | 489 |

Symbolic Timing Devices | 504 |

An Algebraic Construction of the WellFounded Model | 518 |

Confluence in Concurrent Constraint Programming | 531 |

A Generic Algebra for Data Collections Based on Constructive Logic | 546 |

Partial Order Programming Revisited | 561 |

576 | |

Knowledge Based Evolutionary System Synthesis | 578 |

An ObjectOriented Frontend for Deductive Databases | 581 |

The SuRE Programming Framework | 585 |

A Declarative System for MultiDatabase Interoperability | 586 |

The METAGEN System | 590 |

### Common terms and phrases

2-category abstract agent algebraic specification algorithm application atom axiomatization axioms behavioural binary binary relation bisimulation calculus clause coalgebra colimits component Computer Science concurrent congruence congruence relation consider constraint construction constructor context database deduction defined Definition delay declarations denoted derivation DIAGR diagram dynamic matrix elements encoding equational logic equivalence event domain example expression finite forgetful functor formal methods formula function functor given graph higher-order implementation induction inference rules initial algebra input interpretation isomorphic language leadsto Lemma logic programming natural transformation notation notion object operational semantics operators order-sorted Orlog paraconsistent relation parallel paramodulation PI-CALCULUS pomset powerlists predicate problem process algebra proof system properties Proposition prove query reachable recursive result rewriting satisfies semantics sequence signature SLD-derivations sort structure subgoals subset symbols syntax temporal logic Theorem theory timer transformation transition user interface variables