Cited in
(only showing first 100 items - show all)- Composition mechanisms for retrenchment
- An Event-B based approach for cloud composite services verification
- Torsion in graph homology
- Unification: A case-study in data refinement
- Specification by interface separation
- scientific article; zbMATH DE number 7552283 (Why is no real title available?)
- Modelling of Complex Software Systems: A Reasoned Overview
- FORMAL VALIDATION AND VERIFICATION OF ATOMIC RESOLUTION MICROSCOPE CONTROL AND TOPOGRAPHY
- Modelling and analysing neural networks using a hybrid process algebra
- Modelling Divergence in Relational Concurrent Refinement
- Testing using CSP Models: Time, Inputs, and Outputs
- A temporal logic for real-time partial ordering with named transactions
- Action systems in incremental and aspect-oriented modeling
- 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
- Model-based specification
- Stateflow diagrams in Circus
- Extended Static Checking by Calculation Using the Pointfree Transform
- ABC4EFT
- Levels of abstraction and the Turing test
- A relational approach to an algebraic community: from Paul Erdős to He Jifeng
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- Mini-workshop: Chromatic phenomena and duality in homotopy theory and representation theory. Abstracts from the mini-workshop held March 4--10, 2018
- Spectral structures and topological methods in mathematical quasicrystals. Abstracts from the workshop held October 1--7, 2017
- Working session: Additive combinatorics, entropy, and fractal geometry. Abstracts from the working session held October 8--13, 2017
- Semantic essence of AsmL
- On the purpose of Event-B proof obligations
- Z2SAL: a translation-based model checker for Z
- Guarded operations, refinement and simulation
- 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
- Verifying a signature architecture: a comparative case study
- Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model
- A case study using lightweight formalism to review an information system specification
- ASM refinement and generalizations of forward simulation in data refinement: a comparison
- A Unary Semigroup Trace Algebra
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- rCOS: defining meanings of component-based software architectures
- Verified Compilation and the B Method: A Proposal and a First Appraisal
- Towards leveraging domain knowledge in state-based formal methods
- Spot the difference: a detailed comparison between B and Event-B
- The seven virtues of simple type theory
- scientific article; zbMATH DE number 7552282 (Why is no real title available?)
- Abstract interface behavior of object-oriented languages with monitors
- Software Development in Relation Algebra with Ampersand
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
- Trace-based derivation of a scalable lock-free stack algorithm
- Unifying theories of reactive design contracts
- Sound reasoning in \textit{tock}-CSP
- Refinement-preserving plug-in components
- Formalizing workflows partitioning over federated clouds: multi-level security and costs
- Verifying data refinements using a model checker
- A theory of software product line refinement
- Extended transitive separation logic
- Formal software development in the Verification Support Environment (VSE)
- Manipulating algebraic specifications with term-based and graph-based representations
- On definitions of constants and types in HOL
- Numerical homogenization: survey, new results, and perspectives
- Fifty years of Hoare's logic
- A new roadmap for linking theories of programming
- Cost enforcement in the real-time specification for Java
- Refinement and state machine abstraction
- An observationally complete program logic for imperative higher-order functions
- The teaching tool CalcCheck: a proof-checker for Gries and Schneider's ``Logical approach to discrete math
- 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
- Relational matching for graphical calculi of relations
- Higher-order UTP for a theory of methods
- Composition nominative approach to specifying program systems in Z-Notation language
- Mechanising a Unifying Theory
- Generalising the array split obfuscation
- ZUM '95: The Z formal specification notation. 9th International Conference of Z Users, Limerick, Ireland, September 7-9, 1995. Proceedings
- A formal model of explanation
- Circus Time with Reactive Designs
- Refinement and verification in component-based model-driven design
- Checking Z Data Refinements Using Traces Refinement
- Transformational vs reactive refinement in real-time systems
- From control law diagrams to Ada via \textsf{Circus}
- Modelling temporal behaviour in complex systems with Timebands
- Angelic processes for CSP via the UTP
- RCOS: a formal model-driven engineering method for component-based software
- A note on the refinement of ontologies
- An institution for Object-Z with inheritance and polymorphism
- Override and update
- Simulink timed models for program verification
- Putting logic-based distributed systems on stable grounds
- A theory of Orwellian specifications with NewThink
- Curves and Jacobians over function fields
- Verifying the CICS file control API with Z/Eves: An experiment in the verified software repository
- Automated proof of Bell-LaPadula security properties
- Refinement modal logic
- Model checking simulation rules for linearizability
- The formal specification of abstract data types and their implementation in Fortran 90
This page was built for software: Z
