 | 2011 |
| 21 |  | David Cachera,
David Pichardie:
Programmation d'un interpréteur abstrait certifié en logique constructive.
Technique et Science Informatiques 30(4): 381-408 (2011) |
| 2010 |
| 20 |  | David Cachera,
David Pichardie:
A Certified Denotational Abstract Interpreter.
ITP 2010: 9-24 |
| 19 |  | David Cachera,
Arnaud Jobin:
Injecting Abstract Interpretations into Linear Cost Models
QAPL 2010: 64-81 |
| 18 |  | David Cachera,
Thomas P. Jensen,
Arnaud Jobin,
Pascal Sotin:
Long-run cost analysis by approximation of linear operators over dioids.
Mathematical Structures in Computer Science 20(4): 589-624 (2010) |
| 2009 |
| 17 |  | Frédéric Besson,
David Cachera,
Thomas P. Jensen,
David Pichardie:
Certified Static Analysis by Abstract Interpretation.
FOSAD 2009: 223-257 |
| 2008 |
| 16 |  | David Cachera,
Thomas P. Jensen,
Arnaud Jobin,
Pascal Sotin:
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids.
AMAST 2008: 122-138 |
| 2006 |
| 15 |  | Pascal Sotin,
David Cachera,
Thomas P. Jensen:
Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card.
Electr. Notes Theor. Comput. Sci. 164(3): 153-167 (2006) |
| 2005 |
| 14 |  | Katell Morin-Allory,
David Cachera:
Proving Parameterized Systems: The Use of Pseudo-Pipelines in Polyhedral Logic.
CHARME 2005: 376-379 |
| 13 |  | David Cachera,
Thomas P. Jensen,
David Pichardie,
Gerardo Schneider:
Certified Memory Usage Analysis.
FM 2005: 91-106 |
| 12 |  | David Cachera,
Katell Morin-Allory:
Verification of safety properties for parameterized regular systems.
ACM Trans. Embedded Comput. Syst. 4(2): 228-266 (2005) |
| 11 |  | David Cachera,
Thomas P. Jensen,
David Pichardie,
Vlad Rusu:
Extracting a data flow analyser in constructive logic.
Theor. Comput. Sci. 342(1): 56-78 (2005) |
| 2004 |
| 10 |  | David Cachera,
Thomas P. Jensen,
David Pichardie,
Vlad Rusu:
Extracting a Data Flow Analyser in Constructive Logic.
ESOP 2004: 385-400 |
| 2003 |
| 9 |  | David Cachera,
Katell Morin-Allory:
Verification of Control Properties in the Polyhedral Model.
MEMOCODE 2003: 265- |
| 8 |  | David Cachera,
David Pichardie:
Embedding of Systems of Affine Recurrence Equations in Coq.
TPHOLs 2003: 155-170 |
| 2002 |
| 7 |  | David Cachera,
Tanguy Risset:
Advances in Bit Width Selection Methodology.
ASAP 2002: 381-390 |
| 2001 |
| 6 |  | David Cachera,
Patrice Quinton,
Sanjay V. Rajopadhye,
Tanguy Risset:
Proving Properties of Multidimensional Recurrences with Application to Regular Parallel Algorithms.
IPDPS 2001: 148 |
| 1997 |
| 5 |  | Luc Bougé,
David Cachera:
A logical framework to prove properties of Alpha programs.
ASAP 1997: 187-198 |
| 4 |  | Luc Bougé,
David Cachera,
Yann Le Guyadec,
Gil Utard,
Bernard Virot:
Formal Validation of Data-Parallel Programs: A Two-Component Assertional Proof System for a Simple Language.
Theor. Comput. Sci. 189(1-2): 71-107 (1997) |
| 1996 |
| 3 |  | Luc Bougé,
David Cachera,
Yann Le Guyadec,
Gil Utard,
Bernard Virot:
Formal Validation of Data Parallel Programs: Introducting the Assertional Approach.
The Data Parallel Programming Model 1996: 252-281 |
| 2 |  | David Cachera,
Gil Utard:
Proving Data-Parallel Programs: a Unifying Approach.
Parallel Processing Letters 6(4): 491-505 (1996) |
| 1995 |
| 1 |  | Luc Bougé,
David Cachera:
On the Completeness of a Proof System for a Simple Data-Parallel Programming Language.
Euro-Par 1995: 143-154 |