Algebraic Methodology and Software Technology 7th International Conference, AMAST'98, Amazonia, Brazil, January 4-8, 1999, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Haeberer, Armando M. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
• Έκδοση: 1st ed. 1999.
• Σειρά: Lecture Notes in Computer Science, 1548
• Θέματα: Software engineering.; Computer logic.; Mathematical logic.; Artificial intelligence.; Computer science-Mathematics.; Software Engineering/Programming and Operating Systems.; Logics and Meanings of Programs.; Software Engineering.; Mathematical Logic and Formal Languages.; Artificial Intelligence.; Symbolic and Algebraic Manipulation.

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...

Πίνακας περιεχομένων:

• Invited Talks (Extended Abstracts)
• Duration Calculus, a Logical Approach to Real-Time Systems
• Abstract Algebraic Logic
• Systematising Reactive System Design
• Systematic Design of Call-Coverage Features
• Visual Abstractions for Temporal Verification
• A Linear Metalanguage for Concurrency
• Presentations
• Verification of Bounded Delay Asynchronous Circuits with Timed Traces
• Verification of Temporal Properties of Processes in a Setting with Data
• A Logic for Real-Time Systems Specification Its Algebraic Semantics and Equational Calculus
• Effective Recognizability and Model Checking of Reactive Fiffo Automata
• Combining Methods for the Livelock Analysis of a Fault-Tolerant System
• Presentations
• Separating Sets by Modal Formulas
• Interpolation in Modal Logic
• Building Models of Linear Logic
• Term Rewriting in a Logic of Special Relations
• Abstraction Barriers in Equational Proof
• Presentations
• A Synergy Between Model-Checking and Type Inference for the Verification of Value-Passing Higher-Order Processes
• A Trace-Based Refinement Calculus for Shared-Variable Parallel Programs
• Consistency of Partial Process Specifications
• Observational Logic
• Scheduling Algebra
• Presentations
• Algebraic Semantics of Coordination or What Is in a Signature
• An Algebraic Approach to Combining Processes in a Hardware/Software Partitioning Environment
• An Algebraic View of Program Composition
• Architectural Specifications in CASL
• Pi-Congruences as CCS Equivalences
• Presentations
• Algebraic Specifications, Higher-Order Types and Set-Theoretic Models
• Type Analysis for CHIP
• Categorical Programming with Abstract Data Types
• Condensing Lemmas for Pure Type Systems with Universes
• Improving Computations in a Typed Functional Logic Language
• Presentations
• Abstract Interpretation of Prolog Programs
• Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos
• A Single Perspective on Arrows between Institutions
• On Oracles for Interpreting Test Results against Algebraic Specifications
• Systems and Tool Demonstrations
• Recopla: An Extendible Graphic Meta-Editor
• The State of PEP
• The Abaco System - An Algebraic Based Action COmpiler.