default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Rahli
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Liron Cohen, Vincent Rahli:
$\text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity. Log. Methods Comput. Sci. 20(2) (2024)- [c28]Jérémie Decouchant, David Kozhaya, Vincent Rahli, Jiangshan Yu:
OneShot: View-Adapting Streamlined BFT Protocols with Trusted Execution Environments. IPDPS 2024: 1022-1033 - [c27]Liron Cohen
, Yannick Forster, Dominik Kirst, Bruno da Rocha Paiva, Vincent Rahli:
Separating Markov's Principles. LICS 2024: 28:1-28:14 - [i5]Rowdy Chotkan, Bart Cox, Vincent Rahli, Jérémie Decouchant:
Reliable Communication in Hybrid Authentication and Trust Models. CoRR abs/2408.08060 (2024) - 2023
- [c26]Liron Cohen, Vincent Rahli:
Realizing Continuity Using Stateful Computations. CSL 2023: 15:1-15:18 - [c25]Liron Cohen, Bruno da Rocha Paiva, Vincent Rahli, Ayberk Tosun:
Inductive Continuity via Brouwer Trees. MFCS 2023: 37:1-37:16 - [c24]Ali Shoker, Vincent Rahli, Jérémie Decouchant, Paulo Esteves Veríssimo:
Intrusion Resilience Systems for Modern Vehicles. VTC2023-Spring 2023: 1-7 - [i4]Ali Shoker, Vincent Rahli, Jeremie Decouchant, Paulo Esteves Veríssimo:
Intrusion Resilience Systems for Modern Vehicles. CoRR abs/2307.04184 (2023) - [i3]Liron Cohen, Vincent Rahli:
TT☐C: a Family of Extensional Type Theories with Effectful Realizers of Continuity. CoRR abs/2307.14168 (2023) - 2022
- [c23]Jérémie Decouchant, David Kozhaya, Vincent Rahli, Jiangshan Yu:
DAMYSUS: streamlined BFT consensus leveraging trusted components. EuroSys 2022: 1-16 - [c22]Liron Cohen, Vincent Rahli:
Constructing Unprejudiced Extensional Type Theories with Choices via Modalities. FSCD 2022: 10:1-10:23 - 2021
- [j9]David Kozhaya, Jérémie Decouchant, Vincent Rahli, Paulo Esteves Veríssimo:
PISTIS: An Event-Triggered Real-Time Byzantine-Resilient Protocol Suite. IEEE Trans. Parallel Distributed Syst. 32(9): 2277-2290 (2021) - [c21]Mark Bickford, Liron Cohen, Robert L. Constable, Vincent Rahli:
Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle. CSL 2021: 11:1-11:23 - [c20]Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, Sébastien Tixeuil:
Practical Byzantine Reliable Broadcast on Partially Connected Networks. ICDCS 2021: 506-516 - [i2]Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, Sébastien Tixeuil:
Practical Byzantine Reliable Broadcast on Partially Connected Networks. CoRR abs/2104.03673 (2021) - 2020
- [i1]David Kozhaya, Jeremie Decouchant, Vincent Rahli, Paulo Jorge Esteves Veríssimo:
PISTIS: From a Word-of-Mouth to a Gentleman's Agreement. CoRR abs/2007.10958 (2020)
2010 – 2019
- 2019
- [j8]Vincent Rahli, Mark Bickford, Liron Cohen, Robert L. Constable:
Bar Induction is Compatible with Constructive Type Theory. J. ACM 66(2): 13:1-13:35 (2019) - [j7]Ivana Vukotic, Vincent Rahli, Paulo Jorge Esteves Veríssimo:
Asphalion: trustworthy shielding against Byzantine faults. Proc. ACM Program. Lang. 3(OOPSLA): 138:1-138:32 (2019) - 2018
- [j6]Vincent Rahli, Mark Bickford:
Validating Brouwer's continuity principle for numbers using named exceptions. Math. Struct. Comput. Sci. 28(6): 942-990 (2018) - [c19]Vincent Rahli, Ivana Vukotic, Marcus Völp, Paulo Jorge Esteves Veríssimo:
Velisarios: Byzantine Fault-Tolerant Protocols Powered by Coq. ESOP 2018: 619-650 - [c18]Mark Bickford, Liron Cohen, Robert L. Constable, Vincent Rahli:
Computability Beyond Church-Turing via Choice Sequences. LICS 2018: 245-254 - [c17]Vincent Rahli, Liron Cohen, Mark Bickford:
A Verified Theorem Prover Backend Supported by a Monotonic Library. LPAR 2018: 564-582 - 2017
- [j5]Vincent Rahli, Joe B. Wells, John Pirie, Fairouz Kamareddine:
Skalpel: A constraint-based type error slicer for Standard ML. J. Symb. Comput. 80: 164-208 (2017) - [j4]Vincent Rahli, David Guaspari, Mark Bickford, Robert L. Constable:
EventML: Specification, verification, and implementation of crash-tolerant state machine replication systems. Sci. Comput. Program. 148: 26-48 (2017) - [c16]Rose Bohrer, Vincent Rahli, Ivana Vukotic, Marcus Völp, André Platzer:
Formally verified differential dynamic logic. CPP 2017: 208-221 - [c15]Vincent Rahli, Mark Bickford, Robert L. Constable:
Bar induction: The good, the bad, and the ugly. LICS 2017: 1-12 - [c14]Paulo Jorge Esteves Veríssimo, Marcus Völp, Jeremie Decouchant, Vincent Rahli, Francisco Rocha:
Meeting the Challenges of Critical and Extreme Dependability and Security. PRDC 2017: 92-97 - 2016
- [c13]Vincent Rahli, Mark Bickford:
A nominal exploration of intuitionism. CPP 2016: 130-141 - [c12]Vincent Rahli:
Exercising Nuprl's Open-Endedness. ICMS 2016: 18-27 - [c11]Marcus Völp, Adam Lackorzynski, Jérémie Decouchant, Vincent Rahli, Francisco Rocha, Paulo Jorge Esteves Veríssimo:
Avoiding Leakage and Synchronization Attacks through Enclave-Side Preemption Control. SysTEX@Middleware 2016: 6:1-6:6 - 2015
- [j3]Vincent Rahli, David Guaspari, Mark Bickford, Robert L. Constable:
Formal Specification, Verification, and Implementation of Fault-Tolerant Systems using EventML. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 72 (2015) - 2014
- [c10]Nicolas Schiper, Vincent Rahli, Robbert van Renesse, Mark Bickford, Robert L. Constable:
Developing Correctly Replicated Databases Using Formal Tools. DSN 2014: 395-406 - [c9]Abhishek Anand, Vincent Rahli:
Towards a Formally Verified Proof Assistant. ITP 2014: 27-44 - [c8]Abhishek Anand, Vincent Rahli:
A Generic Approach to Proofs about Substitution. LFMTP 2014: 5: 1-5: 8 - [c7]Vincent Rahli, Joe B. Wells, John Pirie, Fairouz Kamareddine:
Skalpel: A Type Error Slicer for Standard ML. LSFA 2014: 197-213 - 2013
- [c6]Vincent Rahli, Mark Bickford, Abhishek Anand:
Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types. ITP 2013: 261-278 - 2012
- [j2]Fairouz Kamareddine, Vincent Rahli, J. B. Wells:
Reducibility Proofs in the λ-Calculus. Fundam. Informaticae 121(1-4): 121-152 (2012) - [j1]Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells:
On Realisability Semantics for Intersection Types with Expansion Variables. Fundam. Informaticae 121(1-4): 153-184 (2012) - [c5]Nicolas Schiper, Vincent Rahli, Robbert van Renesse, Mark Bickford, Robert L. Constable:
ShadowDB: A Replicated Database on a Synthesized Consensus Core. HotDep 2012 - [c4]Vincent Rahli, Nicolas Schiper, Robbert van Renesse, Mark Bickford, Robert L. Constable:
A diversified and correct-by-construction broadcast service. ICNP 2012: 1-6
2000 – 2009
- 2008
- [c3]Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells:
A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables. ICTAC 2008: 171-185 - [c2]Fairouz Kamareddine, Vincent Rahli:
Simplified Reducibility Proofs of Church-Rosser for beta- and betaeta-reduction. LSFA 2008: 85-101 - 2007
- [c1]Virgile Mogbil, Vincent Rahli:
Uniform Circuits, & Boolean Proof Nets. LFCS 2007: 401-421
Coauthor Index
aka: Jérémie Decouchant
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
