The following pages link to Formal Aspects of Computing (Q164203):
Displaying 50 items.
- Consistent integration of models based on views of meta models (Q973049) (← links)
- Deriving non-zeno behaviour models from goal models using ILP (Q973050) (← links)
- An algebraic semantics for MOF (Q973052) (← links)
- Automatic verification of Java programs with dynamic frames (Q973055) (← links)
- A generic complete dynamic logic for reasoning about purity and effects (Q973056) (← links)
- Erratum to: ``Algebra and logic for access control'' (Q973057) (← links)
- Slicing communicating automata specifications: Polynomial algorithms for model reduction (Q1019005) (← links)
- Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine (Q1019006) (← links)
- Network invariants for real-time systems (Q1019007) (← links)
- On the correctness of upper layers of automotive systems (Q1019015) (← links)
- A UTP semantics for \textsf{Circus} (Q1019016) (← links)
- Model checking action system refinements (Q1019017) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- Graph transformations for object-oriented refinement (Q1019019) (← links)
- FDR explorer (Q1019020) (← links)
- Mutation testing in UTP (Q1019021) (← links)
- Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← links)
- The RISC ProofNavigator: a proving assistant for program verification in the classroom (Q1019024) (← links)
- Invariant based programming: Basic approach and teaching experiences (Q1019025) (← links)
- A comparison of tools for teaching formal software verification (Q1019026) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- A framework for satisfiability modulo theories (Q1037239) (← links)
- A rigorous methodology for specification and verification of business processes (Q1037243) (← links)
- A formal framework for modeling and validating simulink diagrams (Q1037245) (← links)
- Peter Landin: a computer scientist who inspired a generation, 5th June 1930 - 3rd June 2009 (Q1037246) (← links)
- A formalism to describe design patterns based on role concepts (Q1037247) (← links)
- A CSP model with flexible parallel termination semantics (Q1037248) (← links)
- Special issue: Selected papers based on the presentations at the 2nd international workshop on formal methods for interactive systems (FMIS 2007), Lancaster, UK, September 4, 2007. (Q1043375) (← links)
- Model-checking user behaviour using interacting components (Q1047208) (← links)
- Verification-guided modelling of salience and cognitive load (Q1047211) (← links)
- Process algebraic modelling of attentional capture and human electrophysiology in interactive systems (Q1047214) (← links)
- Refinement for user interface designs (Q1047216) (← links)
- Physigrams: Modelling devices for natural interaction (Q1047222) (← links)
- Special issue: Papers from the 3rd ERCIM workshop on formal methods for industrial critical systems (FMICS 98), held at the CWI in Amsterdam, the Netherlands, 1998 (Q1125422) (← links)
- Testing algebraic data types and processes: A unifying theory (Q1125424) (← links)
- Design for proof: An approach to the design of domain-specific languages (Q1125425) (← links)
- Partial-order reduction techniques for real-time model checking (Q1125430) (← links)
- The tree identify protocol of IEEE 1394 in \(\mu\)CRL (Q1125432) (← links)
- Investigating the integration of two formal methods (Q1125437) (← links)
- Automatic verification of a lip-synchronisation protocol using UPPAAL (Q1125438) (← links)
- Probabilistic duration calculus for continuous time (Q1125686) (← links)
- The verified incremental design of a distributed spanning tree algorithm: Extended abstract (Q1125687) (← links)
- Computing permutation encodings (Q1125690) (← links)
- The least conjunctive refinement and promotion in the refinement calculus (Q1125692) (← links)
- Functional specification and proof of correctness for time dependent behaviour of reactive systems (Q1176111) (← links)
- Factorisation of finite state machines under strong and observational equivalences (Q1176112) (← links)
- Towards a semantics-based information theory (Q1179806) (← links)
- Context induction: A proof principle for behavioural abstractions and algebraic implementations (Q1179807) (← links)
- A proof system for communicating processes with value-passing (Q1179808) (← links)
- Modular structuring of VDM specifications in VVSL (Q1184682) (← links)
