Filters








19 Hits in 3.9 sec

Verification of Certifying Computations through AutoCorres and Simpl [chapter]

Lars Noschinski, Christine Rizkallah, Kurt Mehlhorn
2014 Lecture Notes in Computer Science  
Certifying algorithms compute not only an output, but also a witness that certifies the correctness of the output for a particular input.  ...  In this article, we evaluate the feasibility of performing the entire verification within Isabelle. For this purpose, we consider checkers written in the imperative languages C and Simpl.  ...  Acknowledgement We thank David Greenaway and Thomas Sewell for their advice on using AutoCorres.  ... 
doi:10.1007/978-3-319-06200-6_4 fatcat:inwj5x43pzbljd5bcwrd4fjgsq

Cogent: uniqueness types and certifying compilation

Liam O'Connor, Zilin Chen, Christine Rizkallah, Vincent Jackson, Sidney Amani, Gerwin Klein, Toby Murray, Thomas Sewell, Gabriele Keller
2021 Journal of functional programming  
and security.  ...  This paper presents a framework aimed at significantly reducing the cost of proving functional correctness for low-level operating systems components.  ...  Tuong and Sean Seefried for their work on generating Isabelle proofs from Haskell; and to Partha Susarla, Peter Chubb and Alex Hixon for their work on systems programming in Cogent.  ... 
doi:10.1017/s095679682100023x dblp:journals/jfp/OConnorCRJAKMSK21 fatcat:nlni6emxcbfnpdtraw56w6rdpm

COGENT: Certified Compilation for a Functional Systems Language [article]

Liam O'Connor, Christine Rizkallah, Zilin Chen, Sidney Amani, Japheth Lim, Yutaka Nagashima, Thomas Sewell, Alex Hixon, Gabriele Keller, Toby Murray, Gerwin Klein
2016 arXiv   pre-print
We present a self-certifying compiler for the COGENT systems language.  ...  The aim is for proof engineers to reason about the full semantics of real-world systems code productively and equationally, while retaining the interoperability and leanness of C.  ...  The focus of this paper is what can be learned from Cogent about the formal verification of certifying compilation.  ... 
arXiv:1601.05520v1 fatcat:xulbglfvp5ccdjeqphngckbz34

Refinement through restraint: bringing down the cost of verification

Liam O'Connor, Zilin Chen, Christine Rizkallah, Sidney Amani, Japheth Lim, Toby Murray, Yutaka Nagashima, Thomas Sewell, Gerwin Klein
2016 Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming - ICFP 2016  
Our framework is based on certifying compilation: For a welltyped Cogent program, our compiler produces C code, a high-level shallow embedding of its semantics in Isabelle/HOL, and a proof that the C code  ...  Thus one can reason about the full semantics of real-world systems code productively and equationally, while retaining the interoperability and leanness of C.  ...  Acknowledgements We would like to thank Partha Susarla, Peter Chubb, and Alex Hixon for their assistance in implementing and evaluating our case studies; and Joseph Tuong and Sean Seefried for their work  ... 
doi:10.1145/2951913.2951940 dblp:conf/icfp/OConnorCRALMNSK16 fatcat:vppo6d5rjngj5cboqqi4edkwbe

Overcoming Restraint: Modular Refinement using Cogent's Principled Foreign Function Interface [article]

Louis Cheung, Liam O'Connor, Christine Rizkallah
2021 arXiv   pre-print
We demonstrate the feasibility of verification of mixed Cogent-C systems, and provide some insight into verification of software comprised of code in multiple languages with differing levels of static  ...  Previous verification of file systems implemented in Cogent merely assumed that their C components were correct and that they preserved the invariants of Cogent's type system.  ...  Embeddings Since we use AutoCorres in our verification, we do not need to define our own embedding of word arrays and our functions for the C semantic layer as AutoCorres automatically does this for us  ... 
arXiv:2102.09920v3 fatcat:vs7qgwc53nenfebp66rqeq2qma

A Framework for Proof-carrying Logical Transformations

Quentin Garchery
2021 Electronic Proceedings in Theoretical Computer Science  
We develop a language of proof certificates for them and use it to implement the full chain of certificate generation and certificate verification.  ...  In various provers and deductive verification tools, logical transformations are used extensively in order to reduce a proof task into a number of simpler tasks.  ...  We are grateful to Alexandrina Korneva for the English proofreading and to Claude Marché, Chantal Keller and Andrei Paskevich for their constant support and their helpful suggestions.  ... 
doi:10.4204/eptcs.336.2 fatcat:lp4nuxfwdfdizpfuahijvs3nim

Modular Verification for Computer Security

Andrew W. Appel
2016 2016 IEEE 29th Computer Security Foundations Symposium (CSF)  
Here I explain some of the modularity principles that make these verifications possible.  ...  Several recent projects have demonstrated that formal, deductive functional-correctness verification is now possible for kernels, crypto, and compilers.  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA  ... 
doi:10.1109/csf.2016.8 dblp:conf/csfw/Appel16 fatcat:7667qxql2ne5dapggwi76wrryq

Certifying Computations: Algorithmics meets Software Engineering

