Results 1-20 of 32.
((uid:50009167))

Bookmark and Share    
Full Text
Peer Reviewed
See detailVelisarios: Byzantine Fault-Tolerant Protocols Powered by Coq
Rahli, Vincent UL; Vukotic, Ivana UL; Volp, Marcus UL et al

in Velisarios: Byzantine Fault-Tolerant Protocols Powered by Coq (2018, April)

Our increasing dependence on complex and critical information infrastructures and the emerging threat of sophisticated attacks, ask for extended efforts to ensure the correctness and security of these ... [more ▼]

Our increasing dependence on complex and critical information infrastructures and the emerging threat of sophisticated attacks, ask for extended efforts to ensure the correctness and security of these systems. Byzantine fault-tolerant state-machine replication (BFT-SMR) provides a way to harden such systems. It ensures that they maintain correctness and availability in an application-agnostic way, provided that the replication protocol is correct and at least n-f out of n replicas survive arbitrary faults. This paper presents Velisarios a logic-of-events based framework implemented in Coq, which we developed to implement and reason about BFT-SMR protocols. As a case study, we present the first machine-checked proof of a crucial safety property of an implementation of the area's reference protocol: PBFT. [less ▲]

Detailed reference viewed: 51 (10 UL)
Full Text
Peer Reviewed
See detailValidating Brouwer's Continuity Principle for Numbers Using Named Exceptions
Rahli, Vincent UL; Bickford, Mark

in Mathematical Structures in Computer Science (2017)

Detailed reference viewed: 24 (2 UL)
Peer Reviewed
See detailBar Induction: The Good, the Bad, and the Ugly
Rahli, Vincent UL; Bickford, Mark; Constable, Robert

in Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2017)

Detailed reference viewed: 81 (21 UL)
Full Text
Peer Reviewed
See detailFormally Verified Differential Dynamic Logic
Bohrer, Brandon; Rahli, Vincent UL; Vukotic, Ivana UL et al

in CPP 2017 (2017)

Detailed reference viewed: 174 (42 UL)
Full Text
Peer Reviewed
See detailEventML: Specification, Verification, and Implementation of Crash-Tolerant State Machine Replication Systems
Rahli, Vincent UL; Guaspari, David; Bickford, Mark et al

in Science of Computer Programming (2017)

Detailed reference viewed: 23 (4 UL)
Full Text
Peer Reviewed
See detailAvoiding Leakage and Synchronization Attacks through Enclave-Side Preemption Control
Volp, Marcus UL; Lackorzynski, Adam; Decouchant, Jérémie UL et al

Scientific Conference (2016, December 12)

Intel SGX is the latest processor architecture promising secure code execution despite large, complex and hence potentially vulnerable legacy operating systems (OSs). However, two recent works identified ... [more ▼]

Intel SGX is the latest processor architecture promising secure code execution despite large, complex and hence potentially vulnerable legacy operating systems (OSs). However, two recent works identified vulnerabilities that allow an untrusted management OS to extract secret information from Intel SGX's enclaves, and to violate their integrity by exploiting concurrency bugs. In this work, we re-investigate delayed preemption (DP) in the context of Intel SGX. DP is a mechanism originally proposed for L4-family microkernels as disable-interrupt replacement. Recapitulating earlier results on language-based information-flow security, we illustrate the construction of leakage-free code for enclaves. However, as long as adversaries have fine-grained control over preemption timing, these solutions are impractical from a performance/complexity perspective. To overcome this, we resort to delayed preemption, and sketch a software implementation for hypervisors providing enclaves as well as a hardware extension for systems like SGX. Finally, we illustrate how static analyses for SGX may be extended to check confidentiality of preemption-delaying programs. [less ▲]

Detailed reference viewed: 188 (23 UL)
Full Text
See detailExercising Nuprl's Open-Endedness
Rahli, Vincent UL

in The 5th International Congress on Mathematical Software (2016)

Detailed reference viewed: 65 (8 UL)
Full Text
Peer Reviewed
See detailA Nominal Exploration of Intuitionism
Rahli, Vincent UL; Bickford, Mark

in The 5th ACM SIGPLAN Conference on Certified Programs and Proofs (CPP 2016) (2016)

Detailed reference viewed: 69 (13 UL)
Full Text
Peer Reviewed
See detailSkalpel: A Constraint-Based Type Error Slicer for Standard ML
Rahli, Vincent UL; Wells, Joe; Pirie, John et al

in Journal of Symbolic Computation (2016)

Detailed reference viewed: 96 (26 UL)
Full Text
Peer Reviewed
See detailCoq as a Metatheory for Nuprl with Bar Induction
Rahli, Vincent UL; Bickford, Mark

Scientific Conference (2015)

Detailed reference viewed: 62 (34 UL)
Full Text
Peer Reviewed
See detailFormal Specification, Verification, and Implementation of Fault-Tolerant Systems using EventML
Rahli, Vincent UL; Guaspari, David; Bickford, Mark et al

in EASST (2015)

Detailed reference viewed: 59 (16 UL)
Full Text
Peer Reviewed
See detailSkalpel: A Type Error Slicer for Standard ML
Rahli, Vincent UL; Wells, Joe B.; Pirie, John et al

in Electronic Notes in Theoretical Computer Science (2015)

Detailed reference viewed: 35 (1 UL)
Full Text
Peer Reviewed
See detailTowards a Formally Verified Proof Assistant
Anand, Abhishek; Rahli, Vincent UL

in Interactive Theorem Proving - 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (2014)

Detailed reference viewed: 43 (5 UL)
Full Text
See detailTowards a Formally Verified Proof Assistant (technical report)
Anand, Abhishek; Rahli, Vincent UL

Report (2014)

Detailed reference viewed: 29 (2 UL)
Full Text
Peer Reviewed
See detailA Generic Approach to Proofs about Substitution
Anand, Abhishek; Rahli, Vincent UL

in LFMTP 2014 (2014)

Detailed reference viewed: 41 (2 UL)
Full Text
Peer Reviewed
See detailA Type Theory with Partial Equivalence Relations as Types
Anand, Abhishek; Bickford, Mark; Constable, Robert L. et al

Scientific Conference (2014)

Detailed reference viewed: 40 (5 UL)
Full Text
Peer Reviewed
See detailDeveloping Correctly Replicated Databases Using Formal Tools
Schiper, Nicolas; Rahli, Vincent UL; Van Renesse, Robbert et al

in DSN 2014 (2014)

Detailed reference viewed: 22 (5 UL)
Full Text
Peer Reviewed
See detailFormal Program Optimization in Nuprl Using Computational Equivalence and Partial Types
Rahli, Vincent UL; Bickford, Mark; Anand, Abhishek

in ITP 2013 (2013)

Detailed reference viewed: 19 (1 UL)
Full Text
Peer Reviewed
See detailReducibility proofs in the lambda-calculus
Kamareddine, Fairouz; Rahli, Vincent UL; Wells, J. B.

in Fundamenta Informaticae (2012), 121

Detailed reference viewed: 18 (0 UL)