-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpubli.html
executable file
·970 lines (803 loc) · 31 KB
/
publi.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
<title>David Pichardie - Home page</title>
<link href="style.css" rel="stylesheet" type="text/css" />
</head>
<body>
<a name="top" id="top"></a>
<center>
<div id="header">
<h1>David Pichardie</h1>
<h2>Publications</h2>
</div>
<div id="content">
<div id="sidebar">
<div class="submenu">
<h1>Menu</h1>
<a href="index.html">Home</a>
<a href="research.html">Research</a>
<a href="publi.html">Publications</a>
<a href="teaching.html">Teaching</a>
</div>
</div>
<div id="mainbar">
<table>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="CSF17:Barthe:al">1</a>]
</td>
<td class="bibtexitem">
Gilles Barthe, Sandrine Blazy, Vincent Laporte, David Pichardie, and Alix
Trieu.
Verified translation validation of static analyses.
In <em>IEEE 30th Computer Security Foundations Symposium, CSF
2017</em>. IEEE Computer Society, 2017.
[ <a href="publi_bib.html#CSF17:Barthe:al">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ITP17:Zakowski:al">2</a>]
</td>
<td class="bibtexitem">
Yannick Zakowski, David Cachera, Delphine Demange, Gustavo Petri, David
Pichardie, Suresh Jagannathan, and Jan Vitek.
Verifying a concurrent garbage collector using a rely-guarantee
methodology.
In <em>Proc. of the 8th International Conference on Interactive
Theorem Proving (ITP 2017)</em>, volume 10499 of <em>Lecture Notes in Computer
Science</em>. Springer-Verlag, 2017.
[ <a href="publi_bib.html#ITP17:Zakowski:al">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ESORICS17:Blazy:al">3</a>]
</td>
<td class="bibtexitem">
Sandrine Blazy, David Pichardie, and Alix Trieu.
Verifying constant-time implementations by abstract interpretation.
In <em>Proc. of the 22nd European Symposium on Research in Computer
Security (ESORICS 2017)</em>, volume 10492 of <em>Lecture Notes in Computer
Science</em>. Springer-Verlag, 2017.
[ <a href="publi_bib.html#ESORICS17:Blazy:al">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="JAR16:Blazy:al">4</a>]
</td>
<td class="bibtexitem">
Sandrine Blazy, Vincent Laporte, and David Pichardie.
Verified Abstract Interpretation Techniques for Disassembling
Low-level Self-modifying Code.
<em>Journal of Automated Reasoning</em>, 56(3):26, 2016.
[ <a href="publi_bib.html#JAR16:Blazy:al">bib</a> |
<a href="https://hal.inria.fr/hal-01243700/document">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ICFP16:Blazy:al">5</a>]
</td>
<td class="bibtexitem">
Sandrine Blazy, Vincent Laporte, and David Pichardie.
An Abstract Memory Functor for Verified C Static Analyzers.
In <em>ACM SIGPLAN International Conference on Functional
Programming (ICFP 2016)</em>, page 14, Nara, Japan, September 2016. ACM.
[ <a href="publi_bib.html#ICFP16:Blazy:al">bib</a> |
<a href="https://hal.inria.fr/hal-01339969/document">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="JCS16:Amorim:al">6</a>]
</td>
<td class="bibtexitem">
Arthur Azevedo de Amorim, Nathan Collins, André DeHon, Delphine Demange,
Catalin Hritcu, David Pichardie, Benjamin C. Pierce, Randy Pollack, and
Andrew Tolmach.
A verified information-flow architecture.
<em>Journal of Computer Security</em>, 24(6):689--734, 2016.
[ <a href="publi_bib.html#JCS16:Amorim:al">bib</a> |
<a href="https://arxiv.org/pdf/1509.06503">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ITP15:Blazy:al">7</a>]
</td>
<td class="bibtexitem">
Sandrine Blazy, Delphine Demange, and David Pichardie.
Validating dominator trees for a fast, verified dominance test.
In <em>Proc. of the 6th International Conference on Interactive
Theorem Proving (ITP 2015)</em>, Lecture Notes in Computer Science. Springer,
2015.
[ <a href="publi_bib.html#ITP15:Blazy:al">bib</a> |
<a href="papers/itp15.pdf">.pdf</a> |
<a href="publi_abstracts.html#ITP15:Blazy:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="CC15:Demange:al">8</a>]
</td>
<td class="bibtexitem">
Delphine Demange David Pichardie and Léo Stefanesco.
Verifying fast and sparse ssa-based optimizations in coq.
In <em>Proc. of the 24th International Conference on Compiler
Construction (CC 2015)</em>, Lecture Notes in Computer Science. Springer, 2015.
[ <a href="publi_bib.html#CC15:Demange:al">bib</a> |
<a href="papers/cc15.pdf">.pdf</a> |
<a href="publi_abstracts.html#CC15:Demange:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="POPL15:Jourdan:al">9</a>]
</td>
<td class="bibtexitem">
Jacques-Henri Jourdan, Vincent Laporte, Sandrine Blazy, Xavier Leroy, and David
Pichardie.
A formally-verified C static analyzer.
In <em>42nd symposium Principles of Programming Languages</em>, pages
247--259. ACM Press, 2015.
[ <a href="publi_bib.html#POPL15:Jourdan:al">bib</a> |
<a href="papers/popl15.pdf">.pdf</a> |
<a href="publi_abstracts.html#POPL15:Jourdan:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="CPP15:Blazy:al">10</a>]
</td>
<td class="bibtexitem">
Sandrine Blazy, André Maroneze, and David Pichardie.
Verified validation of program slicing.
In <em>Proc. of the 5th Conference on Certified Programs and Proofs,
CPP 2015</em>. ACM, 2015.
[ <a href="publi_bib.html#CPP15:Blazy:al">bib</a> |
<a href="papers/cpp15.pdf">.pdf</a> |
<a href="publi_abstracts.html#CPP15:Blazy:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="CCS14:Barthe:al">11</a>]
</td>
<td class="bibtexitem">
Gilles Barthe, Gustavo Betarte, Juan Diego Campo, Carlos Luna, and David
Pichardie.
System-level non-interference for constant-time cryptography.
In <em>ACM SIGSAC Conference on Computer and Communications
Security, CCS'14</em>. ACM, 2014.
[ <a href="publi_bib.html#CCS14:Barthe:al">bib</a> |
<a href="papers/ccs14.pdf">.pdf</a> |
<a href="publi_abstracts.html#CCS14:Barthe:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="TOPLAS14:Jagannathan:al">12</a>]
</td>
<td class="bibtexitem">
Suresh Jagannathan, Vincent Laporte, Gustavo Petri, David Pichardie, and Jan
Vitek.
Atomicity refinement for verified compilation.
<em>ACM Trans. Program. Lang. Syst. (TOPLAS)</em>, 36(2):1, 2014.
[ <a href="publi_bib.html#TOPLAS14:Jagannathan:al">bib</a> |
<a href="papers/toplas_pldi14.pdf">.pdf</a> |
<a href="publi_abstracts.html#TOPLAS14:Jagannathan:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="PLDI14:Jagannathan:al">13</a>]
</td>
<td class="bibtexitem">
Suresh Jagannathan, Vincent Laporte, Gustavo Petri, David Pichardie, and Jan
Vitek.
Atomicity refinement for verified compilation.
In <em>ACM SIGPLAN Conference on Programming Language Design and
Implementation, PLDI'14</em>, page 5. ACM, 2014.
Submitted and accepted to TOPLAS vol 36, presented at PLDI the same
year.
[ <a href="publi_bib.html#PLDI14:Jagannathan:al">bib</a> |
<a href="papers/toplas_pldi14.pdf">.pdf</a> |
<a href="publi_abstracts.html#PLDI14:Jagannathan:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="TOPLAS14:Barthe:al">14</a>]
</td>
<td class="bibtexitem">
Gilles Barthe, Delphine Demange, and David Pichardie.
Formal verification of an ssa-based middle-end for compcert.
<em>ACM Trans. Program. Lang. Syst. (TOPLAS)</em>, 36(1):4, 2014.
[ <a href="publi_bib.html#TOPLAS14:Barthe:al">bib</a> |
<a href="papers/toplas14.pdf">.pdf</a> |
<a href="publi_abstracts.html#TOPLAS14:Barthe:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ITP14:Blazy:al">15</a>]
</td>
<td class="bibtexitem">
Sandrine Blazy, Vincent Laporte, and David Pichardie.
Verified abstract interpretation techniques for disassembling
low-level self-modifying code.
In <em>Proc. of the 5th International Conference on Interactive
Theorem Proving (ITP 2014)</em>, volume 8558 of <em>Lecture Notes in Computer
Science</em>, pages 128--143. Springer, 2014.
[ <a href="publi_bib.html#ITP14:Blazy:al">bib</a> |
<a href="papers/itp14.pdf">.pdf</a> |
<a href="publi_abstracts.html#ITP14:Blazy:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="WCET14:Maroneze:al">16</a>]
</td>
<td class="bibtexitem">
André Maroneze, Sandrine Blazy, David Pichardie, and Isabelle Puaut.
A formally verified wcet estimation tool.
In <em>14th International Workshop on Worst-Case Execution Time
Analysis, WCET 2014, July 8, 2014, Ulm, Germany</em>, volume 39, pages 11--20.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014.
[ <a href="publi_bib.html#WCET14:Maroneze:al">bib</a> |
<a href="papers/wcet14.pdf">.pdf</a> |
<a href="publi_abstracts.html#WCET14:Maroneze:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="POPL14:Azevedo:al">17</a>]
</td>
<td class="bibtexitem">
Arthur Azevedo de Amorim, Nathan Collins, André DeHon, Delphine Demange,
Catalin Hritcu, David Pichardie, Benjamin Pierce, Randy Pollack, and Andrew
Tolmach.
A verified information-flow architecture.
In <em>Proc. of the 41th ACM SIGPLAN-SIGACT Symposium on Principles
of Programming Languages, POPL 2014</em>, pages 165--178. ACM, 2014.
[ <a href="publi_bib.html#POPL14:Azevedo:al">bib</a> |
<a href="papers/popl14.pdf">.pdf</a> |
<a href="publi_abstracts.html#POPL14:Azevedo:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="VSTTE13:Blazy:al">18</a>]
</td>
<td class="bibtexitem">
Sandrine Blazy, André Maroneze, and David Pichardie.
Formal verification of loop bound estimation for WCET analysis.
In <em>Proc. of the 5th Working Conference on Verified Software:
Theories, Tools, and Experiments (VSTTE 2013)</em>, volume 8164 of <em>Lecture
Notes in Computer Science</em>, pages 281--303. Springer-Verlag, 2013.
[ <a href="publi_bib.html#VSTTE13:Blazy:al">bib</a> |
<a href="papers/vstte13.pdf">.pdf</a> |
<a href="publi_abstracts.html#VSTTE13:Blazy:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="SAS13:Blazy:al">19</a>]
</td>
<td class="bibtexitem">
Sandrine Blazy, Vincent Laporte, André Maroneze, and David Pichardie.
Formal verification of a C value analysis based on abstract
interpretation.
In <em>Proc. of the 20th Static Analysis Symposium (SAS 2013)</em>,
volume 7935 of <em>Lecture Notes in Computer Science</em>, pages 324--344.
Springer-Verlag, 2013.
[ <a href="publi_bib.html#SAS13:Blazy:al">bib</a> |
<a href="papers/sas13.pdf">.pdf</a> |
<a href="publi_abstracts.html#SAS13:Blazy:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="POPL13:Demange:al">20</a>]
</td>
<td class="bibtexitem">
Delphine Demange, Vincent Laporte, Lei Zhao, David Pichardie, Suresh
Jagannathan, and Jan Vitek.
Plan B: A buffered memory model for Java.
In <em>Proc. of the 40th ACM SIGPLAN-SIGACT Symposium on Principles
of Programming Languages, POPL 2013</em>. ACM, 2013.
[ <a href="publi_bib.html#POPL13:Demange:al">bib</a> |
<a href="papers/popl13.pdf">.pdf</a> |
<a href="publi_abstracts.html#POPL13:Demange:al">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="MSCS13:Barthe:Pichardie:Rezk">21</a>]
</td>
<td class="bibtexitem">
Gilles Barthe, David Pichardie, and Tamara Rezk.
A certified lightweight non-interference Java bytecode verifier.
<em>Mathematical Structures in Computer Science (MSCS)</em>,
23(5):1032--1081, 2013.
[ <a href="publi_bib.html#MSCS13:Barthe:Pichardie:Rezk">bib</a> |
<a href="papers/mscs13.pdf">.pdf</a> |
<a href="publi_abstracts.html#MSCS13:Barthe:Pichardie:Rezk">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="LMCS12:Jensen:Kirchner:Pichardie">22</a>]
</td>
<td class="bibtexitem">
Thomas Jensen, Florent Kirchner, and David Pichardie.
Secure the clones: Static enforcement of policies for secure object
copying.
<em>Logical Methods in Computer Science (LMCS)</em>, 8(2), 2012.
[ <a href="publi_bib.html#LMCS12:Jensen:Kirchner:Pichardie">bib</a> |
<a href="papers/lmcs12.pdf">.pdf</a> |
<a href="publi_abstracts.html#LMCS12:Jensen:Kirchner:Pichardie">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ESOP12:Barthe:demange:Pichardie">23</a>]
</td>
<td class="bibtexitem">
Gilles Barthe, Delphine Demange, and David Pichardie.
A formally verified SSA-based middle-end - Static Single
Assignment meets CompCert.
In <em>Proc. of 21th European Symposium on Programming (ESOP 2012)</em>,
volume 7211 of <em>Lecture Notes in Computer Science</em>, pages 47--66.
Springer-Verlag, 2012.
[ <a href="publi_bib.html#ESOP12:Barthe:demange:Pichardie">bib</a> |
<a href="papers/esop12.pdf">.pdf</a> |
<a href="publi_abstracts.html#ESOP12:Barthe:demange:Pichardie">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="CPP11:Besson:Cornilleau:Pichardie">24</a>]
</td>
<td class="bibtexitem">
Frédéric Besson, Pierre-Emmanuel Cornilleau, and David Pichardie.
Modular SMT proofs for fast reflexive checking inside Coq.
In <em>Proc. of the 1st International Conference on Certified
Programs and Proofs (CPP 2011)</em>, volume 7086 of <em>Lecture Notes in
Computer Science</em>, pages 151--166. Springer-Verlag, 2011.
[ <a href="publi_bib.html#CPP11:Besson:Cornilleau:Pichardie">bib</a> |
<a href="papers/cpp11.pdf">.pdf</a> |
<a href="publi_abstracts.html#CPP11:Besson:Cornilleau:Pichardie">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ESOP11:Jensen:Kirchner:Pichardie">25</a>]
</td>
<td class="bibtexitem">
Thomas Jensen, Florent Kirchner, and David Pichardie.
Secure the clones: Static enforcement of policies for secure object
copying.
In <em>Proc. of 20th European Symposium on Programming (ESOP 2011)</em>,
volume 6602 of <em>Lecture Notes in Computer Science</em>, pages 317--337.
Springer-Verlag, 2011.
[ <a href="publi_bib.html#ESOP11:Jensen:Kirchner:Pichardie">bib</a> |
<a href="papers/esop11.pdf">.pdf</a> |
<a href="publi_abstracts.html#ESOP11:Jensen:Kirchner:Pichardie">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="TSI11:Cachera:Pichardie">26</a>]
</td>
<td class="bibtexitem">
David Cachera and David Pichardie.
Programmation d'un interpréteur abstrait certifié en logique
constructive.
<em>Technique et Science Informatiques (TSI)</em>, 30(4):381--408, 2011.
[ <a href="publi_bib.html#TSI11:Cachera:Pichardie">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="BYTECODE10:Pichardie">27</a>]
</td>
<td class="bibtexitem">
David Pichardie, editor.
<em>Fifth Workshop on Bytecode Semantics, Verification, Analysis and
Transformation (Bytecode 2010). Proceedings</em>, Electronic Notes in Theoretical
Computer Science, 2010.
[ <a href="publi_bib.html#BYTECODE10:Pichardie">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="FOVEOOS10:sawja">28</a>]
</td>
<td class="bibtexitem">
Laurent Hubert, Nicolas Barré, Frédéric Besson, Delphine Demange, Thomas
Jensen, Vincent Monfort, David Pichardie, and Tiphaine Turpin.
Sawja: Static Analysis Workshop for Java.
In <em>Proc. of the 1st International Conference on Formal
Verification of Object-Oriented Software (FoVeOOS 2010)</em>, volume 6461 of <em>
Lecture Notes in Computer Science</em>, pages 92--106. Springer-Verlag, 2010.
[ <a href="publi_bib.html#FOVEOOS10:sawja">bib</a> |
<a href="papers/foveoos10.pdf">.pdf</a> |
<a href="publi_abstracts.html#FOVEOOS10:sawja">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="APLAS10:Demange:Jensen:Pichardie">29</a>]
</td>
<td class="bibtexitem">
Delphine Demange, Thomas Jensen, and David Pichardie.
A provably correct stackless intermediate representation for Java
bytecode.
In <em>Proc. of the 8th Asian Symposium on Programming Languages and
Systems (APLAS 2010)</em>, volume 6461 of <em>Lecture Notes in Computer
Science</em>, pages 97--113. Springer-Verlag, 2010.
[ <a href="publi_bib.html#APLAS10:Demange:Jensen:Pichardie">bib</a> |
<a href="papers/aplas10.pdf">.pdf</a> |
<a href="publi_abstracts.html#APLAS10:Demange:Jensen:Pichardie">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ESORICS10:Hubert:Pichardie">30</a>]
</td>
<td class="bibtexitem">
Laurent Hubert, Thomas Jensen, Vincent Monfort, and David Pichardie.
Enforcing secure object initialization in Java.
In <em>Proc. of the 15th European Symposium on Research in Computer
Security (ESORICS 2010)</em>, volume 6345 of <em>Lecture Notes in Computer
Science</em>, pages 101--115. Springer-Verlag, 2010.
[ <a href="publi_bib.html#ESORICS10:Hubert:Pichardie">bib</a> |
<a href="papers/esorics10.pdf">.pdf</a> |
<a href="publi_abstracts.html#ESORICS10:Hubert:Pichardie">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ITP10:Cachera:Pichardie">31</a>]
</td>
<td class="bibtexitem">
David Cachera and David Pichardie.
A certified denotational abstract interpreter.
In <em>Proc. of International Conference on Interactive Theorem
Proving (ITP-10)</em>, volume 6172 of <em>Lecture Notes in Computer Science</em>,
pages 9--24. Springer-Verlag, 2010.
[ <a href="publi_bib.html#ITP10:Cachera:Pichardie">bib</a> |
<a href="papers/itp10.pdf">.pdf</a> |
<a href="publi_abstracts.html#ITP10:Cachera:Pichardie">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="TGC10:Besson:Jensen:Pichardie:Turpin">32</a>]
</td>
<td class="bibtexitem">
Frédéric Besson, Thomas Jensen, David Pichardie, and Tiphaine Turpin.
Certified result checking for polyhedral analysis of bytecode
programs.
In <em>Proc. of the 5th International Symposium on Trustworthy
Global Computing (TGC 2010)</em>, volume 6084 of <em>Lecture Notes in Computer
Science</em>, pages 253--267. Springer-Verlag, 2010.
[ <a href="publi_bib.html#TGC10:Besson:Jensen:Pichardie:Turpin">bib</a> |
<a href="papers/tgc10.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="SSTIC10:JAVASEC">33</a>]
</td>
<td class="bibtexitem">
Guillaume Hiet, Frédéric Guihéry, Goulven Guiheux, David Pichardie, and
Christian Brunette.
Sécurité de la plate-forme d'exécution Java : limites et
propositions d'améliorations.
In <em>Proc. of Symposium sur la sécurité des technologies de
l'information et des communications (SSTIC 2010)</em>, 2010.
[ <a href="publi_bib.html#SSTIC10:JAVASEC">bib</a> |
<a href="papers/sstic10.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="JCS10:Besson:Jensen:Dufay:Pichardie">34</a>]
</td>
<td class="bibtexitem">
Frédéric Besson, Thomas Jensen, Guillaume Dufay, and David Pichardie.
Verifying resource access control on mobile interactive devices.
<em>Journal of Computer Security</em>, 18(6):971--998, 2010.
[ <a href="publi_bib.html#JCS10:Besson:Jensen:Dufay:Pichardie">bib</a> |
<a href="papers/jcs10.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="FOSAD09:BessonCacheraJensenPichardie">35</a>]
</td>
<td class="bibtexitem">
Frédéric Besson, David Cachera, Thomas P. Jensen, and David Pichardie.
Certified static analysis by abstract interpretation.
In <em>Foundations of Security Analysis and Design V, FOSAD
2007/2008/2009 Tutorial Lectures</em>, volume 5705 of <em>Lecture Notes in
Computer Science</em>, pages 223--257. Springer-Verlag, 2009.
[ <a href="publi_bib.html#FOSAD09:BessonCacheraJensenPichardie">bib</a> |
<a href="papers/fosad09.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="TPHOLs09:Dabrowski:Pichardie">36</a>]
</td>
<td class="bibtexitem">
Frédéric Dabrowski and David Pichardie.
A certified data race analysis for a Java-like language.
In <em>Proc. of 22nd International Conference on Theorem Proving in
Higher Order Logics (TPHOLs'09)</em>, volume 5674 of <em>Lecture Notes in
Computer Science</em>, pages 212--227. Springer-Verlag, 2009.
[ <a href="publi_bib.html#TPHOLs09:Dabrowski:Pichardie">bib</a> |
<a href="papers/tphols09.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="NFM09:Cachera:Pichardie">37</a>]
</td>
<td class="bibtexitem">
David Cachera and David Pichardie.
Comparing techniques for certified static analysis.
<em>Proc. of the 1st NASA Formal Methods Symposium (NFM'09)</em>, pages
111--115, 2009.
[ <a href="publi_bib.html#NFM09:Cachera:Pichardie">bib</a> |
<a href="papers/nfm09.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="BYTECODE09:Hubert:Pichardie">38</a>]
</td>
<td class="bibtexitem">
Laurent Hubert and David Pichardie.
Soundly handling static fields: Issues, semantics and analysis.
<em>Proc. of the 4th International Workshop on Bytecode Semantics,
Verification, Analysis and Transformation (BYTECODE'09)</em>, 253(5):15--30,
2009.
[ <a href="publi_bib.html#BYTECODE09:Hubert:Pichardie">bib</a> |
<a href="papers/bytecode09.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="SEFM08:Barthe:Kunz:Pichardie:Forlese">39</a>]
</td>
<td class="bibtexitem">
Gilles Barthe, César Kunz, David Pichardie, and Julián Samborski Forlese.
Preservation of proof obligations for hybrid certificates.
In <em>Proc. of the 6th IEEE International Conferences on Software
Engineering and Formal Methods (SEFM'08)</em>, pages 127--136. IEEE Computer
Society, 2008.
[ <a href="publi_bib.html#SEFM08:Barthe:Kunz:Pichardie:Forlese">bib</a> |
<a href="papers/sefm08.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="FMOODS08:HubertJensenPichardie">40</a>]
</td>
<td class="bibtexitem">
Laurent Hubert, Thomas Jensen, and David Pichardie.
Semantic foundations and inference of non-null annotations.
In <em>Proc. of the 10th International Conference on Formal Methods
for Open Object-based Distributed Systems (FMOODS'08)</em>, volume 5051 of <em>
Lecture Notes in Computer Science</em>, pages 132--149. Springer-Verlag, 2008.
[ <a href="publi_bib.html#FMOODS08:HubertJensenPichardie">bib</a> |
<a href="papers/fmoods08.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="FICS08:Pichardie">41</a>]
</td>
<td class="bibtexitem">
David Pichardie.
Building certified static analysers by modular construction of
well-founded lattices.
In <em>Proc. of the 1st International Conference on Foundations of
Informatics, Computing and Software (FICS'08)</em>, volume 212 of <em>Electronic
Notes in Theoretical Computer Science</em>, pages 225--239, 2008.
[ <a href="publi_bib.html#FICS08:Pichardie">bib</a> |
<a href="papers/fics08.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="FMCO7:BCGJP">42</a>]
</td>
<td class="bibtexitem">
Gilles Barthe, Pierre Crégut, Benjamin Grégoire, Thomas Jensen, and David
Pichardie.
The MOBIUS Proof Carrying Code infrastructure.
In <em>Proc. of the 6th International Symposium on Formal Methods
for Components and Objects (FMCO'07)</em>, volume 5382 of <em>Lecture Notes in
Computer Science</em>, pages 1--24. Springer-Verlag, 2007.
[ <a href="publi_bib.html#FMCO7:BCGJP">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="BPR07">43</a>]
</td>
<td class="bibtexitem">
Gilles Barthe, David Pichardie, and Tamara Rezk.
A Certified Lightweight Non-Interference Java Bytecode Verifier.
In <em>Proc. of 16th European Symposium on Programming (ESOP'07)</em>,
volume 4421 of <em>Lecture Notes in Computer Science</em>, pages 125--140.
Springer-Verlag, 2007.
[ <a href="publi_bib.html#BPR07">bib</a> |
<a href="papers/esop07.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="TCSAppSem:BessonJensenPichardie">44</a>]
</td>
<td class="bibtexitem">
Frédéric Besson, Thomas Jensen, and David Pichardie.
Proof-carrying code from certified abstract interpretation to
fixpoint compression.
<em>Theoretical Computer Science</em>, 364(3):273--291, 2006.
[ <a href="publi_bib.html#TCSAppSem:BessonJensenPichardie">bib</a> |
<a href="papers/tcs06.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="EAAI:BessonJensenPichardie">45</a>]
</td>
<td class="bibtexitem">
Frédéric Besson, Thomas Jensen, and David Pichardie.
A PCC Architecture based on Certified Abstract Interpretation.
In <em>Proc. of 1st International Workshop on Emerging Applications
of Abstract Interpretation (EAAI'06)</em>, ENTCS. Springer-Verlag, 2006.
[ <a href="publi_bib.html#EAAI:BessonJensenPichardie">bib</a> |
<a href="papers/eaai06.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="BartheFPR06">46</a>]
</td>
<td class="bibtexitem">
Gilles Barthe, Julien Forest, David Pichardie, and Vlad Rusu.
Defining and reasoning about recursive functions: A practical tool
for the coq proof assistant.
In <em>Proc. of 8th International Symposium on Functional and Logic
Programming (FLOPS'06)</em>, volume 3945 of <em>Lecture Notes in Computer
Science</em>, pages 114--129. Springer-Verlag, 2006.
[ <a href="publi_bib.html#BartheFPR06">bib</a> |
<a href="papers/flops06.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Pich:these">47</a>]
</td>
<td class="bibtexitem">
Pichardie David.
<em>Interprétation abstraite en logique intuitionniste : extraction
d'analyseurs Java certifiés</em>.
PhD thesis, Université Rennes 1, 2005.
In french.
[ <a href="publi_bib.html#Pich:these">bib</a> |
<a href="papers/these-pichardie.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Pich05ParamConcr">48</a>]
</td>
<td class="bibtexitem">
David Pichardie.
Modular proof principles for parameterized concretizations.
In <em>Proc. of 2nd International Workshop on Construction and
Analysis of Safe, Secure and Interoperable Smart Devices (CASSIS 2005)</em>,
number 3956 in Lecture Notes in Computer Science, pages 138--154.
Springer-Verlag, 2005.
[ <a href="publi_bib.html#Pich05ParamConcr">bib</a> |
<a href="papers/param.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="CaJePiSc05MemoryUsage">49</a>]
</td>
<td class="bibtexitem">
David Cachera, Thomas Jensen, David Pichardie, and Gerardo Schneider.
Certified Memory Usage Analysis.
In <em>Proc. of 13th International Symposium on Formal Methods
(FM'05)</em>, number 3582 in Lecture Notes in Computer Science, pages 91--106.
Springer-Verlag, 2005.
[ <a href="publi_bib.html#CaJePiSc05MemoryUsage">bib</a> |
<a href="papers/memoryusage.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="CaJePiRu05TCSExtractAnalyser">50</a>]
</td>
<td class="bibtexitem">
David Cachera, Thomas Jensen, David Pichardie, and Vlad Rusu.
Extracting a Data Flow Analyser in Constructive Logic.
<em>Theoretical Computer Science</em>, 342(1):56--78, September 2005.
Extended version of [<a href="#CaJePiRu04ExtractAnalyser">51</a>].
[ <a href="publi_bib.html#CaJePiRu05TCSExtractAnalyser">bib</a> |
<a href="papers/extract_TCS.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="CaJePiRu04ExtractAnalyser">51</a>]
</td>
<td class="bibtexitem">
David Cachera, Thomas Jensen, David Pichardie, and Vlad Rusu.
Extracting a Data Flow Analyser in Constructive Logic.
In <em>Proc. of 13th European Symposium on Programming (ESOP'04)</em>,
number 2986 in Lecture Notes in Computer Science, pages 385--400.
Springer-Verlag, 2004.
[ <a href="publi_bib.html#CaJePiRu04ExtractAnalyser">bib</a> |
<a href="papers/extractDataFlow.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="GeJeKoPi04Converter">52</a>]
</td>
<td class="bibtexitem">
Thomas Genet, Thomas Jensen, Vikash Kodati, and David Pichardie.
A Java Card CAP converter in PVS.
In Jens Knoop and Wolf Zimmermann, editors, <em>Proc. of 2nd
International Workshop on Compiler Optimization Meets Compiler Verification
(COCV 2003), ENTCS</em>, volume 82. Elsevier, 2004.
[ <a href="publi_bib.html#GeJeKoPi04Converter">bib</a> |
<a href="papers/capConverter.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="CaPi03AffineRec">53</a>]
</td>
<td class="bibtexitem">
David Cachera and David Pichardie.
Embedding of Systems of Affine Recurrence Equations in Coq.
In <em>Proc. of 16th International Conference on Theorem Proving in
Higher Order Logics (TPHOLs'03)</em>, number 2758 in Lecture Notes in Computer
Science, pages 155--170. Springer-Verlag, 2003.
[ <a href="publi_bib.html#CaPi03AffineRec">bib</a> |
<a href="papers/embedSARE.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="BePi01Convexhull">54</a>]
</td>
<td class="bibtexitem">
David Pichardie and Yves Bertot.
Formalizing Convex Hulls Algorithms.
In <em>Proc. of 14th International Conference on Theorem Proving in
Higher Order Logics (TPHOLs'01)</em>, number 2152 in Lecture Notes in Computer
Science, pages 346--361. Springer-Verlag, 2001.
[ <a href="publi_bib.html#BePi01Convexhull">bib</a> |
<a href="papers/hulls.pdf">.pdf</a> ]
</td>
</tr>
</table><hr><p><em>This file was generated by
<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.98.</em></p>
</body>
</html>