Kurt Mehlhorn
unpublished
[NRM14] Lars Noschinski, Christine Rizkallah, and Kurt Mehlhorn. Verification of certifying computations through AutoCorres and Simpl. In NASA Formal Methods Symposium, 2014. [ABMR14] E. Alkassar, S.  ...  In the third part of the talk, we discuss the formal verification of certifying computations ([ABMR14, NRM14] ). Mehlhorn and S. Näher. The LEDA Platform for Combinatorial and Geometric Computing.  ... 
fatcat:6qqqc4mhcfdnzj4gtc6lyvynnq

Software-based gate-level information flow security for IoT systems

Hari Cherupalli, Henry Duwe, Weidong Ye, Rakesh Kumar, John Sartori
2017 Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture - MICRO-50 '17  
The growing movement to connect literally everything to the internet (internet of things or IoT) through ultra-low-power embedded microprocessors poses a critical challenge for information security.  ...  Gate-level tracking of information flows has been proposed to guarantee information flow security in computer systems. However, such solutions rely on non-commodity, secure-by-design processors.  ...  Based on the insights and verification of GLIFT, several secureby-design processors have been built.  ... 
doi:10.1145/3123939.3123955 dblp:conf/micro/CherupalliDYKS17 fatcat:cml62si5bfcrbpacynlea7ee64

Exploiting dynamic timing slack for energy efficiency in ultra-low-power embedded systems

Hari Cherupalli, Rakesh Kumar, John Sartori
2016 SIGARCH Computer Architecture News  
Many emerging applications such as the internet of things, wearables, and sensor networks have ultra-low-power requirements.  ...  Our approach for identifying and exploiting dynamic timing slack is non-speculative, requires no programmer intervention and little or no hardware support, and demonstrates potential power savings of up  ...  INTRODUCTION A large number of computing applications have recently exploded onto the scene. Notable among them include the internet of things, wearables, and sensor networks.  ... 
doi:10.1145/3007787.3001208 fatcat:qct3tdb5onayfb3rucwmfqtt3i

Exploiting Dynamic Timing Slack for Energy Efficiency in Ultra-Low-Power Embedded Systems

Hari Cherupalli, Rakesh Kumar, John Sartori
2016 2016 ACM/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA)  
Many emerging applications such as the internet of things, wearables, and sensor networks have ultra-low-power requirements.  ...  Our approach for identifying and exploiting dynamic timing slack is non-speculative, requires no programmer intervention and little or no hardware support, and demonstrates potential power savings of up  ...  INTRODUCTION A large number of computing applications have recently exploded onto the scene. Notable among them include the internet of things, wearables, and sensor networks.  ... 
doi:10.1109/isca.2016.64 dblp:conf/isca/Cherupalli0S16 fatcat:leg2x6ix3vhf5lnqxjdsgckrjq

High-Assurance Separation Kernels: A Survey on Formal Methods [article]

Yongwang Zhao, David Sanan, Fuyuan Zhang, Yang Liu
2017 arXiv   pre-print
Finally, four challenges and their possible technical directions for future research are identified, e.g. specification bottleneck, multicore and concurrency, and automation of full formal verification  ...  More than 20 implementations of separation kernels have been developed and widely applied in critical domains, e.g., avionics/aerospace, military/defense, and medical devices.  ...  Many security and safety standards currently mandate the use of formal methods to certify correctness of separation kernels.  ... 
arXiv:1701.01535v1 fatcat:wivlgaqkmffc5nb2kalmpy77sy

Verification of program computations [article]

Christine Rizkallah, Universität Des Saarlandes, Universität Des Saarlandes
2015
The verification of checkers is feasible with current tools and leads to computations that can be completely trusted. We describe a framework to seamlessly verify certifying computations.  ...  Certifying algorithms compute in addition to each output a witness certifying that the output is correct.  ...  Mathematics in Computer Science, pages 1-17. [Noschinski et al., 2014] Noschinski, L.,). Verification of certifying computations through AutoCorres and Simpl. In NASA Formal Methods, pages 46-61.  ... 
doi:10.22028/d291-26618 fatcat:xe3n45uxizbe5g3pgbfvisgm5y

Overcoming Restraint: Composing Verification of Foreign Functions with Cogent [article]

Louis Cheung, Liam O'Connor, Christine Rizkallah
2021 pre-print
We demonstrate the feasibility of verification of mixed Cogent-C systems, and provide some insight into verification of software comprised of code in multiple languages with differing levels of static  ...  Previous verification of file systems implemented in Cogent merely assumed that their C components were correct and that they preserved the invariants of Cogent's type system.  ...  Patterson and Ahmed [18] have defined a spectrum of compiler verification theorems focusing on compositional compiler correctness, extensible through linking.  ... 
doi:10.1145/3497775.3503686 arXiv:2112.05964v1 fatcat:tortqlq7rbacxkkfyadvvp4d4i

Verified and Verifiable Computation with STV Algorithms [article]

Milad Ketab Ghale Haji Ali, University, The Australian National
2019
The framework provides a uniform and modular process of (a) producing tools that carry out verified computation with an STV algorithm and (b) synthesising means for verifying the computation carried out  ...  no (or minimal) extra verification.  ...  Also, we know of some work [18] that tries to compute the margin of victory for an STV algorithm.  ... 
doi:10.25911/5f58affacfc58 fatcat:6povdfeysrfq3kknbeme4tjuy4
« Previous Showing results 1 — 15 out of 19 results