Pages that link to "Item:Q4168047"
From MaRDI portal
The following pages link to Abstract data types and software validation (Q4168047):
Displaying 46 items.
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Transformations and confluence for rewrite systems (Q672232) (← links)
- A set-theoretic semantics for Clear (Q791329) (← links)
- Implementation of data types by algebraic methods (Q792753) (← links)
- On the data type extension problem for algebraic specifications (Q801668) (← links)
- Parallel tree pattern matching (Q912610) (← links)
- Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories (Q1059404) (← links)
- Rewrite systems on a lattice of types (Q1064065) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- Data abstraction in Prolog/KR (Q1077922) (← links)
- Crypt-equivalent algebraic specifications (Q1095646) (← links)
- Proving entailment between conceptual state specifications (Q1095649) (← links)
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study (Q1100879) (← links)
- Equational specification of partial higher-order algebras (Q1102736) (← links)
- Final algebra semantics and data type extensions (Q1131834) (← links)
- Hierarchical program specification and verification - a many-sorted logical approach (Q1138904) (← links)
- On the algebra of order (Q1143782) (← links)
- On new roles for categorical algebra (Q1145206) (← links)
- Straight-line program length as a parameter for complexity analysis (Q1151750) (← links)
- About the implementability and the power of equationally defined data abstractions (Q1157900) (← links)
- Hierarchical development of programming languages (Q1161053) (← links)
- Specifications, models, and implementations of data abstractions (Q1161277) (← links)
- Algebraic implementation of abstract data types (Q1163361) (← links)
- Graph grammars and operational semantics (Q1165029) (← links)
- A Noetherian and confluent rewrite system for idempotent semigroups (Q1168754) (← links)
- Abstract data types and algebraic semantics of programming languages (Q1171877) (← links)
- Proving programs correct through refinement (Q1242447) (← links)
- Structured theory presentations and logic representations (Q1326777) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Partial completion of equational theories (Q1592635) (← links)
- Approximation properties of abstract data types (Q1838281) (← links)
- Implicit induction in conditional theories (Q1891255) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Unification modulo lists with reverse relation with certain word equations (Q2305403) (← links)
- From Grammars and Automata to Algebras and Coalgebras (Q3014929) (← links)
- Program testing: Specification languages and automatic test generation (Q3741023) (← links)
- (Q3873558) (← links)
- Relative complexity of algebras (Q3928239) (← links)
- (Q3953140) (← links)
- Methodical specification of abstract data types via rewriting systems (Q4745236) (← links)
- Algebraic implementation of abstract data types: a survey of concepts and new compositionality results (Q4882492) (← links)
- An overview of LP, the Larch Prover (Q5055717) (← links)
- On sufficient completeness of conditional specifications (Q5881283) (← links)
- Design strategies for rewrite rules (Q5881289) (← links)
- Quantifiability: a concurrent correctness condition modeled in vector space (Q6161035) (← links)
