Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Vazou, Niki"'
Practical checkers based on refinement types use the combination of implicit semantic sub-typing and parametric polymorphism to simplify the specification and automate the verification of sophisticated properties of programs. However, a formal meta-t
Externí odkaz:
http://arxiv.org/abs/2207.05617
We introduce Flux, which shows how logical refinements can work hand in glove with Rust's ownership mechanisms to yield ergonomic type-based verification of low-level pointer manipulating programs. First, we design a novel refined type system for Rus
Externí odkaz:
http://arxiv.org/abs/2207.04034
Protocols to ensure that messages are delivered in causal order are a ubiquitous building block of distributed systems. For instance, distributed data storage systems can use causally ordered message delivery to ensure causal consistency, and CRDTs c
Externí odkaz:
http://arxiv.org/abs/2206.14767
Non-interference is a popular way to enforce confidentiality of sensitive data. However, declassification of sensitive information is often needed in realistic applications but breaks non-interference. We present ANOSY, an approximate knowledge synth
Externí odkaz:
http://arxiv.org/abs/2203.12069
We introduce REST, a novel term rewriting technique for theorem proving that uses online termination checking and can be integrated with existing program verifiers. REST enables flexible but terminating term rewriting for theorem proving by: (1) expl
Externí odkaz:
http://arxiv.org/abs/2202.05872
Autor:
Vazou, Niki, Greenberg, Michael
Refinement type checkers are a powerful way to reason about functional programs. For example, one can prove properties of a slow, specification implementation, porting the proofs to an optimized implementation that behaves the same. Without functiona
Externí odkaz:
http://arxiv.org/abs/2103.02177
Autor:
Jhala, Ranjit, Vazou, Niki
Refinement types enrich a language's type system with logical predicates that circumscribe the set of values described by the type, thereby providing software developers a tunable knob with which to inform the type system about what invariants and co
Externí odkaz:
http://arxiv.org/abs/2010.07763
We present Labeled Input Output in F* (LIO*), a verified framework that enforces information flow control (IFC) policies developed in F* and automatically extracted to C. Inspired by LIO, we encapsulated IFC policies into effects, but using F* we der
Externí odkaz:
http://arxiv.org/abs/2004.12885
Many researchers have explored ways to bring static typing to dynamic languages. However, to date, such systems are not precise enough when types depend on values, which often arises when using certain Ruby libraries. For example, the type safety of
Externí odkaz:
http://arxiv.org/abs/1904.03521
Publikováno v:
Proc. ACM Program. Lang., Vol. 3, No. POPL, Article 75 (January 2019)
This paper presents LWeb, a framework for enforcing label-based, information flow policies in database-using web applications. In a nutshell, LWeb marries the LIO Haskell IFC enforcement library with the Yesod web programming framework. The implement
Externí odkaz:
http://arxiv.org/abs/1901.07665