Tristan Crolard

Publication Activity (10 Years)

Years Active: 1999-2019
Publications (10 Years): 4

Top Topics

Functional Programs

Top Venues

J. Log. Algebraic Methods Program.

Publications

Steven Varoumas, Tristan Crolard
WCET of OCaml Bytecode on Microcontrollers: An Automated Method and Its Formalisation. WCET (2019)
Youssef El Bakouny, Tristan Crolard, Dani Mezher
A Coq-based synthesis of Scala programs which are correct-by-construction. FTfJP@ECOOP (2017)
Youssef El Bakouny, Tristan Crolard, Dani Mezher
A Coq-based synthesis of Scala programs which are correct-by-construction. CoRR (2017)
Tristan Crolard
A verified abstract machine for functional coroutines. WoC (2015)
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)
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) (2012)
Tristan Crolard, Emmanuel Polonowski
Deriving a Hoare-Floyd logic for non-local jumps from a formulae-as-types notion of control CoRR (2011)
Tristan Crolard, Emmanuel Polonowski
A program logic for higher-order procedural variables and non-local jumps CoRR (2011)
Tristan Crolard
A Formally Specified Program Logic for Higher-Order Procedural Variables and non-local Jumps CoRR (2011)
Tristan Crolard, Emmanuel Polonowski
A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables CoRR (2009)
Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher
Extending the loop language with higher-order procedural variables. ACM Trans. Comput. Log. 10 (4) (2009)
Tristan Crolard, Samuel Lacas, Pierre Valarcher
On the Expressive Power of the Loop Language. Nord. J. Comput. 13 (1-2) (2006)
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)
Tristan Crolard
A Formulae-as-Types Interpretation of Subtractive Logic. J. Log. Comput. 14 (4) (2004)
Tristan Crolard
Subtractive logic. Theor. Comput. Sci. 254 (1-2) (2001)
Tristan Crolard
A confluent lambda-calculus with a catch/throw mechanism. J. Funct. Program. 9 (6) (1999)
Tristan Crolard
A type theory which is complete for Kreisel's modified realizability. Electron. Notes Theor. Comput. Sci. 23 (1) (1999)