Algebraic Methodology and Software Technology: 7th International Conference, AMAST’98 Amazonia, Brazil, January 4–8, 1999 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

AMAST’s goal is to advance awareness of algebraic and logical methodology as part of the fundamental basis of software technology. Ten years and seven conferences after the start of the AMAST movement, I believe we are attaining this. The movement has propagated throughout the world, assembling many enthusiastic specialists who have participated not only in the conferences, which are now annual, but also in the innumerable other activities that AMAST promotes and supports. We are now facing the Seventh International Conference on Algebraic Methodology and Software Technology (AMAST’98). The previous meetings were held in Iowa City, USA (1989 and 1991), in Enschede, The Netherlands (1993), in Montreal, Canada (1995), in Munich, Germany (1996), and in Sydney, Australia (1997). This time it is Brazil’s turn, in a very special part of this colorful country – Amazonia. Thus, “if we have done more it is by standing on the shoulders of giants.” The effort started by Teodor Rus, Arthur Fleck, and William A. Kirk at AMAST’89 was consolidated in AMAST'91 by Teodor Rus, Maurice Nivat, Charles Rattray, and Giuseppe Scollo. Then came modular construction of the building, wonderfully carried out by Giuseppe Scollo, Vangalur Alagar, Martin Wirsing, and Michael Johnson, as Program Chairs of the AMAST conferences held between 1993 and 1997.

Author(s): Zhou Chaochen (auth.), Armando M. Haeberer (eds.)
Series: Lecture Notes in Computer Science 1548
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1999

Language: English
Pages: 540
Tags: Logics and Meanings of Programs; Software Engineering; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics); Symbolic and Algebraic Manipulation

Duration Calculus, a Logical Approach to Real-Time Systems....Pages 1-7
Abstract Algebraic Logic....Pages 8-16
Systematising Reactive System Design....Pages 17-22
Systematic Design of Call-Coverage Features....Pages 23-27
Visual Abstractions for Temporal Verification....Pages 28-41
A Linear Metalanguage for Concurrency....Pages 42-58
Verification of Bounded Delay Asynchronous Circuits with Timed Traces....Pages 59-73
Verification of Temporal Properties of Processes in a Setting with Data....Pages 74-90
A Logic for Real-Time Systems Specification Its Algebraic Semantics and Equational Calculus....Pages 91-105
Effective Recognizability and Model Checking of Reactive Fiffo Automata....Pages 106-123
Combining Methods for the Livelock Analysis of a Fault-Tolerant System....Pages 124-139
Separating Sets by Modal Formulas....Pages 140-153
Interpolation in Modal Logic....Pages 154-163
Building Models of Linear Logic....Pages 164-177
Term Rewriting in a Logic of Special Relations....Pages 178-195
Abstraction Barriers in Equational Proof....Pages 196-213
A Synergy Between Model-Checking and Type Inference for the Verification of Value-Passing Higher-Order Processes....Pages 214-230
A Trace-Based Refinement Calculus for Shared-Variable Parallel Programs....Pages 231-247
Consistency of Partial Process Specifications....Pages 248-262
Observational Logic....Pages 263-277
Scheduling Algebra....Pages 278-292
Algebraic Semantics of Coordination or What Is in a Signature....Pages 293-307
An Algebraic Approach to Combining Processes in a Hardware/Software Partitioning Environment....Pages 308-324
An Algebraic View of Program Composition....Pages 325-340
Architectural Specifications in CASL....Pages 341-357
Pi-Congruences as CCS Equivalences....Pages 358-372
Algebraic Specifications, Higher-Order Types and Set-Theoretic Models....Pages 373-388
Type Analysis for CHIP....Pages 389-405
Categorical Programming with Abstract Data Types....Pages 406-421
Condensing Lemmas for Pure Type Systems with Universes....Pages 422-437
Improving Computations in a Typed Functional Logic Language....Pages 438-454
Abstract Interpretation of Prolog Programs....Pages 455-470
Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos ....Pages 471-485
A Single Perspective on Arrows between Institutions....Pages 486-501
On Oracles for Interpreting Test Results against Algebraic Specifications....Pages 502-518
Recopla : An Extendible Graphic Meta-Editor....Pages 519-521
The State of PEP....Pages 522-526
The Abaco System — An Algebraic Based Action COmpiler....Pages 527-529