Verification of the IBOS Browser Security Properties in Reachability Logic

Skeirik, Stephen; Meseguer, José; Rocha, Camilo

doi:10.1007/978-3-030-63595-4_10

Cited by 4 publications

(2 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The simplification rules are powerful enough to be used on their own as an automatic (partial) oracle to answer inductive validity questions. For example, as mentioned in the earlier paper [49], a prototype version of a subset of the simplification rules made it possible to discharge a huge number of inductive validity verification conditions (VCs) that were generated in the deductive verification proof in constructor-based reachability logic of the security properties of the IBOS Browser described in [69,68]. For a more recent example, the simplification rules implemented in the NuITP prover are invoked as an oracle to discharge VCs generated by the DM-Check tool when proving invariants of infinite-state systems [8].…”

Section: Introductionmentioning

confidence: 99%

Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification

Meseguer

Skeirik

2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

An inductive inference system for proving validity of formulas in the initial algebra T E of an order-sorted equational theory E is presented. It has 20 inference rules, but only 9 of them require user interaction; the remaining 11 can be automated as simplification rules. In this way, a substantial fraction of the proof effort can be automated. The inference rules are based on advanced equational reasoning techniques, including: equationally defined equality predicates, narrowing, constructor variant unification, variant satisfiability, order-sorted congruence closure, contextual rewriting, ordered rewriting, and recursive path orderings. All these techniques work modulo axioms B, for B any combination of associativity and/or commutativity and/or identity axioms. Most of these inference rules have already been implemented in Maude's NuITP inductive theorem prover.

show abstract

Section: Introductionmentioning

confidence: 99%

Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification

Meseguer

Skeirik

2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…To cite a few examples, Skeirik et al[71] formally model and analyze availability properties of a ZooKeeper-based group key management service; Eckhardt et al[31] propose and analyze DoS resilience mechanisms for Internet services; the constructor-based reachability logic theorem prover is used to verify the security properties of a browser system[72]. Other Formal Development Methods.…”

mentioning

confidence: 99%

All in One: Design, Verification, and Implementation of SNOW-optimal Read Atomic Transactions

Liu

2022

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

Distributed read atomic transactions are important building blocks of modern cloud databases that magnificently bridge the gap between data availability and strong data consistency. The performance of their transactional reads is particularly critical to the overall system performance, as many real-world database workloads are dominated by reads. Following the SNOW design principle for optimal reads, we develop LORA, a novel SNOW-optimal algorithm for distributed read atomic transactions. LORA completes its reads in exactly one round trip, even in the presence of conflicting writes, without imposing additional overhead to the communication, and it outperforms the state-of-the-art read atomic algorithms. To guide LORA’s development, we present a rewriting-logic-based framework and toolkit for design, verification, implementation, and evaluation of distributed databases. Within the framework, we formalize LORA and mathematically prove its data consistency guarantees. We also apply automatic model checking and statistical verification to validate our proofs and to estimate LORA’s performance. We additionally generate from the formal model a correct-by-construction distributed implementation for testing and performance evaluation under realistic deployments. Our design-level and implementation-based experimental results are consistent, which together demonstrate LORA’s promising data consistency and performance achievement.

show abstract

Building Correct-by-Construction Systems with Formal Patterns

Meseguer

2023

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

Verification of the IBOS Browser Security Properties in Reachability Logic

Cited by 4 publications

References 35 publications

Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification

Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification

All in One: Design, Verification, and Implementation of SNOW-optimal Read Atomic Transactions

Building Correct-by-Construction Systems with Formal Patterns

Contact Info

Product

Resources

About