Rewriting Logic and Its Applications (eBook, PDF)

10th International Workshop, WRLA 2014, Held as a Satellite Event of ETAPS, Grenoble, France, April 5-6, 2014, Revised Selected Papers
Redaktion: Escobar, Santiago

• Format: PDF

Produktbeschreibung

This book constitutes the thoroughly refereed post-workshop proceedings of the 10th International Workshop on Rewriting Logic and its Applications, WRLA 2014, held as a satellite event of ETAPS 2014, in Grenoble, France, in March 2014.

The 13 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 21 submissions. The papers address a great diversity of topics in the fields of foundations and models of RL; languages based on RL; RL as a logical framework; RL as a semantic framework; use of RL to provide rigorous support for model-based software engineering; formalisms related to RL; verification techniques for RL specifications; comparisons of RL with existing formalisms having analogous aims; application of RL to specification and analysis of distributed systems and physical systems.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer-Verlag GmbH
• Seitenzahl: 297
• Erscheinungstermin: 15. November 2014
• Englisch
• ISBN-13: 9783319129044
• Artikelnr.: 43796676

Inhaltsangabe

Composition of Graph-Transformation-Based DSL Definitions by Amalgamation.- Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude.- Real-Time Maude and Its Applications.- Conditional Narrowing Modulo in Rewriting Logic and Maude.- Language Definitions as Rewrite Theories.- Infinite-State Model Checking of LTLR Formulas Using Narrowing.- Modelling and Verifying Contract-Oriented Systems in Maude.- Towards Static Analysis of Functional Programs Using Tree Automata Completion.- Framework for Mobile Ad hoc Networks in Real-Time Maude.- Strong and Weak Operational Termination of Order-Sorted Rewrite Theories.- 2D Dependency Pairs for Proving Operational Termination of CTRSs.- FunKons: Component-Based Semantics in K.- An Integration of CafeOBJ into Full Maude.- Rewriting Modulo SMT and Open System Analysis.- Formal Specification of Button-Related Fault-Tolerance Micropatterns.- A Formal Semantics of the OSEK/VDX Standard in K Framework and Its Applications.