The following pages link to (Q3997074):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- A functional framework for agent-based models of exchange (Q426933) (← links)
- Experiments in program verification using Event-B (Q432154) (← links)
- Connectors as designs: modeling, refinement and test case generation (Q433336) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- Elucidating concurrent algorithms via layers of abstraction and reification (Q539423) (← links)
- A semantics for behavior trees using CSP with specification commands (Q549693) (← links)
- ASM refinement and generalizations of forward simulation in data refinement: a comparison (Q555790) (← links)
- Automating Event-B invariant proofs by rippling and proof patching (Q667526) (← links)
- The generic development language. Presentation and case studies (Q690318) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- On integrating confidentiality and functionality in a formal method (Q736833) (← links)
- Invariant-driven specifications in Maude (Q838161) (← links)
- An analysis of refinement in an abortive paradigm (Q851133) (← links)
- A generalization of ACP using Belnap's logic (Q864509) (← links)
- Splitting atoms safely (Q879357) (← links)
- Balancing expressiveness in formal approaches to concurrency (Q890478) (← links)
- Service refinement (Q954408) (← links)
- The connection between two ways of reasoning about partial functions (Q963419) (← links)
- Refinement and verification in component-based model-driven design (Q1004291) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- Modular structuring of VDM specifications in VVSL (Q1184682) (← links)
- Multi-relations in Z. A cross between multi-sets and binary relations (Q1186512) (← links)
- Sound and complete rules for data reification (Q1373852) (← links)
- A temporal logic for real-time partial ordering with named transactions (Q1391307) (← links)
- Hoare's logic and VDM (Q1805402) (← links)
- Vienna development method: An informal introduction (Q1817110) (← links)
- Proof by analogy in mural (Q1898818) (← links)
- Specification by interface separation (Q1903078) (← links)
- Applying abstraction and formal specification in numerical software design (Q1903758) (← links)
- On simulation, subtyping and substitutability in sequential object systems (Q1906038) (← links)
- A theory of Orwellian specifications with NewThink (Q1906042) (← links)
- Semantics of under-determined expressions (Q1911315) (← links)
- An approach to literate and structured formal developments (Q1911317) (← links)
- Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm (Q1914039) (← links)
- Compositional verification of real-time systems with explicit clock temporal logic (Q1918934) (← links)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- Integrating formal specifications into applications: the ProB Java API (Q2147695) (← links)
- Reachability analysis and simulation for hybridised Event-B models (Q2165506) (← links)
- Bridging arrays and ADTs in recursive proofs (Q2233489) (← links)
- Modeling and visualizing object-oriented programs with Codecharts (Q2248065) (← links)
- Formally verified tableau-based reasoners for a description logic (Q2351147) (← links)
- Impact of performance considerations on formal specification design (Q2365398) (← links)
- Proof movie -- a proof with the Boyer-Moore prover (Q2366695) (← links)
- Possible values: exploring a concept for concurrency (Q2374311) (← links)
- Semantics, calculi, and analysis for object-oriented specifications (Q2390933) (← links)
- Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example (Q2418046) (← links)
- A program logic for resources (Q2463560) (← links)
- Preservation of probabilistic information flow under refinement (Q2482443) (← links)
