scientific article

zbMath0641.68028MaRDI QIDQ4039815

Jeffery Zucker, J. V. Tucker

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

verificationiterationrecursion theoryabstract data typesprogram correctnessalgebraic data typescomputability over abstract structurescourse of values recursion

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Abstract and axiomatic computability and recursion theory (03D75)

Related Items

1997–98 Annual Meeting of the Association for Symbolic Logic, Stratified least fixpoint logic, Reasoning about dynamically evolving process structures, Transformations of normal and inverted function tables, Presupposition failure - a comedy of errors, Algebraic specifications of computable and semicomputable data types, A new approach to abstract data types, I Informal development, A proof system for asynchronously communicating deterministic processes, Issues in the design of a parallel object-oriented language, Verification of object-oriented programs: a transformational approach, Proving total correctness of recursive procedures, Theses for Computation and Recursion on Concrete and Abstract Structures, Generalizing Computability Theory to Abstract Algebras, Primitive recursive selection functions for existential assertions over abstract algebras, Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, A Sound and Complete Shared-Variable Concurrency Model for Multi-threaded Java Programs, An assertion-based proof system for multithreaded Java, Reasoning about Recursive Processes in Shared-Variable Concurrency, Fifty years of Hoare's logic, A Hoare logic for dynamic networks of asynchronously communicating deterministic processes, Feferman on Computability, Algebraic models of microprocessors architecture and organisation, Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms, On approximate and algebraic computability over the real numbers, Concrete models of computation for topological algebras, Computation by `While' programs on topological partial algebras, Hoare's logic for programming languages with two data types, The axiomatic semantics of programs based on Hoare's logic, Recursive tables and effective definition schemes