menu
{ "item_title" : "Rewriting Logic and Its Applications", "item_author" : [" Santiago Escobar "], "item_description" : "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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/31/912/903/3319129031_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Rewriting Logic and Its Applications|Santiago Escobar

Rewriting Logic and Its Applications : 10th International Workshop, Wrla 2014, Held as a Satellite Event of Etaps, Grenoble, France, April 5-6, 2014, R

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783319129037
  • ISBN-10: 3319129031
  • Publisher: Springer
  • Publish Date: November 2014
  • Dimensions: 9.21 x 6.14 x 0.65 inches
  • Shipping Weight: 0.96 pounds
  • Page Count: 297

Related Categories

You May Also Like...

    1

BAM Customer Reviews