Vincent Rahli

Orcid: 0000-0002-5914-8224

According to our database1, Vincent Rahli authored at least 37 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
TT<sup>☐</sup><sub>C</sub>: a Family of Extensional Type Theories with Effectful Realizers of Continuity.
CoRR, 2023

Intrusion Resilience Systems for Modern Vehicles.
Proceedings of the 97th IEEE Vehicular Technology Conference, 2023

Inductive Continuity via Brouwer Trees.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Realizing Continuity Using Stateful Computations.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
Constructing Unprejudiced Extensional Type Theories with Choices via Modalities.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

DAMYSUS: streamlined BFT consensus leveraging trusted components.
Proceedings of the EuroSys '22: Seventeenth European Conference on Computer Systems, Rennes, France, April 5, 2022

2021
PISTIS: An Event-Triggered Real-Time Byzantine-Resilient Protocol Suite.
IEEE Trans. Parallel Distributed Syst., 2021

Practical Byzantine Reliable Broadcast on Partially Connected Networks.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
PISTIS: From a Word-of-Mouth to a Gentleman's Agreement.
CoRR, 2020

2019
Asphalion: trustworthy shielding against Byzantine faults.
Proc. ACM Program. Lang., 2019

Bar Induction is Compatible with Constructive Type Theory.
J. ACM, 2019

2018
Validating Brouwer's continuity principle for numbers using named exceptions.
Math. Struct. Comput. Sci., 2018

A Verified Theorem Prover Backend Supported by a Monotonic Library.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Computability Beyond Church-Turing via Choice Sequences.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Velisarios: Byzantine Fault-Tolerant Protocols Powered by Coq.
Proceedings of the Programming Languages and Systems, 2018

2017
EventML: Specification, verification, and implementation of crash-tolerant state machine replication systems.
Sci. Comput. Program., 2017

Skalpel: A constraint-based type error slicer for Standard ML.
J. Symb. Comput., 2017

Meeting the Challenges of Critical and Extreme Dependability and Security.
Proceedings of the 22nd IEEE Pacific Rim International Symposium on Dependable Computing, 2017

Bar induction: The good, the bad, and the ugly.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Formally verified differential dynamic logic.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
Avoiding Leakage and Synchronization Attacks through Enclave-Side Preemption Control.
Proceedings of the 1st Workshop on System Software for Trusted Execution, 2016

Exercising Nuprl's Open-Endedness.
Proceedings of the Mathematical Software - ICMS 2016, 2016

A nominal exploration of intuitionism.
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016

2015
Formal Specification, Verification, and Implementation of Fault-Tolerant Systems using EventML.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2015

2014
Skalpel: A Type Error Slicer for Standard ML.
Proceedings of the Ninth Workshop on Logical and Semantic Frameworks, with Applications, 2014

A Generic Approach to Proofs about Substitution.
Proceedings of the 2014 International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2014

Towards a Formally Verified Proof Assistant.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

Developing Correctly Replicated Databases Using Formal Tools.
Proceedings of the 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2014

2013
Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

2012
Reducibility Proofs in the λ-Calculus.
Fundam. Informaticae, 2012

On Realisability Semantics for Intersection Types with Expansion Variables.
Fundam. Informaticae, 2012

A diversified and correct-by-construction broadcast service.
Proceedings of the 20th IEEE International Conference on Network Protocols, 2012

ShadowDB: A Replicated Database on a Synthesized Consensus Core.
Proceedings of the Eighth Workshop on Hot Topics in System Dependability, HotDep 2012, 2012

2008
Simplified Reducibility Proofs of Church-Rosser for beta- and betaeta-reduction.
Proceedings of the Third Workshop on Logical and Semantic Frameworks with Applications, 2008

A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables.
Proceedings of the Theoretical Aspects of Computing, 2008

2007
Uniform Circuits, & Boolean Proof Nets.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007


  Loading...