The following pages link to (Q4385539):
Displaying 50 items.
- A coalgebraic perspective on logical interpretations (Q368477) (← links)
- A process calculus with finitary comprehended terms (Q385508) (← links)
- Interface theories for concurrency and data (Q549177) (← links)
- Thread algebra for poly-threading (Q640299) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Topological methods for algebraic specification (Q671657) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Free objects and equational deduction for partial conditional specifications (Q673184) (← links)
- Observational specifications and the indistinguishability assumption (Q673973) (← links)
- On the correctness of modular systems (Q674009) (← links)
- A formal framework for dependability and resilience from a software engineering perspective (Q692989) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- A complete axiomatic semantics of spawning (Q808281) (← links)
- Formal design and verification of operational transformation algorithms for copies convergence (Q820129) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Program algebra with a jump-shift instruction (Q959050) (← links)
- A thread calculus with molecular dynamics (Q988554) (← links)
- Meadows and the equational specification of division (Q1006649) (← links)
- Division safe calculation in totalised fields (Q1015383) (← links)
- Algebraic processing of programming languages (Q1129126) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Structural induction and coinduction in a fibrational setting (Q1275820) (← links)
- Constructing specification morphisms (Q1322845) (← links)
- OBSCURE, a specification language for abstract data types (Q1323328) (← links)
- Recursive unary algebras and trees (Q1326781) (← links)
- Refutational theorem proving for hierarchic first-order theories (Q1328182) (← links)
- A recursive second order initial algebra specification of primitive recursion (Q1338890) (← links)
- On the complexity of specification morphisms (Q1389688) (← links)
- Abstract data type systems (Q1391729) (← links)
- Proof systems for structured specifications with observability operators (Q1391730) (← links)
- Institutions for logic programming (Q1391732) (← links)
- Specification of abstract dynamic-data types: A temporal logic approach (Q1391733) (← links)
- The behavior-realization adjunction and generalized homomorphic relations (Q1391868) (← links)
- Algebraic models of correctness for abstract pipelines. (Q1426058) (← links)
- Object-oriented hybrid systems of coalgebras plus monoid actions (Q1575271) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Formalizing mathematics in higher-order logic: A case study in geometric modelling (Q1575663) (← links)
- Detecting equivalence of modular specifications with categorical diagrams (Q1583247) (← links)
- An abstract formalization of correct schemas for program synthesis (Q1583858) (← links)
- A unified language processing methodology (Q1603702) (← links)
- On abstract data types presented by multiequations (Q1607218) (← links)
- A formal approach to object-oriented software engineering (Q1608926) (← links)
- Algebraic models of microprocessors architecture and organisation (Q1815999) (← links)
- CASL: the Common Algebraic Specification Language. (Q1853453) (← links)
- On algebraic and logical specifications of classes of regular languages. (Q1874275) (← links)
- The data type variety of stack algebras (Q1891249) (← links)
- Formalism and method (Q1978639) (← links)
- Runtime verification for dynamic architectures (Q1996854) (← links)
- A framework for modeling the semantics of synchronous and asynchronous procedures with abstract state machines (Q2117610) (← links)
