scientific article

Publication date: 1982

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

minimal realization equational logic category theory abstract data types conditional equational theories foundations of software engineering models for software system components parameterized implementations

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Data structures (68P05) General topics in the theory of software (68N01) Categories of machines, automata (18B20)

Related Items (50)

Equational logics (birkhoff's method revisited) ⋮ Structured algebraic specifications: A kernel language ⋮ Not all bugs are created equal, but robust reachability can tell the difference ⋮ Algebraic specification of modules and their basic interconnections ⋮ On observational equivalence and algebraic specification ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ A characterization of passing compatibility for parameterized specifications ⋮ Union and actualization of module specifications: Some compatibility results ⋮ Taming Message-Passing Communication in Compositional Reasoning About Confidentiality ⋮ Dynamics Security Policies and Process Opacity for Timed Process Algebras ⋮ Order-Sorted Parameterization and Induction ⋮ Specifications in an arbitrary institution ⋮ Modular algebraic specification of some basic geometrical constructions ⋮ Essential concepts of algebraic specification and program development ⋮ Model-Checking Helena Ensembles with Spin ⋮ Observational implementations ⋮ Proving the correctness of behavioural implementations ⋮ Generated models and the ω-rule: The nondeterministic case ⋮ Proof systems for structured specifications with observability operators ⋮ The definition of Extended ML: A gentle introduction ⋮ The behavior-realization adjunction and generalized homomorphic relations ⋮ Observational implementation of algebraic specifications ⋮ A logical approach to multilevel security of probabilistic systems ⋮ Foundations of rule-based design of modular systems ⋮ Stratified guarded first-order transition systems ⋮ Behavioural theories and the proof of behavioural properties ⋮ On behavioural abstraction and behavioural satisfaction in higher-order logic ⋮ Observational specifications and the indistinguishability assumption ⋮ On the correctness of modular systems ⋮ Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations ⋮ Information Theory and Security: Quantitative Information Flow ⋮ May Testing, Non-interference, and Compositionality ⋮ Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) ⋮ Behavioral abstraction is hiding information ⋮ A theory of software product line refinement ⋮ An experimental logic based on the fundamental deduction principle ⋮ Toward formal development of programs from algebraic specifications: Model-theoretic foundations ⋮ Information Leakage Analysis by Abstract Interpretation ⋮ On behavioural abstraction and behavioural satisfaction in higher-order logic ⋮ Quantifying information leakage in process calculi ⋮ Compatibility of parameter passing and implementation of parameterized data types ⋮ Bisimulation of automata ⋮ A hidden agenda ⋮ Formal models and analysis of secure multicast in wired and wireless networks ⋮ Towards Behavioral Maude ⋮ Abstract Constraint Data Types ⋮ The Foundational Legacy of ASL ⋮ Possibilistic Information Flow Control in the Presence of Encrypted Communication ⋮ A hidden Herbrand theorem: Combining the object and logic paradigms ⋮ Contextual rewriting as a sound and complete proof method for conditional LOG-specifications

This page was built for publication: