12. AMAST 2008: Urbana, IL, USA

• Rajeev Alur:
  Marrying Words and Trees. 1
  
• David Kitchin, Evan Powell, Jayadev Misra:
  Simulation Using Orchestration. 2-15
  
• Teodor Rus:
  Liberate Computer User from Programming. 16-35
  
• Sven Apel, Christian Lengauer, Bernhard Möller, Christian Kästner:
  An Algebra for Features and Feature Composition. 36-50
  
• Paolo Baldan, Fabio Gadducci:
  Petri Nets Are Dioids. 51-66
  
• Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau:
  Towards an Efficient Implementation of Tree Automata Completion. 67-82
  
• Luís Soares Barbosa, José Nuno Oliveira, Alexandra Silva:
  Calculating Invariants as Coreflexive Bisimulations. 83-99
  
• Roberto Bruni, Leonardo Gaetano Mezzina:
  Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines. 100-115
  
• Adrián Riesco, Alberto Verdejo, Narciso Martí-Oliet, Rafael Caballero:
  A Declarative Debugger for Maude. 116-121
  
• David Cachera, Thomas P. Jensen, Arnaud Jobin, Pascal Sotin:
  Long-Run Cost Analysis by Approximation of Linear Operators over Dioids. 122-138
  
• Samuel Colin, Arnaud Lanoix, Olga Kouchnarenko, Jeanine Souquières:
  Towards Validating a Platoon of Cristal Vehicles Using CSP||B. 139-144
  
• Ewen Denney, Bernd Fischer:
  Explaining Verification Conditions. 145-159
  
• Wan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. Usenko:
  Towards Formal Verification of ToolBusScripts. 160-166
  
• Han Gao, Chiara Bodei, Pierpaolo Degano:
  A Formal Analysis of Complex Type Flaw Attacks on Security Protocols. 167-183
  
• Tobias Gedell, Daniel Hedin:
  Abstract Interpretation Plugins for Type Systems. 184-198
  
• Christian Haack, Clément Hurlin:
  Separation Logic Contracts for a Java-Like Language with Fork/Join. 199-215
  
• Michel Bidoit, Rolf Hennicker:
  An Algebraic Semantics for Contract-Based Software Components. 216-231
  
• Michael Johnson, Robert D. Rosebrugh:
  Implementing a Categorical Information System. 232-237
  
• Michael Johnson, Robert D. Rosebrugh:
  Constant Complements, Reversibility and Universal View Updates. 238-252
  
• Jiho Kim:
  Coinductive Properties of Causal Maps. 253-267
  
• Jasen Markovski, Erik P. de Vink:
  Extending Timed Process Algebra with Discrete Stochastic Time. 268-283
  
• Stefan Maus, Michal Moskal, Wolfram Schulte:
  Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving. 284-298
  
• Dusko Pavlovic, Peter Pepper, Douglas R. Smith:
  Evolving Specification Engineering. 299-314
  
• Kurt Stenzel, Holger Grandy, Wolfgang Reif:
  Verification of Java Programs with Generics. 315-329
  
• Jules Desharnais, Georg Struth:
  Domain Axioms for a Family of Near-Semirings. 330-345
  
• K. Tuncay Tekle, Katia Hristova, Yanhong A. Liu:
  Generating Specialized Rules and Programs for Demand-Driven Analysis. 346-361
  
• Simone Tini:
  Non Expansive epsilon-Bisimulations. 362-376
  
• Syrine Tlili, Zhenrong Yang, Hai Zhou Ling, Mourad Debbabi:
  A Hybrid Approach for Safe Memory Management in C. 377-391
  
• M. Birna van Riemsdijk, Rolf Hennicker, Martin Wirsing, Andreas Schroeder:
  Service Specification and Matchmaking Using Description Logic. 392-406
  
• Yevgen Voronenko, Franz Franchetti, Frédéric de Mesmay, Markus Püschel:
  System Demonstration of Spiral: Generator for High-Performance Linear Transform Libraries. 407-412
  
• Thuy Duong Vu, Li Zhang, Chris R. Jesshope:
  The Verification of the On-Chip COMA Cache Coherence Protocol. 413-429