Accepted Papers
Marrying Words and Trees (invited talk)
Simulation Using Orchestration (invited talk)
Liberate Computer User from Programming (invited talk)
An Algebra for Features and Feature Composition
Petri nets are dioids
Towards an Efficient Implementation of Tree Automata Completion
Calculating Invariants as Coreflexive Bisimulations
Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines
A declarative debugger for Maude
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids
Towards Validating a Platoon of Cristal Vehicles using CSP||B
Explaining Verification Conditions
Towards Formal Verification of ToolBus Scripts
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
Abstract Interpretation Plugins for Type Systems
Separation Logic Contracts for a Java-like Language with Fork/Join
Towards a Model-theoretic Semantics for Contract-based Software Components
Implementing a categorical information system
Constant complements, reversibility and universal view updates
Coinductive Properties of Causal Maps
Extending Timed Process Algebra with Discrete Stochastic Time
Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving
Evolving Specification Engineering
Verification of Java Programs with Generics
Domain Axioms for a Family of Near-Semirings
Generating specialized rules and programs for demand-driven analysis
Non expansive Epsilon-Bisimulations
A Hybrid Approach for Safe Memory Management in C
Service Specification and Matchmaking using Description Logic: An Approach Based on Institutions
System Demonstration of Spiral, Program Generator for High-Performance Libraries for Linear Transforms
The verification of the on-chip COMA cache coherence protocol |