The following pages link to (Q4301161):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- On computing representatives (Q287112) (← links)
- Generalised rely-guarantee concurrency: an algebraic foundation (Q333330) (← links)
- Compositional refinement in agent-based security protocols (Q432140) (← links)
- Compositional noninterference from first principles (Q432152) (← links)
- Experiments in program verification using Event-B (Q432154) (← links)
- Emergence and refinement (Q432157) (← links)
- Combining decision procedures by (model-)equality propagation (Q436376) (← links)
- Refinement-oriented models of Stateflow charts (Q436420) (← links)
- Refinement modal logic (Q476194) (← links)
- A tactic language for refinement of state-rich concurrent specifications (Q541214) (← links)
- A semantics for behavior trees using CSP with specification commands (Q549693) (← links)
- An algebraic approach to the design of compilers for object-oriented languages (Q607399) (← links)
- Structural operational semantics through context-dependent behaviour (Q638568) (← links)
- From control law diagrams to Ada via \textsf{Circus} (Q640296) (← links)
- Predicate transformers and higher-order programs (Q672318) (← links)
- A theory of software product line refinement (Q714875) (← links)
- Building program construction and verification tools from algebraic principles (Q736461) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- Test-data generation for control coverage by proof (Q736805) (← links)
- On integrating confidentiality and functionality in a formal method (Q736833) (← links)
- Provably correct derivation of algorithms using FermaT (Q736840) (← links)
- Introducing extra operations in refinement (Q736913) (← links)
- Testing for refinement in \textsf{Circus} (Q766162) (← links)
- Angelic nondeterminism in the unifying theories of programming (Q851128) (← links)
- The specification logic \(\nu \)Z (Q851135) (← links)
- rCOS: a refinement calculus of object systems (Q854169) (← links)
- Balancing expressiveness in formal approaches to concurrency (Q890478) (← links)
- The shadow knows: refinement and security in sequential programs (Q923889) (← links)
- Enabledness and termination in refinement algebra (Q923890) (← links)
- Algebraic reasoning for probabilistic action systems and while-loops (Q938297) (← links)
- A process algebraic framework for specification and validation of real-time systems (Q968306) (← links)
- Refinement and verification in component-based model-driven design (Q1004291) (← links)
- A UTP semantics for \textsf{Circus} (Q1019016) (← links)
- Graph transformations for object-oriented refinement (Q1019019) (← links)
- Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← links)
- Simply-typed underdeterminism (Q1273067) (← links)
- Parallel composition and decomposition of specifications (Q1602555) (← links)
- Soundness of data refinement for a higher-order imperative language (Q1605184) (← links)
- Calculating sharp adaptation rules. (Q1607103) (← links)
- Refinement to certify abstract interpretations: illustrated on linearization for polyhedra (Q1739912) (← links)
- Angelic processes for CSP via the UTP (Q1757156) (← links)
- Schedulers and finishers: on generating and filtering the behaviours of an event structure (Q1786565) (← links)
- Data refinement, call by value and higher order programs (Q1906039) (← links)
- In praise of algebra (Q1941861) (← links)
- Unifying theories in ProofPower-Z (Q1941892) (← links)
- Linking theories in probabilistic programming (Q1961866) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Abstractions of non-interference security: probabilistic versus possibilistic (Q2018754) (← links)
- A wide-spectrum language for verification of programs on weak memory models (Q2024349) (← links)
