The following pages link to Formal Aspects of Computing (Q164203):
Displaying 50 items.
- Structural refinement of systems specified in Object-Z and CSP (Q706503) (← links)
- ArcAngel: a tactic language for refinement (Q706504) (← links)
- A logic for schema-based program development (Q706506) (← links)
- Advanced features of duration calculus and their applications in sequential hybrid programs (Q706508) (← links)
- Compositional action system refinement (Q706509) (← links)
- Concurrency and refinement in the unified modeling language (Q706511) (← links)
- A refinement strategy for Circus (Q706512) (← links)
- Relational concurrent refinement (Q706513) (← links)
- Exploring tabular verification and refinement (Q706515) (← links)
- The ASM refinement method (Q706516) (← links)
- The variety of variables in automated real-time refinement (Q706517) (← links)
- Mutation testing in the refinement calculus (Q706518) (← links)
- Formalizing and testing the consistency of DSL transformations (Q736456) (← links)
- A general framework for architecture composability (Q736458) (← links)
- Active learning for extended finite state machines (Q736459) (← links)
- Building program construction and verification tools from algebraic principles (Q736461) (← links)
- Optimising the ProB model checker for B using partial order reduction (Q736463) (← links)
- Correctness and concurrent complexity of the black-white bakery algorithm (Q736464) (← links)
- Test generation from state based use case models (Q736788) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing (Q736791) (← links)
- Reasoning about goal-directed real-time teleo-reactive programs (Q736794) (← links)
- Time-budgeting: a component based development methodology for real-time embedded systems (Q736795) (← links)
- The essence of Reynolds (Q736798) (← links)
- Compensation by design (Q736799) (← links)
- An elementary theory of product-line variations (Q736801) (← links)
- Verifying traits: an incremental proof system for fine-grained reuse (Q736803) (← links)
- Test-data generation for control coverage by proof (Q736805) (← links)
- Towards verification of computation orchestration (Q736807) (← links)
- Assume-guarantee synthesis for digital contract signing (Q736809) (← links)
- A formal semantics of extended hierarchical state transition matrices using CSP\# (Q736828) (← links)
- The stream-based service-centred calculus: a foundation for service-oriented programming (Q736830) (← links)
- On integrating confidentiality and functionality in a formal method (Q736833) (← links)
- Refinement patterns for ASTDs (Q736838) (← links)
- Provably correct derivation of algorithms using FermaT (Q736840) (← links)
- Analysing neurobiological models using communicating automata (Q736844) (← links)
- Concerned with the unprivileged: user programs in kernel refinement (Q736848) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- A formalisation of deep metamodelling (Q736852) (← links)
- Kaisa Sere: in memoriam (Q736909) (← links)
- The behavioural semantics of Event-B refinement (Q736910) (← links)
- Derivation of concurrent programs by stepwise scheduling of Event-B models (Q736912) (← links)
- Introducing extra operations in refinement (Q736913) (← links)
- Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application (Q736916) (← links)
- Relational concurrent refinement. III: Traces, partial relations and automata (Q736917) (← links)
- Towards a formal foundation of the specification and description language SDL (Q749198) (← links)
- A demonstrably correct compiler (Q749202) (← links)
- Generator induction in order sorted algebras (Q749219) (← links)
- The fixed point theory of unbounded non-determinism (Q751807) (← links)
- Refinement, conformance and inheritance (Q751843) (← links)
