All About Maude - A High-Performance Logical Framework [electronic resource] :How to Specify, Program and Verify Systems in Rewriting Logic /
Contributor(s): Durán, Francisco [author.] | Eker, Steven [author.] | Lincoln, Patrick [author.] | Martí-Oliet, Narciso [author.] | Meseguer, José [author.] | Talcott, Carolyn [author.] | SpringerLink (Online service).Material type: BookSeries: Lecture Notes in Computer Science: 4350Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.Description: XXII, 802 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540719991.Subject(s): Computer science | Computer programming | Software engineering | Programming languages (Electronic computers) | Mathematical logic | Artificial intelligence | Computer Science | Programming Languages, Compilers, Interpreters | Programming Techniques | Software Engineering | Artificial Intelligence (incl. Robotics) | Mathematical Logic and Formal LanguagesOnline resources: Click here to access online
I: Core Maude -- Using Maude -- Syntax and Basic Parsing -- Functional Modules -- A Hierarchy of Data Types: From Trees to Sets -- System Modules -- Playing with Maude -- Module Operations -- Predefined Data Modules -- Specifying Parameterized Data Structures in Maude -- Object-Based Programming -- Model Checking Invariants Through Search -- LTL Model Checking -- Reflection, Metalevel Computation, and Strategies -- Metaprogramming Applications -- Mobile Maude -- User Interfaces and Metalanguage Applications -- II: Full Maude -- Full Maude: Extending Core Maude -- Object-Oriented Modules -- III: Applications and Tools -- A Sampler of Application Areas -- Some Tools -- IV: Reference -- Debugging and Troubleshooting -- Complete List of Maude Commands -- Core Maude Grammar.
This book gives a comprehensive account of Maude, a language and system based on rewriting logic. Many examples are used throughout the book to illustrate the main ideas and features of Maude, and its many possible uses. Maude modules are rewrite theories. Computation with such modules is - cient deduction by rewriting. Because of its logical basis and its initial model semantics,aMaudemodulede?nesaprecisemathematicalmodel.Thismeans that Maude and its formal tool environment can be used in three, mutually reinforcing ways: • as a declarative programming language; • as an executable formal speci?cation language; and • as a formal veri?cation system. Maude’s rewriting logic is simple, yet very expressive. This gives Maude good representational capabilities as a semantic framework to formally represent a wide range of systems, including models of concurrency, distributed al- rithms, network protocols, semantics of programming languages, and models of cell biology. Rewriting logic is also an expressive universal logic,making Maude a ?exible logical framework in which many di?erent logics and - ference systems can be represented and mechanized. This makes Maude a useful metatool to build many other tools, including those in its own formal tool environment. Thanks to the logic’s simplicity and the use of advanced semi-compilation techniques, Maude has a high-performance implementation, making it competitive with other declarative programming languages.