Abstract data types and software validation

Cited in

(46)

Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
Rewrite systems on a lattice of types
Termination orderings for associative-commutative rewriting systems
Data abstraction in Prolog/KR
Crypt-equivalent algebraic specifications
Proving entailment between conceptual state specifications
Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
Equational specification of partial higher-order algebras
Final algebra semantics and data type extensions
Hierarchical program specification and verification - a many-sorted logical approach
On the algebra of order
On new roles for categorical algebra
Straight-line program length as a parameter for complexity analysis
About the implementability and the power of equationally defined data abstractions
Hierarchical development of programming languages
Specifications, models, and implementations of data abstractions
Algebraic implementation of abstract data types
Graph grammars and operational semantics
A Noetherian and confluent rewrite system for idempotent semigroups
Abstract data types and algebraic semantics of programming languages
Proving programs correct through refinement
Structured theory presentations and logic representations
Swinging types=functions+relations+transition systems
Partial completion of equational theories
Approximation properties of abstract data types
Implicit induction in conditional theories
Specification and proof in membership equational logic
Unification modulo lists with reverse relation with certain word equations
From grammars and automata to algebras and coalgebras
Program testing: Specification languages and automatic test generation
scientific article; zbMATH DE number 3677217 (Why is no real title available?)
Relative complexity of algebras
scientific article; zbMATH DE number 3772918 (Why is no real title available?)
Methodical specification of abstract data types via rewriting systems
Algebraic implementation of abstract data types: a survey of concepts and new compositionality results
An overview of LP, the Larch Prover
Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
On sufficient completeness of conditional specifications
Design strategies for rewrite rules
Quantifiability: a concurrent correctness condition modeled in vector space
Using induction and rewriting to verify and complete parameterized specifications
Transformations and confluence for rewrite systems
A set-theoretic semantics for Clear
Implementation of data types by algebraic methods
On the data type extension problem for algebraic specifications
Parallel tree pattern matching

Describes a project that uses

Uses Software

REDUCE

This page was built for publication: Abstract data types and software validation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168047)