Efficient Graph Rewriting and Its Implementation, Heiko D?rr

Автор: Lucanu
Название: Rewriting Logic and Its Applications
ISBN: 3319448013 ISBN-13(EAN): 9783319448015
Издательство: Springer
Рейтинг:
Цена: 6988.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the thoroughly refereed post-workshop proceedings of the 11th International Workshop on Rewriting Logic and its Applications, WRLA 2016, held as a satellite event of ETAPS 2016, in Eindhoven, The Netherlands, in April 2016.The 8 revised full papers presented together with 2 invited papers and 3 abstracts were carefully reviewed and selected from 14 submissions. The papers cover several topics such as: foundations; rewriting as a logical and semantic framework; rewriting languages; verification techniques; and applications.

Автор: Santiago Escobar
Название: Rewriting Logic and Its Applications
ISBN: 3319129031 ISBN-13(EAN): 9783319129037
Издательство: Springer
Рейтинг:
Цена: 6708.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

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.

Автор: Terese
Название: Term Rewriting Systems
ISBN: 0521391156 ISBN-13(EAN): 9780521391153
Издательство: Cambridge Academ
Рейтинг:
Цена: 32155.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A comprehensive 2003 treatment of term rewriting systems from an elementary to an advanced level. Much of this material appeared here for the first time in book form. Ideal for teaching or research, it features numerous exercises with selected solutions on the web, an extensive bibliography and a chapter on applications.

Автор: Baader
Название: Term Rewriting and All That
ISBN: 0521779200 ISBN-13(EAN): 9780521779203
Издательство: Cambridge Academ
Рейтинг:
Цена: 8395.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This is a unified and self-contained introduction to term rewriting that can be used for advanced undergraduate courses or as a professional reference. The main algorithms are presented both informally and as ML programs. Many examples and over 170 exercises are provided.

Автор: Ralf Treinen
Название: Rewriting Techniques and Applications
ISBN: 3642023479 ISBN-13(EAN): 9783642023477
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the 20th International Conference on Rewriting Techniques and Applications, RTA 2009, held in Brasilia, Brazil, during June 29 - July 1, 2009. This work covers research on various aspects of rewriting including typical areas of interest such as applications, foundational issues, frameworks and semantics.

Автор: Gilles Dowek
Название: Rewriting and Typed Lambda Calculi
ISBN: 331908917X ISBN-13(EAN): 9783319089171
Издательство: Springer
Рейтинг:
Цена: 10062.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the Joint 25th International Conference on Rewriting Techniques and Applications, RTA 2014, and 12th International Conference on Typed Lambda-Calculi and Applications, TLCA 2014, held as part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014.

Автор: Narciso Mart?-Oliet; Peter Csaba ?lveczky; Carolyn
Название: Logic, Rewriting, and Concurrency
ISBN: 3319231642 ISBN-13(EAN): 9783319231648
Издательство: Springer
Рейтинг:
Цена: 11180.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This Festschrift volume contains 28 refereed papers including personal memories, essays, and regular research papers by close collaborators and friends of Jose Meseguer to honor him on the occasion of his 65th birthday.

Автор: Gilles Dowek; Jan Heering; Karl Meinke; Bernhard M
Название: Higher-Order Algebra, Logic, and Term Rewriting
ISBN: 3540612548 ISBN-13(EAN): 9783540612544
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Presenting 14 papers from the Second International Workshop on Higher-Order Algebra, Logic and Term-Rewriting, this work reports on the state of the art, addressing relevant theoretical aspects and discussing existing proof systems and term rewriting systems.

Автор: J?rgen Dassow; Gheorghe Paun
Название: Regulated Rewriting in Formal Language Theory
ISBN: 3642749348 ISBN-13(EAN): 9783642749346
Издательство: Springer
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: To our families The formal language theory was born in the middle of our century as a tool for modelling and investigating the syntax of natural languages, and it has been developed mainly in connection with programming language handling.

Автор: Kia Manouchehri; Jingbo Wang
Название: Physical Implementation of Quantum Walks
ISBN: 3642447090 ISBN-13(EAN): 9783642447099
Издательство: Springer
Рейтинг:
Цена: 14365.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: In light of recent explorations of their non-intuitive dynamics, this book presents proposals as well as actual experiments on how quantum walks can be implemented in the laboratory, underpinned by a range of quantum, classical and hybrid technologies.

Автор: Frank Drewes
Название: Implementation and Application of Automata
ISBN: 3319223593 ISBN-13(EAN): 9783319223599
Издательство: Springer
Рейтинг:
Цена: 7826.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 20th International Conference on Implementation and Application of Automata, CIAA 2015, held in held in Ume , Sweden, in August 2015.
The 22 revised full papers presented together with 4 invited papers and 2 toool demonstration papers were carefully reviewed and selected from 49 submissions. The papers cover all aspects of cover automata, counter automata, decision algorithms on automata, descriptional complexity, expressive power of automata, homing sequences, jumping finite automata, multi-dimensional languages, parsing and pattern matching, quantum automata, realtime pushdown automata, random generation of automata, regular expressions, security issues, sensors in automata, transducers, transformation of automata, and weighted automata.

Автор: Markus Holzer; Martin Kutrib
Название: Implementation and Application of Automata
ISBN: 3319088459 ISBN-13(EAN): 9783319088457
Издательство: Springer
Рейтинг:
Цена: 7826.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

FPsolve: A Generic Solver for Fixpoint Equations over Semirings.- Restarting Automata for Picture Languages: A Survey on Recent Developments.- Investigations on Automata and Languages over a Unary Alphabet.- Cellular Automata for Crowd Dynamics.- Counting Equivalent Linear Finite Transducers Using a Canonical Form.- On the Power of One-Way Automata with Quantum and Classical States.- On Comparing Deterministic Finite Automata and the Shuffle of Words.- Minimal Partial Languages and Automata.- Large Aperiodic Semigroups.- On the Square of Regular Languages.- Unary Languages Recognized by Two-Way One-Counter Automata.- A Type System for Weighted Automata and Rational Expressions.- Bounded Prefix-Suffix Duplication.- Recognition of Labeled Multidigraphs by Spanning Tree Automata.- Reset Thresholds of Automata with Two Cycle Lengths.- On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers.- Kleene Closure on Regular and Prefix-Free Languages.- Left is Better than Right for Reducing Nondeterminism of NFAs.- Analytic Functions Computable by Finite State Transducers.- Partial Derivative and Position Bisimilarity Automata.- The Power of Regularity-Preserving Multi Bottom-up Tree Transducers.- Pushdown Machines for Weighted Context-Free Tree Translation.- Weighted Variable Automata over Infinite Alphabets.- Implications of Quantum Automata for Contextuality.- Pairwise Rational Kernels Obtained by Automaton Operations.