The following pages link to (Q2767980):
Displaying 50 items.
- Pair algebras and Galois connections. (Q293350) (← links)
- Specifying termination in CSP (Q407510) (← links)
- Connectors as designs: modeling, refinement and test case generation (Q433336) (← links)
- Mechanised wire-wise verification of Handel-C synthesis (Q436367) (← links)
- Refinement-oriented models of Stateflow charts (Q436420) (← links)
- Complete model-based equivalence class testing for nondeterministic systems (Q520246) (← links)
- A semantics for behavior trees using CSP with specification commands (Q549693) (← links)
- Imperative abstractions for functional actions (Q604455) (← links)
- An algebraic approach to the design of compilers for object-oriented languages (Q607399) (← links)
- Algebras for iteration and infinite computations (Q715050) (← links)
- Testing for refinement in \textsf{Circus} (Q766162) (← links)
- Correct hardware synthesis (Q766178) (← links)
- Regular algebra applied to language problems (Q817577) (← links)
- Normal design algebra (Q844885) (← links)
- Angelic nondeterminism in the unifying theories of programming (Q851128) (← links)
- rCOS: a refinement calculus of object systems (Q854169) (← links)
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited (Q894695) (← links)
- Local variable scoping and Kleene algebra with tests (Q929964) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- Service refinement (Q954408) (← links)
- CSP is a retract of CCS (Q960852) (← links)
- A process algebraic framework for specification and validation of real-time systems (Q968306) (← links)
- Robustness testing for software components (Q988173) (← links)
- Refinement and verification in component-based model-driven design (Q1004291) (← links)
- Behaviour approximated on subgroups (Q1030197) (← links)
- Against digital ontology (Q1036042) (← links)
- A CSP model with flexible parallel termination semantics (Q1037248) (← links)
- A calculus for schemas in Z (Q1583855) (← links)
- On the antisymmetry of Galois embeddings (Q1603437) (← links)
- Soundness of data refinement for a higher-order imperative language (Q1605184) (← links)
- An algebraic hardware/software partitioning algorithm (Q1613267) (← links)
- A fixpoint theory for non-monotonic parallelism (Q1884887) (← links)
- Sound refactorings (Q2266944) (← links)
- Infinite executions of lazy and strict computations (Q2347906) (← links)
- The weakest specifunction (Q2484065) (← links)
- Set-Theoretic Models of Computations (Q2842623) (← links)
- Model-Based Mutation Testing of Reactive Systems (Q2842624) (← links)
- A Relational Approach to an Algebraic Community: From Paul Erdős to He Jifeng (Q2842626) (← links)
- Algebraic Program Semantics for Supercomputing (Q2842630) (← links)
- Modeling and Specification of Real-Time Interfaces with UTP (Q2842633) (← links)
- Generic Models of the Laws of Programming (Q2842638) (← links)
- (Q2842861) (← links)
- (Q2843615) (← links)
- Unifying Lazy and Strict Computations (Q2915133) (← links)
- rCOS: Defining Meanings of Component-Based Software Architectures (Q2948228) (← links)
- A Discrete Geometric Model of Concurrent Program Execution (Q2971172) (← links)
- A New Roadmap for Linking Theories of Programming (Q2971173) (← links)
- Towards a UTP Semantics for Modelica (Q2971175) (← links)
- A Two-Way Path Between Formal and Informal Design of Embedded Systems (Q2971176) (← links)
- UTP Semantics of Reactive Processes with Continuations (Q2971178) (← links)
