Nondeterminism in Algebraic Specifications and Algebraic Programs (Progress in Theoretical Computer Science) - Image 1

£74.15

Birkhauser Nondeterminism in Algebraic Specifications and Algebraic Programs (Progress in Theoretical Computer Science)

Name: Nondeterminism in Algebraic Specifications and Algebraic Programs (Progress in Theoretical Computer Science)
Brand: Birkhauser
Price: 49.69 GBP
Availability: InStock

Architecture & Microprocessors

Price History & Forecast

Last 84 days • 84 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 84 days • 4 price levels

Days at Price

Current Price

Price Analysis

Most common price: £74 (47 days, 56.0%)

Price range: £41 - £74

Price levels: 4 different prices over 84 days

Description

Algebraic specification, nondeterminism and term rewriting are three active research areas aiming at concepts for the abstract description of software systems: Algebraic specifications are well-suited for describing data structures and sequential software systems in an abstract way. Term rewriting methods are used in many prototyping systems and form the basis for executing specifi cations. Nondeterminism plays a major role in formal language theory; in programming it serves for delaying design decisions in program development and occurs in a "natural" way in formalisations of distributed processes. Heinrich Hussmann presents an elegant extension of equational specification and term rewriting to include nondeterminism. Based on a clean modeltheoretic semantics he considers term rewriting systems without confluence restrictions as a specification language and shows that fundamental properties such as the existence of initial models or the soundness and completeness of narrowing, the basic mechanism for executing equational specifications, can be extended to nondeterministic computations. The work of Heinrich Hussmann is an excellent contribution to Algebraic Programming; it gives a framework that admits a direct approach to program verification, is suitable for describing concurrent and distributed processes, and it can be executed as fast as Prolog.

Product Specifications

Brand: Birkhauser
Format: hardcover
ASIN: 0817637001
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 01 May 1993
Listed Since: 16 December 2006

Barcode

No barcode data available

Birkhauser Nondeterminism in Algebraic Specifications and Algebraic Programs (Progress in Theoretical Computer Science)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Computing in Horn Clause Theories: 16 (Monographs in Theoretical Computer Science. An EATCS Series, 16)

Birkhauser Semantics of Type Theory - Computer Science Book

Advanced Topics in Term Rewriting

Foundations of Algebraic Specification and Formal Software Development (Monographs in Theoretical Computer Science. An EATCS Series)

Formal Verification of Simulink/Stateflow Diagrams: A Deductive Approach

Algebraische Spezifikation: Eine Einführung

Isomorphisms of Types: from ?-calculus to information retrieval and language design (Progress in Theoretical Computer Science)

Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Springer - Specification and Verification of Multi-agent Systems

Specification and Transformation of Programs: A Formal Approach to Software Development (Monographs in Computer Science)

Software Verification Based on Game Semantics and Process Algebra: A Game Semantic Framework for Verifying Safety Properties of Open Programs

Logics of Specification Languages (Monographs in Theoretical Computer Science. An EATCS Series)

Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)

Proof And Computation II: From Proof Theory And Univalent Mathematics To Program Extraction And Verification

Automatic Verification of Sequential Infinite-State Processes: 1354 (Lecture Notes in Computer Science, 1354)

Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)

Constructive Models (Siberian School of Algebra and Logic)

Formal Methods for Software Engineering: Languages, Methods, Application Domains (Texts in Theoretical Computer Science. An EATCS Series)

A Process Algebraic Approach to Software Architecture Design

Programs as Diagrams: From Categorical Computability to Computable Categories (Theory and Applications of Computability)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Fundamentals of Algebraic Specification 1: Equations and Initial Semantics: 6 (Monographs in Theoretical Computer Science. An EATCS Series, 6)

An Introduction to Formal Language Theory (Monographs in Computer Science)

Decision Procedures: An Algorithmic Point of View (Texts in Theoretical Computer Science. An EATCS Series)