The following pages link to The B-Book (Q4208552):
Displaying 50 items.
- Computation, hypercomputation, and physical science (Q959046) (← links)
- The connection between two ways of reasoning about partial functions (Q963419) (← links)
- Formalization of an architectural model for exception handling coordination based on CA action concepts (Q967556) (← links)
- Fully abstract models and refinements as tools to compare agents in timed coordination languages (Q1004066) (← links)
- Model checking action system refinements (Q1019017) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- Mutation testing in UTP (Q1019021) (← links)
- Operating system verification---an overview (Q1040002) (← links)
- Developing topology discovery in Event-B (Q1044181) (← 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)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- Stepwise refinement of heap-manipulating code in Chalice (Q1941869) (← links)
- Security invariants in discrete transition systems (Q1941889) (← links)
- A system for compositional verification of asynchronous objects (Q1951610) (← links)
- Abstractions of non-interference security: probabilistic versus possibilistic (Q2018754) (← links)
- Modular verification of programs with effects and effect handlers in Coq (Q2024352) (← links)
- Automated proof of Bell-LaPadula security properties (Q2031424) (← links)
- BGSL: an imperative language for specification and refinement of backtracking programs (Q2096419) (← links)
- Moded and continuous abstract state machines (Q2115900) (← links)
- Spot the difference: a detailed comparison between B and Event-B (Q2117587) (← links)
- Integrating formal specifications into applications: the ProB Java API (Q2147695) (← links)
- Empowering the Event-B method using external theories (Q2165497) (← links)
- Operation caching and state compression for model checking of high-level models. How to have your cake and eat it (Q2165507) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- Test generation from event system abstractions to cover their states and transitions (Q2216864) (← links)
- Modeling and visualizing object-oriented programs with Codecharts (Q2248065) (← links)
- Knowledge representation analysis of graph mining (Q2317967) (← links)
- Theorem proving graph grammars with attributes and negative application conditions (Q2358623) (← links)
- Combining refinement and signal-temporal logic for biological systems (Q2364692) (← links)
- Possible values: exploring a concept for concurrency (Q2374311) (← links)
- Efficient symbolic computation of process expressions (Q2389343) (← links)
- Semantics, calculi, and analysis for object-oriented specifications (Q2390933) (← links)
- Consistency-preserving refactoring of refinement structures in Event-B models (Q2418044) (← links)
- Satisfiability in composition-nominative logics (Q2445092) (← links)
- Preservation of probabilistic information flow under refinement (Q2482443) (← links)
- Formal specification method for systems automation (Q2512041) (← 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)
- Automated reasoning with restricted intensional sets (Q2666960) (← links)
- (Q2738991) (← links)
- From Sets to Bits in Coq (Q2798253) (← links)
- Set-Theoretic Models of Computations (Q2842623) (← links)
