On the public citation graph
The algebraic specification of abstract data types
0 signed · 479 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-5979-4_4openalex-snapshot
Abstraction and Verification in Alphard: Introduction to Language and Methodology
inferredcites →https://doi.org/10.1007/978-3-642-59412-0_24openalex-snapshot
Proof of Correctness of Data Representations
inferredcites →https://doi.org/10.1007/bf00288745openalex-snapshot
The verification and synthesis of data structures
inferredcites →https://doi.org/10.1007/bf00289504openalex-snapshot
An axiomatic definition of the programming language PASCAL
inferredcites →https://doi.org/10.1007/bf01565439openalex-snapshot
General recursive functions of natural numbers
inferredcites →https://doi.org/10.1007/bf01932672openalex-snapshot
An experiment in structured programming
inferredcites →https://doi.org/10.1090/s0002-9947-1936-1501858-0openalex-snapshot
Some properties of conversion
inferredcites →https://doi.org/10.1145/321738.321750openalex-snapshot
Tree-Manipulating Systems and Church-Rosser Theorems
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/355602.361309openalex-snapshot
A technique for software module specification with examples
inferredcites →https://doi.org/10.1145/359605.359618openalex-snapshot
Abstract data types and the development of data structures
inferredcites →https://doi.org/10.1145/359657.359666openalex-snapshot
Abstract data types and software validation
inferredcites →https://doi.org/10.1145/800233.807045openalex-snapshot
Programming with abstract data types
inferredcites →https://doi.org/10.1145/942572.807045openalex-snapshot
Programming with abstract data types
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asi.4630310102openalex-snapshot
Information system design methodology
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1981.tb00246.xopenalex-snapshot
Program Development by Stepwise Refinement and Related Topics
inferred← citeshttps://doi.org/10.1002/smr.4360030205openalex-snapshot
Window user interfaces and software maintenance
inferred← citeshttps://doi.org/10.1002/spe.4380120505openalex-snapshot
Specifications: Formal and informal—a case study
inferred← citeshttps://doi.org/10.1002/spe.4380170806openalex-snapshot
A portable implementation of a modular multiprocessing database programming language
inferred← citeshttps://doi.org/10.1002/spe.4380171106openalex-snapshot
Synthesizing implementations of abstract data types from axiomatic specifications
inferred← citeshttps://doi.org/10.1002/spe.4380190204openalex-snapshot
Practical interface specification
inferred← citeshttps://doi.org/10.1002/spe.649openalex-snapshot
Model variables: cleanly supporting abstraction in design by contract
inferred← citeshttps://doi.org/10.1002/stvr.1598openalex-snapshot
Exhaustive test sets for algebraic specifications
inferred← citeshttps://doi.org/10.1002/stvr.4370050104openalex-snapshot
Algebraic specifications and sequencing: A defect detection method
inferred← citeshttps://doi.org/10.1006/inco.1994.1001openalex-snapshot
Decidability of the Existential Theory of Infinite Terms with Subterm Relation
inferred← citeshttps://doi.org/10.1007/0-387-21551-4_5openalex-snapshot
Verification of the cryptlib Kernel
inferred← citeshttps://doi.org/10.1007/11814771_14openalex-snapshot
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
inferred← citeshttps://doi.org/10.1007/11814771_50openalex-snapshot
Consistency and Completeness of Rewriting in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1007/3-540-09519-5_97openalex-snapshot
Extending interlisp for modularization and efficiency
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_3openalex-snapshot
Types algebriques et semantique des langages de programmation
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_4openalex-snapshot
Towards a theory of abstract data types: A discussion on problems and tools
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_8openalex-snapshot
A case study of abstract implementations and their correctness
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_68openalex-snapshot
Parameterized data types in algebraic specification languages
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_39openalex-snapshot
An introduction to data algebras
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_41openalex-snapshot
The semantics of clear, a specification language
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_5openalex-snapshot
Program synthesis from incomplete specifications
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_101openalex-snapshot
On the algebraic extensions of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_57openalex-snapshot
Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_11openalex-snapshot
Algorithmic specifications of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_19openalex-snapshot
Tuning algebraic specifications by type merging
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_6openalex-snapshot
Perluette : A compilers producing system using abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-11607-9_10openalex-snapshot
Rewrite rule theory and abstract data type analysis
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_39openalex-snapshot
Un systeme d'aide a la preuve de compilateurs
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_4openalex-snapshot
A basic Abstract Semantic Algebra
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_62openalex-snapshot
Logical specification and implementation
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_12openalex-snapshot
A rewrite rule based approach for synthesizing abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_26openalex-snapshot
A LISP compiler for FP language and its proof via algebraic semantics
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_7openalex-snapshot
Three approaches to type structure
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_14openalex-snapshot
A theory of abstract data types for program development: Bridging the gap?
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_17openalex-snapshot
Application of PROLOG to test sets generation from algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_18openalex-snapshot
A PROLOG environment for developing and reasoning about data types
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_23openalex-snapshot
Algebraic specification of a communication scheduler
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_4openalex-snapshot
Functional semantics of modules
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_291openalex-snapshot
Completeness in data type specifications
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_9openalex-snapshot
Design and implementation of a generic, logic and functional programming language
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_85openalex-snapshot
Sufficient completeness, term rewriting systems and ”anti-unification”
inferred← citeshttps://doi.org/10.1007/3-540-17179-7_26openalex-snapshot
Complexity of sufficient-completeness
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_23openalex-snapshot
Rewriting techniques for the temporal analysis of communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-18086-9_31openalex-snapshot
Parallel systems specifications with coloured Petri nets and algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_61openalex-snapshot
Procedural implementation of algebraic specifications of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_8openalex-snapshot
A theory of software reusability
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_13openalex-snapshot
Conditional specifications with inequational assumptions
inferred← citeshttps://doi.org/10.1007/3-540-45648-1_1openalex-snapshot
Theories, Implementations, and Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45672-4_13openalex-snapshot
An Informal Formal Method for Systematic JUnit Test Case Generation
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_15openalex-snapshot
Abstraction and Control for Shapely Nested Graph Transformation
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_10openalex-snapshot
Initial behaviour semantics for algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_142openalex-snapshot
Semi-constructive formal systems and axiomatization of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_114openalex-snapshot
Priority rewriting: Semantics, confluence, and conditionals
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_102openalex-snapshot
A model of communication in Ada using shared data abstractions
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_102openalex-snapshot
Design strategies for rewrite rules
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_97openalex-snapshot
On sufficient completeness of conditional specifications
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_42openalex-snapshot
Nonequivalence of categories for equational algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_24openalex-snapshot
The negation elimination from syntactic equational formula is decidable
inferred← citeshttps://doi.org/10.1007/3-540-57322-4_11openalex-snapshot
Unified domains and abstract computational structures
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_5openalex-snapshot
Sufficient completeness and parameterized proofs by induction
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_5openalex-snapshot
Algebraic semantics of the Oberon target machine
inferred← citeshttps://doi.org/10.1007/3540512845_56openalex-snapshot
Partheo: A parallel inference machine ESPRIT 415 subproject F
inferred← citeshttps://doi.org/10.1007/3540547428_57openalex-snapshot
Algebraic validation of software metrics
inferred← citeshttps://doi.org/10.1007/978-0-387-34870-4_26openalex-snapshot
Abstraction and concretizing in information systems and problem domains: Implications for system descriptions
inferred← citeshttps://doi.org/10.1007/978-1-349-21151-7_2openalex-snapshot
Abstract Data Types and Program Design
inferred← citeshttps://doi.org/10.1007/978-1-4419-8596-5openalex-snapshot
A Practical Theory of Programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-0973-0_22openalex-snapshot
External Schema Generation Algorithms for Object Oriented Databases
inferred← citeshttps://doi.org/10.1007/978-1-4471-0973-0_23openalex-snapshot
Database Views with Dynamic Assertions
inferred← citeshttps://doi.org/10.1007/978-1-4471-0973-0_25openalex-snapshot
Building CASE Tools For Methods Represented As Abstract Data types
inferred← citeshttps://doi.org/10.1007/978-1-4471-1486-4_24openalex-snapshot
HM Data Model and its Formal Definition
inferred← citeshttps://doi.org/10.1007/978-1-4471-3016-1_14openalex-snapshot
Objects with Views and Constraints: from Databases to Knowledge bases
inferred← citeshttps://doi.org/10.1007/978-1-4471-3205-9_9openalex-snapshot
Algebraic Models and Metric Validation
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_19openalex-snapshot
Reasoning about Dynamic Features in Specification Languages
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_15openalex-snapshot
A Transformation Based on the Equality between Terms
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_5openalex-snapshot
Protocol Analysis and Implementation using NPNs and SDL
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_8openalex-snapshot
Software Reification using the SETS Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4471-3577-7_23openalex-snapshot
The database Specification Language Ruslan: Main Features
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_11openalex-snapshot
Transforming axioms for data types into sequential programs
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_9openalex-snapshot
Effective Properties of Finitely Generated R.E. Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4612-2704-5openalex-snapshot
Larch: Languages and Tools for Formal Specification
inferred← citeshttps://doi.org/10.1007/978-1-4612-5196-5_10openalex-snapshot
On the Design and Specification of Database Transactions
inferred← citeshttps://doi.org/10.1007/978-1-4613-1007-5_43openalex-snapshot
Hierarchial Specification Image Data Types and Level Language
inferred← citeshttps://doi.org/10.1007/978-1-4613-2007-4_6openalex-snapshot
BIDS: A Method for Specifying and Verifying Bidirectional Hardware Devices
inferred← citeshttps://doi.org/10.1007/978-1-4615-3562-1_18openalex-snapshot
Approaching System Level Design
inferred← citeshttps://doi.org/10.1007/978-1-4615-9385-0_11openalex-snapshot
Stepwise Construction of Algebraic Specifications
inferred← citeshttps://doi.org/10.1007/978-1-4757-2629-9_2openalex-snapshot
ECOS A Generic Codesign Environment for the Prototyping of Real Time Applications “From Formal Specifications to Hardware-Software Partitioning”
inferred← citeshttps://doi.org/10.1007/978-1-4757-6541-0_3openalex-snapshot
Constructing a Graphics System with OBJ2: A Practical Guide
inferred← citeshttps://doi.org/10.1007/978-3-030-00262-6_9openalex-snapshot
Key Software Engineering Paradigms and Modeling Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_2openalex-snapshot
An Illustrated Guide to the Model Theory of Supertype Abstraction and Behavioral Subtyping
inferred← citeshttps://doi.org/10.1007/978-3-030-29933-0_29openalex-snapshot
Preference Learning Based Decision Map Algebra: Specification and Implementation
inferred← citeshttps://doi.org/10.1007/978-3-030-32505-3_20openalex-snapshot
Solving the Expression Problem in C++, á la LMS
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_9openalex-snapshot
Origins and Development of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_22openalex-snapshot
A Proof Method for Local Sufficient Completeness of Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-12441-9_10openalex-snapshot
On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-031-12441-9_9openalex-snapshot
Checking Sufficient Completeness by Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-319-11653-2_17openalex-snapshot
Modelling Adaptation Policies as Domain-Specific Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-33783-8_3openalex-snapshot
Question-Based Spatial Computing—A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-319-63946-8_28openalex-snapshot
Modeling Spatio-Temporal Variations for the Language-Driven Development of Simulated Environment Generators
inferred← citeshttps://doi.org/10.1007/978-3-319-78813-5_26openalex-snapshot
Defining and Detecting Environment Discrimination in Android Apps
inferred← citeshttps://doi.org/10.1007/978-3-319-99927-2_4openalex-snapshot
JMCTest: Automatically Testing Inter-Method Contracts in Java
inferred← citeshttps://doi.org/10.1007/978-3-319-99933-3_9openalex-snapshot
Developing A New Language to Construct Algebraic Hierarchies for Event-B
inferred← citeshttps://doi.org/10.1007/978-3-540-24617-6_5openalex-snapshot
Mutually Enhancing Test Generation and Specification Inference
inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_15openalex-snapshot
Relationships Between Equational and Inductive Data Types
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_13openalex-snapshot
A Sufficient Completeness Reasoning Tool for Partial Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-44995-9_25openalex-snapshot
Software Reuse in an Object Oriented Framework: Distinguishing Types from Implementations and Objects from Attributes
inferred← citeshttps://doi.org/10.1007/978-3-540-45070-2_19openalex-snapshot
Discovering Algebraic Specifications from Java Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-47919-2_11openalex-snapshot
Analysing Nets by the Invariant Method
inferred← citeshttps://doi.org/10.1007/978-3-540-69839-5_12openalex-snapshot
A Mathematical Tool to Extend 2D Spatial Operations to Higher Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-540-71351-7_49openalex-snapshot
Semantic-Based Service Trading: Application to Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-73414-7_8openalex-snapshot
TerraHS: Integration of Functional Programming and Spatial Databases for GIS Application Development
inferred← citeshttps://doi.org/10.1007/978-3-540-78917-8_7openalex-snapshot
Testing Data Types Implementations from Algebraic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-92859-1_15openalex-snapshot
A Grid-Aware Web Portal with Advanced Service Trading for Linear Algebra Calculations
inferred← citeshttps://doi.org/10.1007/978-3-642-12029-9_17openalex-snapshot
Automatic Cross Validation of Multiple Specifications: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-642-13953-6_14openalex-snapshot
Moles: Tool-Assisted Environment Isolation with Closures
inferred← citeshttps://doi.org/10.1007/978-3-642-15057-9_9openalex-snapshot
Specifying Reusable Components
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_42openalex-snapshot
Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-27266-0_3openalex-snapshot
Programming Languages and Paradigms
inferred← citeshttps://doi.org/10.1007/978-3-642-31057-7_2openalex-snapshot
Extensibility for the Masses
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_20openalex-snapshot
Rewriting Induction + Linear Arithmetic = Decision Procedure
inferred← citeshttps://doi.org/10.1007/978-3-642-34359-9_1openalex-snapshot
Researching Cognitive and Linguistic Aspects of Geographic Space: Las Navas Then and Now
inferred← citeshttps://doi.org/10.1007/978-3-642-34407-7_8openalex-snapshot
Model Based Testing with Logical Properties versus State Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-39038-8_2openalex-snapshot
Feature-Oriented Programming with Object Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-41707-8_15openalex-snapshot
Guided Algebraic Specification Mining for Failure Simplification
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_20openalex-snapshot
Algebraic Techniques for Program Specification
inferred← citeshttps://doi.org/10.1007/978-3-642-48354-7_16openalex-snapshot
Abstract Data Types and the Development of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-54624-2_14openalex-snapshot
Synthesis of Infinite-State Abstractions and Their Use for Software Validation
inferred← citeshttps://doi.org/10.1007/978-3-642-59412-0_29openalex-snapshot
Abstract Data Types and the Development of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-67838-7_17openalex-snapshot
Konstruktive Abstrakte Datentypen
inferred← citeshttps://doi.org/10.1007/978-3-642-68064-9_2openalex-snapshot
Developing Algebraic Specifications of Threaded Data Structure Implementations
inferred← citeshttps://doi.org/10.1007/978-3-642-68355-8_10openalex-snapshot
From Requirements to their Formalization — A Case Study on the Stepwise Development of Algebraic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-68826-3_11openalex-snapshot
Proofs by Induction in “Fairly” Specified Equational Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-68828-7_4openalex-snapshot
Computer-Unterstützter Algorithmenentwurf
inferred← citeshttps://doi.org/10.1007/978-3-642-69293-2_4openalex-snapshot
Abstract Data Types As A Tool For Requirement Engineering
inferred← citeshttps://doi.org/10.1007/978-3-642-76562-9_3openalex-snapshot
Formale Spezifikation und Verifikation - Ein Überblick -
inferred← citeshttps://doi.org/10.1007/978-3-642-80199-0_15openalex-snapshot
The Olympios Model for the Analysis, Specification and Design of an Information and Decision System
inferred← citeshttps://doi.org/10.1007/978-3-642-87374-4_8openalex-snapshot
Equational Specification of Partial Higher Order Algebras
inferred← citeshttps://doi.org/10.1007/978-3-662-01089-1_12openalex-snapshot
Implementations of abstract data types and their verification
inferred← citeshttps://doi.org/10.1007/978-3-663-01461-4_2openalex-snapshot
Modellierungskonzepte und Entwurfssprachen
inferred← citeshttps://doi.org/10.1007/978-3-7091-8596-4_12openalex-snapshot
Algebraic Specification of the Software Controlling a Parcels Distribution Machine
inferred← citeshttps://doi.org/10.1007/978-94-009-7019-9_9openalex-snapshot
The Synthesis of Implementations for Abstract Data Types
inferred← citeshttps://doi.org/10.1007/978-94-011-1914-6_13openalex-snapshot
The Hardware Description Language DACAPO III
inferred← citeshttps://doi.org/10.1007/978-94-011-2606-9_24openalex-snapshot
A Formalization of Metaphors and Image-Schemas in User Interfaces
inferred← citeshttps://doi.org/10.1007/bf00264163openalex-snapshot
Complexity theory and the operational structure of algebraic programming systems
inferred← citeshttps://doi.org/10.1007/bf00283330openalex-snapshot
A second order theory of data types
inferred← citeshttps://doi.org/10.1007/bf00292110openalex-snapshot
On sufficient-completeness and related properties of term rewriting systems
inferred← citeshttps://doi.org/10.1007/bf00999725openalex-snapshot
Comparing data type specifications via their normal forms
inferred← citeshttps://doi.org/10.1007/bf01001954openalex-snapshot
Methodical specification of abstract data types via rewriting systems
inferred← citeshttps://doi.org/10.1007/bf01094341openalex-snapshot
Tools for specifying real-time systems
inferred← citeshttps://doi.org/10.1007/bf01212959openalex-snapshot
Sufficient-completeness, ground-reducibility and their complexity
inferred← citeshttps://doi.org/10.1007/bf01463944openalex-snapshot
An abstract data type for name analysis
inferred← citeshttps://doi.org/10.1007/bf01530799openalex-snapshot
Proving Ramsey's theorem by the cover set induction: A case and comparison study
inferred← citeshttps://doi.org/10.1007/bf01752392openalex-snapshot
Algebraic specification of data types: A synthetic approach
inferred← citeshttps://doi.org/10.1007/bf01786251openalex-snapshot
Algebraic specification and proof of a distributed recovery algorithm
inferred← citeshttps://doi.org/10.1007/bf01888215openalex-snapshot
A reification calculus for model-oriented software specification
inferred← citeshttps://doi.org/10.1007/bf01893885openalex-snapshot
Sufficient-completeness, ground-reducibility and their complexity
inferred← citeshttps://doi.org/10.1007/bf01990537openalex-snapshot
The equational part of proofs by structural induction
inferred← citeshttps://doi.org/10.1007/bf02252958openalex-snapshot
A complete axiomatic semantics of spawning
inferred← citeshttps://doi.org/10.1007/bf02576358openalex-snapshot
Hierarchical development of programming languages
inferred← citeshttps://doi.org/10.1007/bf02737105openalex-snapshot
A second order theory of data types
inferred← citeshttps://doi.org/10.1007/bf02943357openalex-snapshot
NDAUTO: An experimental software automation system
inferred← citeshttps://doi.org/10.1007/bfb0012775openalex-snapshot
Universal realization, persistent interconnection and implementation of abstract modules
inferred← citeshttps://doi.org/10.1007/bfb0012793openalex-snapshot
Implementation of parameterised specifications
inferred← citeshttps://doi.org/10.1007/bfb0012831openalex-snapshot
A mechanizable induction principle for equational specifications
inferred← citeshttps://doi.org/10.1007/bfb0014308openalex-snapshot
Toward a classification approach to design
inferred← citeshttps://doi.org/10.1007/bfb0014676openalex-snapshot
Examples for change of types and object structures
inferred← citeshttps://doi.org/10.1007/bfb0015034openalex-snapshot
Algebraic specification a step towards future software engineering
inferred← citeshttps://doi.org/10.1007/bfb0015050openalex-snapshot
An algebraic specification of process algebra, including two examples
inferred← citeshttps://doi.org/10.1007/bfb0015454openalex-snapshot
A method for the development of correct software
inferred← citeshttps://doi.org/10.1007/bfb0022542openalex-snapshot
Abstract data types as lattices of finitely generated models
inferred← citeshttps://doi.org/10.1007/bfb0022684openalex-snapshot
Term rewriting as a basis for the design of a functional and parallel programming language
inferred← citeshttps://doi.org/10.1007/bfb0025773openalex-snapshot
Toward a logical theory of program data
inferred← citeshttps://doi.org/10.1007/bfb0029631openalex-snapshot
Pumping lemmrs for tree languages generated by rewrite systems
inferred← citeshttps://doi.org/10.1007/bfb0030588openalex-snapshot
Conservative extensions, interpretations between theories and all that!
inferred← citeshttps://doi.org/10.1007/bfb0036486openalex-snapshot
A decidability result about sufficient-completeness of axiomatically specified abstract data types
inferred← citeshttps://doi.org/10.1007/bfb0039702openalex-snapshot
Algebraic modelling of imperative languages with pointers
inferred← citeshttps://doi.org/10.1007/bfb0039709openalex-snapshot
Communication as unification in process algebras: Operational semantics
inferred← citeshttps://doi.org/10.1007/bfb0040263openalex-snapshot
Generalization of final algebra semantics by relativization
inferred← citeshttps://doi.org/10.1007/bfb0043083openalex-snapshot
Optimal semantics of data type extensions
inferred← citeshttps://doi.org/10.1007/bfb0105138openalex-snapshot
Design and development of concurrent programs
inferred← citeshttps://doi.org/10.1007/s00165-007-0026-7openalex-snapshot
Specification and verification challenges for sequential object-oriented programs
inferred← citeshttps://doi.org/10.1007/s11225-009-9213-2openalex-snapshot
Meta-Argumentation Modelling I: Methodology and Techniques
showing the first 200 of 461 · page through all 461
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.