The following pages link to (Q3995087):
Displaying 50 items.
- Z (Q22253) (← links)
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- On definitions of constants and types in HOL (Q287358) (← links)
- Model evolution and refinement (Q436356) (← links)
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic (Q436400) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- Model checking RAISE applicative specifications (Q470000) (← links)
- Completeness of fair ASM refinement (Q541210) (← 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)
- ASM refinement and generalizations of forward simulation in data refinement: a comparison (Q555790) (← links)
- A theory of software product line refinement (Q714875) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- Compensation by design (Q736799) (← links)
- Components as coalgebras: the refinement dimension (Q820141) (← links)
- Invariant-driven specifications in Maude (Q838161) (← links)
- Generalising the array split obfuscation (Q867610) (← links)
- On using data abstractions for model checking refinements (Q878378) (← links)
- Categorical foundations for structured specifications in \(\mathsf{Z}\) (Q903494) (← links)
- Using formal reasoning on a model of tasks for FreeRTOS (Q903515) (← links)
- A reification calculus for model-oriented software specification (Q911753) (← links)
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types (Q929967) (← links)
- The seven virtues of simple type theory (Q946569) (← links)
- The axiomatization of override and update (Q975885) (← links)
- Verifying the CICS file control API with Z/Eves: An experiment in the verified software repository (Q1004294) (← links)
- Mechanising a formal model of flash memory (Q1004295) (← links)
- POSIX file store in Z/Eves: An experiment in the verified software repository (Q1004296) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- Abstract interface behavior of object-oriented languages with monitors (Q1015384) (← links)
- Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← links)
- Decidable fragments of many-sorted logic (Q1041587) (← links)
- VDM and Z: A comparative case study (Q1184684) (← links)
- Multi-relations in Z. A cross between multi-sets and binary relations (Q1186512) (← links)
- A heuristic method for generating large random expressions (Q1205725) (← links)
- Annotations in formal specifications and proofs (Q1334901) (← links)
- Defining relationships in ecology using object-oriented formal specifications (Q1340342) (← links)
- Transformational vs reactive refinement in real-time systems (Q1350363) (← links)
- The formal specification of abstract data types and their implementation in Fortran 90 (Q1355365) (← links)
- A temporal logic for real-time partial ordering with named transactions (Q1391307) (← links)
- A calculus for schemas in Z (Q1583855) (← links)
- Mobile agent evolution computing (Q1602507) (← links)
- Model-based specification (Q1607085) (← links)
- Designing a semantic model for a wide-spectrum language with concurrency (Q1682288) (← links)
- Relating trace refinement and linearizability (Q1688548) (← links)
- Finding models through graph saturation (Q1785854) (← links)
- Relation algebra as programming language using the Ampersand compiler (Q1785856) (← links)
- Richer types for \(Z\) (Q1816920) (← links)
- From Boolean algebra to unified algebra (Q1889959) (← links)
- Unification: A case-study in data refinement (Q1898815) (← links)
- A formal model of explanation (Q1898821) (← links)
