17 research outputs found
A conference management system with verified document confidentiality
We present a case study in verified security for realistic systems: the implementation of a conference management system, whose functional kernel is faithfully represented in the Isabelle theorem prover, where we specify and verify confidentiality properties. The various theoretical and practical challenges posed by this development led to a novel security model and verification method
generally applicable to systems describable as input–output automata
CoSMed: a confidentiality-verified social media platform
This paper describes progress with our agenda of formal verification of information-flow security for realistic systems. We present CoSMed, a social media platform with verified document confidentiality. The system’s kernel is implemented and verified in the proof assistant Isabelle/HOL. For verification, we employ the framework of Bounded-Deducibility (BD) Security, previously introduced for the conference system CoCon. CoSMed is a second major case study in this framework. For CoSMed, the static topology of declassification bounds and triggers that characterized previous instances of BD security has to give way to a dynamic integration of the triggers as part of the bound
OpenFermion: The Electronic Structure Package for Quantum Computers
Quantum simulation of chemistry and materials is predicted to be an important
application for both near-term and fault-tolerant quantum devices. However, at
present, developing and studying algorithms for these problems can be difficult
due to the prohibitive amount of domain knowledge required in both the area of
chemistry and quantum algorithms. To help bridge this gap and open the field to
more researchers, we have developed the OpenFermion software package
(www.openfermion.org). OpenFermion is an open-source software library written
largely in Python under an Apache 2.0 license, aimed at enabling the simulation
of fermionic models and quantum chemistry problems on quantum hardware.
Beginning with an interface to common electronic structure packages, it
simplifies the translation between a molecular specification and a quantum
circuit for solving or studying the electronic structure problem on a quantum
computer, minimizing the amount of domain expertise required to enter the
field. The package is designed to be extensible and robust, maintaining high
software standards in documentation and testing. This release paper outlines
the key motivations behind design choices in OpenFermion and discusses some
basic OpenFermion functionality which we believe will aid the community in the
development of better quantum algorithms and tools for this exciting area of
research.Comment: 22 page
Comprehending Isabelle/HOL's consistency
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc overloading of constants. It turns out that the interaction between the standard HOL type definitions and the Isabelle-specific ad hoc overloading is problematic for the logical consistency. In previous work, we have argued that standard HOL semantics is no longer appropriate for capturing this interaction, and have proved consistency using a nonstandard semantics. The use of an exotic semantics makes that proof hard to digest by the community. In this paper, we prove consistency by proof-theoretic means—following the healthy intuition of definitions as abbreviations, realized in HOLC, a logic that augments HOL with comprehension types. We hope that our new proof settles the Isabelle/HOL consistency problem once and for all. In addition, HOLC offers a framework for justifying the consistency of new deduction schemas that address practical user needs
Developing GUI Applications in a Verified Setting
Although there have been major achievements in verified software, work on verifying graphical user interfaces (GUI) applications is underdeveloped relative to their ubiquity and societal importance.In this paper, we present a library for the development of verified, state-dependent GUI applications in the dependently typed programming language Agda. The library uses Agda's expressive type system to ensure that the GUI, its controller, and the underlying model are all consistent, significantly reducing the scope for GUI-related bugs.We provide a way to specify and prove correctness properties of GUI applications in terms of user interactions and state transitions. Critically, GUI applications and correctness properties are not restricted to finite state machines and may involve the execution of arbitrary interactive programs. Additionally, the library connects to a standard, imperative GUI framework, enabling the development of native GUI applications with expected features, such as concurrency.We present applications of our library to building GUI applications to manage healthcare processes. The correctness properties we consider are the following: (1) That a state can only be reached by passing through a particular intermediate state, for example, that a particular treatment can only be reached after having conducted an X-Ray. (2) That one eventually reaches a particular state, for example, that one eventually decides on a treatment. The specification of such properties is defined in terms of a GUI application simulator, which simulates all possible sequences of interactions carried out by the user
Evaluating deep tracking models for player tracking in broadcast ice hockey video
Tracking and identifying players is an important problem in computer vision
based ice hockey analytics. Player tracking is a challenging problem since the
motion of players in hockey is fast-paced and non-linear. There is also
significant player-player and player-board occlusion, camera panning and
zooming in hockey broadcast video. Prior published research perform player
tracking with the help of handcrafted features for player detection and
re-identification. Although commercial solutions for hockey player tracking
exist, to the best of our knowledge, no network architectures used, training
data or performance metrics are publicly reported. There is currently no
published work for hockey player tracking making use of the recent advancements
in deep learning while also reporting the current accuracy metrics used in
literature. Therefore, in this paper, we compare and contrast several
state-of-the-art tracking algorithms and analyze their performance and failure
modes in ice hockey.Comment: Accepted to Link\"oping Hockey Analytics Conference (LINHAC). arXiv
admin note: substantial text overlap with arXiv:2110.0309