scientific article; zbMATH DE number 1142323

Cited in

(82)

Meadows and the equational specification of division
Division safe calculation in totalised fields
Algebraic processing of programming languages
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
Some undecidability results concerning the property of preserving regularity
Structural induction and coinduction in a fibrational setting
Constructing specification morphisms
OBSCURE, a specification language for abstract data types
Recursive unary algebras and trees
Refutational theorem proving for hierarchic first-order theories
A recursive second order initial algebra specification of primitive recursion
On the complexity of specification morphisms
Abstract data type systems
Proof systems for structured specifications with observability operators
Institutions for logic programming
Specification of abstract dynamic-data types: A temporal logic approach
The behavior-realization adjunction and generalized homomorphic relations
Algebraic models of correctness for abstract pipelines.
Object-oriented hybrid systems of coalgebras plus monoid actions
Swinging types=functions+relations+transition systems
Formalizing mathematics in higher-order logic: A case study in geometric modelling
Detecting equivalence of modular specifications with categorical diagrams
An abstract formalization of correct schemas for program synthesis
A unified language processing methodology
On abstract data types presented by multiequations
A formal approach to object-oriented software engineering
Algebraic models of microprocessors architecture and organisation
CASL: the Common Algebraic Specification Language.
On algebraic and logical specifications of classes of regular languages.
The data type variety of stack algebras
Formalism and method
Runtime verification for dynamic architectures
A framework for modeling the semantics of synchronous and asynchronous procedures with abstract state machines
Interactive verification of architectural design patterns in FACTum
Constructor-based observational logic
Parallel processes with implicit computational capital
Building a Modal Interface Theory for Concurrency and Data
Refinement by Interpretation in a General Setting
From grammars and automata to algebras and coalgebras
A coalgebraic perspective on logical interpretations
A process calculus with finitary comprehended terms
scientific article; zbMATH DE number 1522144 (Why is no real title available?)
scientific article; zbMATH DE number 1525070 (Why is no real title available?)
scientific article; zbMATH DE number 1555491 (Why is no real title available?)
Formal reasoning about modules, reuse and their correctness
Higher-order equational logic for specification, simulation and testing
Algebraic specification and development in geometric modeling
Functional sorts in data type specifications
Proof systems for structured algebraic specifications: An overview
Semantics of full statecharts based on graph rewriting
Proving the correctness of behavioural implementations
Semantic typing for parametric algebraic specifications
Generated models and the -rule: the nondeterministic case
Theory of computation over stream algebras, and its applications
Algebraic methods in the compositional analysis of logic programs
Using Hoare logic in a process algebra setting
A homage to Martin Wirsing
Ode to the PST
Localized operational termination in general logics
Structured document algebra in action
Pragmatic Formal Specification of System Properties by Tables
Architectural_Design_Patterns
Interface theories for concurrency and data
Datatype defining rewrite systems for naturals and integers
Consistency and semantics of equational definitions over predefined algebras
Generic induction proofs
Thread algebra for poly-threading
An evolving algebra abstract machine
Imperative process algebra and models of parallel computation
Basic notions of universal algebra for language theory and graph grammars
Topological methods for algebraic specification
Using induction and rewriting to verify and complete parameterized specifications
Free objects and equational deduction for partial conditional specifications
Observational specifications and the indistinguishability assumption
On the correctness of modular systems
A formal framework for dependability and resilience from a software engineering perspective
Instruction sequence processing operators
A complete axiomatic semantics of spawning
Formal design and verification of operational transformation algorithms for copies convergence
Preferential choice and coordination conditions
Program algebra with a jump-shift instruction
A thread calculus with molecular dynamics

This page was built for publication:

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