default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTristan Crolard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c6]Steven Varoumas, Tristan Crolard:
WCET of OCaml Bytecode on Microcontrollers: An Automated Method and Its Formalisation. WCET 2019: 5:1-5:12- 2017
- [c5]Youssef El Bakouny
, Tristan Crolard, Dani Mezher:
A Coq-based synthesis of Scala programs which are correct-by-construction. FTfJP@ECOOP 2017: 4:1-4:2 - [i5]Youssef El Bakouny, Tristan Crolard, Dani Mezher:
A Coq-based synthesis of Scala programs which are correct-by-construction. CoRR abs/1706.05271 (2017) - 2015
- [c4]Tristan Crolard:
A verified abstract machine for functional coroutines. WoC 2015: 1-17 - 2013
- [c3]Pierre Courtieu, Maria-Virginia Aponte, Tristan Crolard, Zhi Zhang, Robby, Jason Belt, John Hatcliff, Jérôme Guitton, Trevor Jennings:
Towards the formalization of SPARK 2014 semantics with explicit run-time checks using coq. HILT 2013: 21-22 - 2012
- [j6]Tristan Crolard, Emmanuel Polonowski:
Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control. J. Log. Algebraic Methods Program. 81(3): 181-208 (2012) - 2011
- [i4]Tristan Crolard, Emmanuel Polonowski:
A program logic for higher-order procedural variables and non-local jumps. CoRR abs/1112.1554 (2011) - [i3]Tristan Crolard:
A Formally Specified Program Logic for Higher-Order Procedural Variables and non-local Jumps. CoRR abs/1112.1848 (2011) - [i2]Tristan Crolard, Emmanuel Polonowski:
Deriving a Hoare-Floyd logic for non-local jumps from a formulae-as-types notion of control. CoRR abs/1112.2950 (2011)
2000 – 2009
- 2009
- [j5]Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher:
Extending the loop language with higher-order procedural variables. ACM Trans. Comput. Log. 10(4): 26:1-26:37 (2009) - [i1]Tristan Crolard, Emmanuel Polonowski:
A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables. CoRR abs/0910.1020 (2009) - 2006
- [j4]Tristan Crolard, Samuel Lacas, Pierre Valarcher:
On the Expressive Power of the Loop Language. Nord. J. Comput. 13(1-2): 46-57 (2006) - 2004
- [j3]Tristan Crolard:
A Formulae-as-Types Interpretation of Subtractive Logic. J. Log. Comput. 14(4): 529-570 (2004) - [c2]Danièle Beauquier, Tristan Crolard, Evguenia Prokofieva:
Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic. TACAS 2004: 372-387 - 2001
- [j2]Tristan Crolard:
Subtractive logic. Theor. Comput. Sci. 254(1-2): 151-185 (2001)
1990 – 1999
- 1999
- [j1]Tristan Crolard:
A confluent lambda-calculus with a catch/throw mechanism. J. Funct. Program. 9(6): 625-647 (1999) - [c1]Tristan Crolard:
A type theory which is complete for Kreisel's modified realizability. Realizability Semantics and Applications@FLoC 1999: 58-73
Coauthor Index
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-04-25 05:56 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:
