default search action
WRLA 2012: Tallinn, Estonia (Satellite Event of ETAPS 2012)
- Francisco Durán:
Rewriting Logic and Its Applications - 9th International Workshop, WRLA 2012, Held as a Satellite Event of ETAPS, Tallinn, Estonia, March 24-25, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7571, Springer 2012, ISBN 978-3-642-34004-8 - Ananda Basu, Saddek Bensalem, Marius Bozga, Joseph Sifakis:
Rigorous Component-Based System Design - (Invited Paper). 1-9 - Mark Hills, Paul Klint, Jurgen J. Vinju:
Program Analysis Scenarios in Rascal. 10-30 - Dorel Lucanu, Traian-Florin Serbanuta, Grigore Rosu:
K Framework Distilled. 31-53 - Martin Wirsing, Jonas Eckhardt, Tobias Mühlbauer, José Meseguer:
Design and Analysis of Cloud-Based Architectures with KLAIM and Maude. 54-82 - Andrei Arusoaie, Traian-Florin Serbanuta, Chucky Ellison, Grigore Rosu:
Making Maude Definitions More Interactive. 83-98 - Kyungmin Bae, José Meseguer:
Model Checking LTLR Formulas under Localized Fairness. 99-117 - Roberto Bruni, Andrea Corradini, Fabio Gadducci, Alberto Lluch-Lafuente, Andrea Vandin:
Modelling and Analyzing Adaptive Self-assembly Strategies with Maude. 118-138 - Muhammad Fadlisyah, Peter Csaba Ölveczky, Erika Ábrahám:
Formal Modeling and Analysis of Human Body Exposure to Extreme Heat in HI-Maude. 139-161 - Raúl Gutiérrez, José Meseguer, Camilo Rocha:
Order-Sorted Equality Enrichments Modulo Axioms. 162-181 - Daniela Lepri, Erika Ábrahám, Peter Csaba Ölveczky:
Timed CTL Model Checking in Real-Time Maude. 182-200 - Adrián Riesco:
Using Narrowing to Test Maude Specifications. 201-220 - Elena Tushkanova, Alain Giorgetti, Christophe Ringeissen, Olga Kouchnarenko:
A Rule-Based Framework for Building Superposition-Based Decision Procedures. 221-239
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.