swMATH10291MaRDI QIDQ22253FDOQ22253
Author name not available (Why is that?)
Official website: http://en.wikipedia.org/wiki/Z_notation
Cited In (only showing first 100 items - show all)
- Unification: A case-study in data refinement
- An Event-B based approach for cloud composite services verification
- Modelling Divergence in Relational Concurrent Refinement
- A case study in transformational design of concurrent systems
- A logical system based on rules and its application in teaching mathematical logic
- Laws of mission-based programming
- ViewPoints
- Guarded operations, refinement and simulation
- Verifying a signature architecture: a comparative case study
- The seven virtues of simple type theory
- Abstract interface behavior of object-oriented languages with monitors
- Verifying data refinements using a model checker
- A theory of software product line refinement
- Generalising the array split obfuscation
- Refinement and verification in component-based model-driven design
- Transformational vs reactive refinement in real-time systems
- Verifying the CICS file control API with Z/Eves: An experiment in the verified software repository
- The formal specification of abstract data types and their implementation in Fortran 90
- On using data abstractions for model checking refinements
- Object oriented concepts identification from formal \(B\) specifications
- An operational semantics for object-oriented concepts based on the class hierarchy
- Compensation by design
- Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application
- On integrating confidentiality and functionality in a formal method
- Introducing extra operations in refinement
- Relational concurrent refinement. III: Traces, partial relations and automata
- Test-data generation for control coverage by proof
- FDR explorer
- Model checking action system refinements
- Semantics, calculi, and analysis for object-oriented specifications
- Mobile agent evolution computing
- BOX: Browsing objects in XML
- Correct hardware synthesis
- Categorical foundations for structured specifications in \(\mathsf{Z}\)
- Using formal reasoning on a model of tasks for FreeRTOS
- Annotations in formal specifications and proofs
- More relational concurrent refinement: traces and partial relations
- Satisfiability in composition-nominative logics
- VDM and Z: A comparative case study
- Multi-relations in Z. A cross between multi-sets and binary relations
- Defining relationships in ecology using object-oriented formal specifications
- A calculus for schemas in Z
- Atomic actions, and their refinements to isolated protocols
- Semantic inheritance in unifying theories of programming
- Preservation of probabilistic information flow under refinement
- Unifying theories in ProofPower-Z
- A heuristic method for generating large random expressions
- Automating Event-B invariant proofs by rippling and proof patching
- Relating trace refinement and linearizability
- Computability theory. Abstracts from the workshop held January 7--13, 2018
- Specification by interface separation
- Modelling of Complex Software Systems: A Reasoned Overview
- Modelling and analysing neural networks using a hybrid process algebra
- Extended Static Checking by Calculation Using the Pointfree Transform
- On the purpose of Event-B proof obligations
- Z2SAL: a translation-based model checker for Z
- The axiomatization of override and update
- A semantics for behavior trees using CSP with specification commands
- Completeness of fair ASM refinement
- Formalisations and applications of BPMN
- ASM refinement and generalizations of forward simulation in data refinement: a comparison
- Trace-based derivation of a scalable lock-free stack algorithm
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
- Numerical homogenization: survey, new results, and perspectives
- On definitions of constants and types in HOL
- Mechanising a Unifying Theory
- An observationally complete program logic for imperative higher-order functions
- Relational matching for graphical calculi of relations
- Experiments in program verification using Event-B
- Mechanised support for sound refinement tactics
- Model evolution and refinement
- Mechanical reasoning about families of UTP theories
- Refinement-oriented models of Stateflow charts
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic
- A note on the refinement of ontologies
- From control law diagrams to Ada via \textsf{Circus}
- A relative timed semantics for BPMN
- Refinement modal logic
- Mechanising a formal model of flash memory
- POSIX file store in Z/Eves: An experiment in the verified software repository
- A UTP semantics for \textsf{Circus}
- Decidable fragments of many-sorted logic
- Determinisation of relational substitutions in ordered categories with domain
- Incompleteness of relational simulations in the blocking paradigm
- Transposing partial components--an exercise on coalgebraic refinement
- Abstract state machines: a unifying view of models of computation and of system design frameworks
- A fixpoint theory for non-monotonic parallelism
- Domain science and engineering from computer science to the sciences of informatics. II: Science
- An analysis of refinement in an abortive paradigm
- Data refinement and singleton failures refinement are not equivalent
- Relational concurrent refinement. II: Internal operations and outputs
- Model checking RAISE applicative specifications
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
- Automating refinement of Circus programs
- Integrating a formal method into a software engineering process with UML and Java
- Jass
- TGV
- Specification and runtime verification of Java card programs
- ANNA
- SETL
This page was built for software: Z
