The following pages link to The B-Book (Q4208552):
Displayed 42 items.
- ASM refinement and generalizations of forward simulation in data refinement: a comparison (Q555790) (← links)
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case (Q556680) (← links)
- Specification and refinement of mobile systems in MTLA and mobile UML (Q820132) (← links)
- Components as coalgebras: the refinement dimension (Q820141) (← links)
- Tank monitoring: A pAMN case study (Q851131) (← links)
- Transposing partial components--an exercise on coalgebraic refinement (Q854163) (← links)
- Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm (Q860848) (← links)
- Verifying a signature architecture: a comparative case study (Q877156) (← links)
- Splitting atoms safely (Q879357) (← links)
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types (Q929967) (← links)
- The seven virtues of simple type theory (Q946569) (← links)
- Computation, hypercomputation, and physical science (Q959046) (← links)
- Fully abstract models and refinements as tools to compare agents in timed coordination languages (Q1004066) (← links)
- A calculus for schemas in Z (Q1583855) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- Abstract state machines: a unifying view of models of computation and of system design frameworks (Q1772776) (← links)
- Operational semantics of the Java Card Virtual Machine (Q1881664) (← links)
- The KRAKATOA tool for certification of JAVA/JAVACARD programs annotated in JML (Q1881670) (← links)
- Manipulating algebraic specifications with term-based and graph-based representations (Q1885933) (← links)
- Preservation of probabilistic information flow under refinement (Q2482443) (← links)
- Predicate diagrams for the verification of real-time systems (Q2642985) (← links)
- Responsiveness and stable revivals (Q2642988) (← links)
- Interactive tool support for CSP \(\parallel\) B consistency checking (Q2642989) (← links)
- Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems (Q2643128) (← links)
- Specification and verification challenges for sequential object-oriented programs (Q2643131) (← links)
- (Q2738991) (← links)
- Why Would You Trust B? (Q3498474) (← links)
- iRho: an imperative rewriting calculus (Q3520144) (← links)
- On the Purpose of Event-B Proof Obligations (Q3535369) (← links)
- Generating Tests from B Specifications and Test Purposes (Q3535370) (← links)
- A Practical Single Refinement Method for B (Q3535376) (← links)
- The Composition of Event-B Models (Q3535377) (← links)
- Modelling Attacker’s Knowledge for Cascade Cryptographic Protocols (Q3535379) (← links)
- Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification (Q3535380) (← links)
- On Automating the Calculus of Relations (Q3541686) (← links)
- Efficient Well-Definedness Checking (Q3541692) (← links)
- Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B (Q3605463) (← links)
- Unifying Sets and Programs via Dependent Types (Q3605541) (← links)
- Modelling of Complex Software Systems: A Reasoned Overview (Q3613056) (← links)
- A case study in the mechanical verification of fault tolerance (Q4783363) (← links)
- Panelist position statement: reasoning about the design of programs (Q5301853) (← links)
- Finding Counter Examples in Induction Proofs (Q5458810) (← links)