Tristan Crolard - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2019

WCET of OCaml Bytecode on Microcontrollers: An Automated Method and Its FormalisationSteven Varoumas, Tristan Crolard. wcet 2019: [doi]

2017

A Coq-based synthesis of Scala programs which are correct-by-constructionYoussef El Bakouny, Tristan Crolard, Dani Mezher. ECOOP 2017: [doi]

2013

Towards the formalization of SPARK 2014 semantics with explicit run-time checks using coqPierre Courtieu, Maria Virginia Aponte, Tristan Crolard, Zhi Zhang, Robby, Jason Belt, John Hatcliff, Jérôme Guitton, Trevor Jennings. sigada 2013: 21-22 [doi]

2012

Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of controlTristan Crolard, Emmanuel Polonowski. jlp, 81(3):181-208, 2012. [doi]

2009

Extending the loop language with higher-order procedural variablesTristan Crolard, Emmanuel Polonowski, Pierre Valarcher. tocl, 10(4), 2009. [doi]

2006

On the Expressive Power of the Loop LanguageTristan Crolard, Samuel Lacas, Pierre Valarcher. njc, 13(1-2):46-57, 2006.

2004

Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed LogicDanièle Beauquier, Tristan Crolard, Evguenia Prokofieva. TACAS 2004: 372-387 [doi]

A Formulae-as-Types Interpretation of Subtractive LogicTristan Crolard. logcom, 14(4):529-570, 2004. [doi]

2001

Subtractive logicTristan Crolard. TCS, 254(1-2):151-185, 2001. [doi]

1999

A confluent lambda-calculus with a catch/throw mechanismTristan Crolard. JFP, 9(6):625-647, 1999.

A type theory which is complete for Kreisel s modified realizabilityTristan Crolard. ENTCS, 23(1):58-73, 1999. [doi]

Sign in or sign up to see more results.

runs on WebDSL