Algebraic Methodology and Software Technology: 12th International Conference, AMAST 2008 Urbana, IL, USA, July 28-31, 2008, ProceedingsJosé Meseguer, Grigore Rosu This book constitutes the refereed proceedings of the 12th International Conference on Algebraic Methodology and Software Technology, AMAST 2008, held in Urbana, IL, USA, in July 2008. The 28 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 58 submissions. Among the topics covered are all current issues in formal methods related to algebraic and logical foundations, software technology, and to programming methodology including concurrent and reactive systems, evolutionary software/adaptive systems, logic and functional programming, object paradigms, constraint programming and concurrency, program verification and transformation, programming calculi, specification languages and tools, formal specification and development case studies, logic, category theory, relation algebra, computational algebra, algebraic foundations for languages and systems, coinduction, theorem proving and logical frameworks for reasoning, logics of programs, as well as algebra and coalgebra. |
Contents
| 1 | |
| 2 | |
| 16 | |
An Algebra for Features and Feature Composition | 36 |
Petri Nets Are Dioids | 51 |
Towards an Efficient Implementation of Tree Automata Completion | 67 |
Calculating Invariants as Coreflexive Bisimulations | 83 |
Types and Deadlock Freedom in a Calculus of Services Sessions and Pipelines | 100 |
Implementing a Categorical Information System | 232 |
Constant Complements Reversibility and Universal View Updates | 238 |
Coinductive Properties of Causal Maps | 253 |
Extending Timed Process Algebra with Discrete Stochastic Time | 268 |
x86 Assembler Simulated in C Powered by Automated Theorem Proving | 284 |
Evolving Specification Engineering | 299 |
Verification of Java Programs with Generics | 315 |
Domain Axioms for a Family of NearSemirings | 330 |
A Declarative Debugger for Maude | 116 |
LongRun Cost Analysis by Approximation of Linear Operators over Dioids | 122 |
Towards Validating a Platoon of Cristal VehiclesUsing CSPB | 139 |
Explaining Verification Conditions | 145 |
Towards Formal Verification of sc ToolBus Scripts | 160 |
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols | 167 |
Abstract Interpretation Plugins for Type Systems | 184 |
Separation Logic Contracts for a JavaLike Language with ForkJoin | 199 |
An Algebraic Semantics for ContractBased Software Components | 216 |
Generating Specialized Rules and Programs for DemandDriven Analysis | 346 |
Non Expansive epsilonBisimulations | 362 |
A Hybrid Approach for Safe Memory Management in C | 377 |
Service Specification and Matchmaking Using Description Logic | 392 |
Generator for HighPerformance Linear Transform Libraries | 407 |
The Verification of the OnChip COMA Cache Coherence Protocol | 413 |
| 430 | |
Other editions - View all
Common terms and phrases
abstract abstract interpretation algorithm AMAST analysis annotations approach automata axioms bisimulation Boolean Boolean domain cache called causal coalgebra codomain component composition concatenable constraints curMess.loc database Datalog defined definition denote description logic dioid domain dynamic e-bisimulation environment evaluation example execution expression feature formal formal verification function Heidelberg Hypervisor idempotent implementation input integers interface introduction invariant Java Kleene algebras labels language LNCS mCRL2 memory Meseguer method morphism Mreq near-semiring node non-deterministic processes ontology operation operational semantics parameterized parameters Petri net plugin pointer postcondition predicate probabilistic problem Proc process algebra processor proof properties protocol query recursive refinement relation represent result rewrite rules Section semantics semiring session SHOIN+ signature specification Springer static stochastic delay structure Theorem Timbuk tion transition Tscript type system update variables verification