Page 24
Page 24
A Practical Introduction to PSL
Practical Introduction to PSL is primarily targeted to hardware designers and verification engineers who plan to use PSL. This book is also of interest to students of temporal logic. The formal semantics of PSL are included as an appendix, and bibliographical notes include pointers to some of the main theoretical works.
A Modular Calculus for the Average Cost of Data Structuring
This volume, with forewords by Greg Bollella and Dana Scott, presents novel programs based on the new advances in this area, including the first randomness-preserving version of Heapsort. Programs are provided, along with derivations of their average-case time, to illustrate the radically different approach to average-case timing. The automated static timing tool applies the Modular Calculus to extract the average-case running time of programs directly from their MOQA code.
A High-Performance Logical Framework -- All About Maude : How to Specify, Program, and Verify Systems in Rewriting Logic
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,aMaude module defines a precise mathematical model.This means that Maude and its formal tool environment can be used in three, mutually reinforcing ways: • as a declarative programming language; • as an executable formal specification language; and • as a formal verification 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 fiexible logical framework in which many difierent 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.
A Concise Introduction to Languages and Machines
This easy-to-follow text provides an accessible introduction to the key topics of formal languages and abstract machines within Computer Science.
A Computational Model of Natural Language Communication : Interpretation, Inference, and Production in Database Semantics
Presents a high-level description of an artificial agent which humans can freely communicate with in their accustomed language. Part II analyzes the major constructions of natural language, i.e., intra- and extrapropositional functor - argument structure, coordination, and coreference, in the speaker and the hearer mode. Part III defines declarative specifications for fragments of English, which are used for an implementation in Java.
