@article{DBLP:journals/corr/abs-1910-07519,
author = {Dominique Duval and
Rachid Echahed and
Fr{\'{e}}d{\'{e}}ric Prost},
title = {On foundational aspects of {RDF} and {SPARQL}},
journal = {CoRR},
volume = {abs/1910.07519},
year = {2019},
url = {http://arxiv.org/abs/1910.07519},
archiveprefix = {arXiv},
eprint = {1910.07519}
}
@article{CORRADINI2019,
title = {Algebraic graph rewriting with controlled embedding},
journal = {Theoretical Computer Science},
year = {2020},
volume = {802},
issn = {0304-3975},
doi = {https://doi.org/10.1016/j.tcs.2019.06.004},
url = {http://www.sciencedirect.com/science/article/pii/S0304397519303871},
author = {Andrea Corradini and Dominique Duval and Rachid Echahed and Frédéric Prost and Leila Ribeiro},
keywords = {Rewrite Systems, Graph Transformation, Algebraic Methods},
abstract = {Graph transformation is a specification technique suitable for a wide range of applications, specially the ones that require a sophisticated notion of state. In graph transformation, states are represented by graphs and actions are specified by rules. Most algebraic approaches to graph transformation proposed in the literature ensure that if an item is preserved by a rule, so are its connections with the graph where it is embedded. But there are applications in which it is desirable to specify different embeddings. For example when cloning an item, there may be a need to handle the original and the copy in different ways. We propose a new algebraic approach to graph transformation, AGREE: Algebraic Graph Rewriting with controllEd Embedding, where rules allow one to specify how the embedding should be carried out. We define this approach in the framework of classified categories which are categories endowed with partial map classifiers. This new approach leads to graph transformations in which effects may be non-local, e.g. a rewrite step may alter a node of the host graph which is outside the image of the left-hand side of the considered rule. We propose a syntactic condition on AGREE rules which guarantees the locality of transformations. We also compare AGREE with other algebraic approaches to graph transformation.}
}
@article{CorradiniDEPR19,
author = {Andrea Corradini and Dominique Duval and Rachid Echahed
and Fr{\'{e}}d{\'{e}}ric Prost and Leila Ribeiro},
title = {The {PBPO} graph transformation approach},
journal = {J. Log. Algebr. Meth. Program.},
volume = {103},
pages = {213--231},
year = {2019},
url = {https://doi.org/10.1016/j.jlamp.2018.12.003},
doi = {10.1016/j.jlamp.2018.12.003}
}
@article{ProstPh2018_1,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Quand les intelligences artificielles se font la guerre},
journal = {Ph\'eb\'e},
volume = {29},
year = {2018},
url = {https://phebe.lepoint.fr/quand-les-intelligences-artificielles-se-font-la-guerre-2186366}
}
@article{ProstPh2018_2,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {La machine qui pensait mille fois mieux que les autres},
journal = {Ph\'eb\'e},
volume = {35},
year = {2018},
url = {https://phebe.lepoint.fr/la-machine-qui-pensait-mille-fois-mieux-que-les-autres-2197675}
}
@article{ProstPh2018_3,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Pourquoi l'{IA} ne sera pas un nouveau Frankenstein},
journal = {Ph\'eb\'e},
volume = {40},
year = {2018},
url = {https://phebe.lepoint.fr/pourquoi-l-ia-ne-sera-pas-un-nouveau-frankenstein-2207116}
}
@article{ProstPh2018_4,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Mi-homme mi-machine, voici le nouveau centaure},
journal = {Ph\'eb\'e},
volume = {40},
year = {2018},
url = {https://phebe.lepoint.fr/mi-homme-mi-machine-voici-le-nouveau-centaure-2207118}
}
@article{ProstPh2018_5,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {I{A} le nouveau test de Turing par l'\'echec},
journal = {Ph\'eb\'e},
volume = {46},
year = {2018},
url = {https://phebe.lepoint.fr/ia-le-nouveau-test-de-turing-par-l-echec-2215929}
}
@article{ProstPh2018_6,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {L'anonymat bient\^ot un lointain souvenir},
journal = {Ph\'eb\'e},
volume = {51},
year = {2018},
url = {https://phebe.lepoint.fr/l-anonymat-bientot-un-lointain-souvenir-2225506}
}
@article{ProstPh2018_7,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Montre moi ton visage je te dirais qui tu aimes},
journal = {Ph\'eb\'e},
volume = {57},
year = {2018},
url = {https://phebe.lepoint.fr/montre-moi-ton-visage-je-te-dirai-qui-tu-aimes-2238429}
}
@article{ProstPh2018_8,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Fausses identit\'es : quand votre souris vous trahit},
journal = {Ph\'eb\'e},
volume = {64},
year = {2018},
url = {https://phebe.lepoint.fr/fausses-identites-quand-notre-souris-nous-trahit-2258684}
}
@article{ProstPh2018_9,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Pourquoi corr\'elation n'est pas raison},
journal = {Ph\'eb\'e},
volume = {68},
year = {2018},
url = {https://phebe.lepoint.fr/pourquoi-correlation-n-est-pas-raison-2267127}
}
@article{ProstPh2019_1,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Quand l'\'ethique se fait informatique},
journal = {Ph\'eb\'e},
volume = {78},
year = {2019},
url = {https://www.lepoint.fr/phebe/phebe-quand-l-ethique-se-fait-informatique-11-01-2019-2285029_3590.php}
}
@article{ProstPh2019_2,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Les dangers insoupçonn\'es de la montre connect\'ee},
journal = {Ph\'eb\'e},
volume = {83},
year = {2019},
url = {https://www.lepoint.fr/phebe/phebe-les-dangers-insoupconnes-de-la-montre-connectee-15-02-2019-2293659_3590.php}
}
@article{ProstPh2019_3,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Après les "Fake News" les faux visages},
journal = {Ph\'eb\'e},
volume = {94},
year = {2019},
url = {https://www.lepoint.fr/phebe/phebe-apres-les-fake-news-les-faux-visages-29-04-2019-2309907_3590.php}
}
@article{ProstPh2019_4,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Comment duper une intelligence artificielle},
journal = {Ph\'eb\'e},
volume = {98},
year = {2019},
url = {https://www.lepoint.fr/phebe/phebe-comment-duper-une-intelligence-artificielle-05-06-2019-2316982_3590.php}
}
@article{ProstPh2019_5,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Lire dans les Pens\'ees, Bient\^ot une r\'ealit\'e},
journal = {Ph\'eb\'e},
volume = {103},
year = {2019},
url = {TBD}
}
@article{ProstPoint2018,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Intelligence Artificielle : pourquoi le rapport Villani manque sa cible},
journal = {Le Point},
date = {10 mai 2018},
url = {https://www.lepoint.fr/high-tech-internet/tribune-intelligence-artificielle-pourquoi-le-rapport-villani-manque-sa-cible-10-05-2018-2217453_47.php}
}
@article{CORRADINI2019213,
title = {The PBPO graph transformation approach},
journal = {Journal of Logical and Algebraic Methods in Programming},
volume = {103},
pages = {213 - 231},
year = {2019},
issn = {2352-2208},
doi = {https://doi.org/10.1016/j.jlamp.2018.12.003},
url = {http://www.sciencedirect.com/science/article/pii/S2352220818300038},
author = {Andrea Corradini and Dominique Duval and Rachid Echahed and Fr\'ed\'eric Prost and Leila Ribeiro},
keywords = {Rewrite systems, Graph transformation, Cloning, Algebraic methods},
abstract = {We propose a new algebraic approach to graph transformation, called the Pullback-Pushout (pbpo ) approach, where we combine smoothly the classical modifications to a host graph specified by a first part of a rule, defined as a span of graph morphisms, with the cloning of structures specified by a second span. The motivation behind this new approach is to support cloning of structures in an elegant and efficient way. After a formal definition of the proposed approach, we demonstrate that pbpo rewriting is a conservative extension of agree and the Sesqui-Pushout approaches. Contrary to agree, we show that the proposed pbpo transformation can easily be extended to cope with attributed graphs. In general, totally attributed graphs are not closed under pbpo transformation. We propose sufficient conditions which guarantee that the attribution of transformed graphs is total. Furthermore, a pbpo transformation can affect all parts of a host graph including non local parts (i.e., parts which are outside the image of the left-hand side of a rule). We propose and discuss some conditions which ensure a form of locality of pbpo transformations.}
}
@inproceedings{CorradiniDEPR17,
author = {Andrea Corradini and
Dominique Duval and
Rachid Echahed and
Fr{\'{e}}d{\'{e}}ric Prost and
Leila Ribeiro},
title = {The Pullback-Pushout Approach to Algebraic Graph Transformation},
booktitle = {Graph Transformation - 10th International Conference, {ICGT} 2017,
Held as Part of {STAF} 2017, Marburg, Germany, July 18-19, 2017, Proceedings},
pages = {3--19},
editor = {Juan de Lara and
Detlef Plump},
series = {Lecture Notes in Computer Science},
volume = {10373},
publisher = {Springer},
year = {2017}
}
@inproceedings{Pro2017,
author = {Fr{\'{e}}d{\'{e}}ric Prost},
title = {Vers une approche scientifique et th{\'{e}}matique de
la confidentialit{\'{e}}},
url = {https://ressi2017.sciencesconf.org/129338/document},
booktitle = {RESSI 2017: Rendez-vous de la Recherche et de
l'Enseignement de la S{\'{e}}curit{\'{e}} des Syst{\`{e}}mes
d'Information},
year = {2017}
}
@article{ProstY16,
author = {Fr{\'{e}}d{\'{e}}ric Prost and
Jisang Yoon},
title = {Parallel Clustering of Graphs for Anonymization and Recommender Systems},
journal = {CoRR},
volume = {abs/1609.00161},
year = {2016},
url = {http://arxiv.org/abs/1609.00161}
}
@inproceedings{DBLP:conf/gg/CorradiniDPR16,
author = {Andrea Corradini and
Dominique Duval and
Fr{\'{e}}d{\'{e}}ric Prost and
Leila Ribeiro},
title = {Parallelism in {AGREE} Transformations},
booktitle = {Graph Transformation - 9th International Conference, {ICGT} 2016,
in Memory of Hartmut Ehrig, Held as Part of {STAF} 2016, Vienna, Austria,
July 5-6, 2016, Proceedings},
pages = {37--53},
year = {2016},
volume = {9761},
publisher = {Springer},
editor = {Rachid Echahed and
Mark Minas},
series = {Lecture Notes in Computer Science}
}
@inproceedings{Pro15,
author = {Andrea Corradini and
Dominique Duval and
Rachid Echahed and
Fr{\'{e}}d{\'{e}}ric Prost and
Leila Ribeiro},
title = {{AGREE} - Algebraic Graph Rewriting with Controlled Embedding},
booktitle = {Graph Transformation - 8th International Conference, {ICGT} 2015,
Held as Part of {STAF} 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings},
pages = {35--51},
volume = {9151},
publisher = {Springer},
editor = {Francesco Parisi{-}Presicce and
Bernhard Westfechtel},
year = {2015}
}
@article{Pro14b,
author = {M. Mahlla and F. Prost},
title = {Gardner's Minichess is solved},
journal = {International Computer Games Association Journal},
year = {2013},
volume = {13},
number = {4},
month = {December}
}
@inproceedings{Pro14,
author = {D. Duval and R. Echahed and F. Prost and L. Ribeiro},
title = {Transformation of Attributed Structures with Cloning},
booktitle = {Fundamental Approaches to Software Engineering -
17th International
Conference, FASE 2014, Held as Part of the European Joint
Conferences on Theory and Practice of Software, ETAPS 2014,
Grenoble, France, March 16-24, 2013. Proceedings},
pages = {310--324},
editor = {Stefania Gnesi and
Arend Rensink},
volume = {8411},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
year = {2014}
}
@inproceedings{Pro12,
author = {F. Prost},
title = {On the impact of information technologies on society:
an historical perspective through the game of chess},
booktitle = {Turing-100},
year = {2012},
editor = {A. Voronkov},
volume = {10},
series = {EPiC Series},
pages = {268-277},
publisher = {Easychair}
}
@inproceedings{DuvEchPro12,
author = {D. Duval and R. Echahed and F. Prost},
title = {Graph transformation with focus on incident edges},
booktitle = {Graph Transformations - 6th International
Conference (ICGT 2012)},
year = {2012},
volume = {7562},
series = {Lectures Notes in Computer Science},
pages = {156-171},
publisher = {Springer}
}
@techreport{ProTer12,
author = {F. Prost and L. Terras},
title = {Privacy and nomadic computing - a public-key cryptosystem
based on passwords},
institution = {LIG},
year = {2012}
}
@article{DuvEchPro11a,
author = {D. Duval and R. Echahed and F. Prost},
title = {Categorical Abstract Rewriting Systems and
Functoriality of Graph Transformation},
journal = { Electronic Communications of the EASST},
volume = {41: Graph-Transformation and Visual Modeling Techniques
2011},
year = {2011},
editor = {F. Gadducci and L. Mariani},
url = {http://journal.ub.tu-berlin.de/eceasst/article/view/612/683}
}
@inproceedings{Pro011,
author = {F. Prost},
title = {Enforcing Dynamic Interference Policy},
booktitle = {Proceedings of the third IEEE International Conference on Privacy,
Security, Risk and Trust (PASSAT-11)},
year = {2011},
url = {http://www.iisocialcom.org/conference/passat2011/PASSATProceedings.zip}
}
@phdthesis{ProstHDR,
author = {F. Prost},
title = {Calcul et d\'{e}pendances},
school = {Universit\'{e} de Grenoble},
type = {Habilitation \`a {D}iriger des {R}echerches},
year = {2010},
month = {november}
}
@techreport{DEP10,
author = {D. Duval and R. Echahed and F. Prost},
title = {Graph rewriting with Polarized Cloning},
institution = {LIG},
year = {2010},
url = {http://arxiv.org/abs/0911.3786}
}
@inproceedings{Pro09,
author = {F. Prost and C. Zerrari},
title = {Reasoning about entanglement and
separability in quantum higher-order functions},
booktitle = {Proceedings of Unconventional Computation 2009 (UC'09)},
series = {Lecture Notes in Computer Science},
year = {2009},
volume = {5715},
publisher = {Springer},
url = {http://membres-liglab.imag.fr/prost/Papers/Separability_FP_CZ_UC09.pdf}
}
@article{Pro09b,
author = {F. Prost},
title = {Twilight Chess - A Chess Variant Designed to
Rehabilitate Human vs Computer Challenge},
journal = {International Computer Games Association Journal},
year = {2009},
volume = {32},
number = {2}
}
@inproceedings{DuvEchPro09,
author = {D. Duval and R. Echahed and F. Prost},
title = {A Heterogeneous Pushout Approach to Term-Graph Transformation},
booktitle = {Proceedings of Rewriting Techniques and Application 2009 (RTA'09)},
year = {2009},
url = {http://membres-liglab.imag.fr/prost/Papers/DEP_Clone.pdf}
}
@article{dblp:journals/entcs/duvalep07,
number = {1},
created-at = {Mon May 18 11:56:29 UTC 2009},
title = {{M}odeling {P}ointer {R}edirection as {C}yclic {T}erm-graph {R}ewriting},
updated-at = {Mon May 18 11:56:30 UTC 2009},
journal = {Electr. Notes Theor. Comput. Sci.},
volume = {176},
pages = {65-84},
year = {2007},
author = {Duval, Dominique and Echahed, Rachid and Prost, Fr{\'e}d{\'e}ric}
}
@inproceedings{Pro07,
author = {F. Prost},
title = {Taming Non-Compositionality Using New Binders},
booktitle = {Proceedings of Unconventional Computation 2007 (UC'07)},
series = {Lecture Notes in Computer Science},
year = {2007}
}
@inproceedings{DuvEchPro07,
author = {D. Duval and R. Echahed and F. Prost},
title = {Adjunction for Garbage Collection with Application to
Graph Rewriting},
abstract = {We investigate garbage collection of unreachable parts of rooted
graphs from a \textit{categorical} point of view. First, we define this
task as the right adjoint of an inclusion functor. We also show that
garbage collection may be stated via a left adjoint, hence preserving
colimits, followed by two right adjoints. These three adjoints cope
well with the different phases of a traditional garbage
collector. Consequently, our results should naturally help to better
formulate graph transformation steps in order to get rid of garbage
(unwanted nodes). We illustrate this point on a particular class of
graph rewriting systems based on a double pushout approach and
featuring edge redirection. Our approach gives a neat rewriting step
akin to the one on terms, where garbage never appears in the reduced
term. },
booktitle = {Proceedings of Rewriting Techniques and Application 2007 (RTA'07)},
year = {2007},
series = {Lecture Notes in Computer Science},
volume = {4533},
publisher = {Springer},
url = {http://membres-liglab.imag.fr/prost/Papers/DuvalEchahedProst_RTA07.pdf}
}
@techreport{ProZer07,
author = {F. Prost and C. Zerrari},
title = {A logical analysis of entanglement and separability
in quantum higher-order functions},
institution = {LIG},
year = {2008},
url = {http://arxiv.org/abs/0801.0649}
}
@inproceedings{DuvEchPro06,
author = {D. Duval and R. Echahed and F. Prost},
title = {Modeling Pointer Redirection as Cyclic
Term-graph Rewriting},
booktitle = {Proceedings of the Third International
Workshop on Term Graph Rewriting(TERMGRAPH'06)},
year = {2006},
address = {Vienna, Austria},
url = {http://membres-liglab.imag.fr/prost/Papers/DuvalEchahedProst_TERMGRAPH06.pdf},
month = {April}
}
@techreport{EchDuvPro05,
author = {D. Duval and R. Echahed and F. Prost},
title = {Data-Structure Rewriting},
institution = {LIG},
year = {2005},
month = {March},
url = {http://hal.ccsd.cnrs.fr/ccsd-00004558}
}
@inproceedings{Pro05,
author = {F. Prost},
title = {Sort Abstraction for Static Analyzes
of Mobile Processes},
booktitle = {Sixth Symposium on Trends in Functional Programming (TFP' 2005)},
year = {2005},
address = {Tallinn, Estonia},
month = {September},
url = {http://membres-liglab.imag.fr/prost/Papers/TFP05.pdf}
}
@inproceedings{EchPro05b,
author = {R. Echahed and F. Prost},
title = {Security Policy in a Declarative Style},
booktitle = {Proceedings of the $7^{\mathit{th}}$
International Conference on Principles and Practice of
Declarative Programming (PPDP '05)},
year = {2005},
address = {Lisboa, Portugal},
month = {July},
url = {http://membres-liglab.imag.fr/prost/Papers/PPDP05.pdf}
}
@inproceedings{EchPro05a,
author = {R. Echahed and F. Prost},
title = {Handling Declared Information Leakage},
booktitle = {Proceedings of Workshop on Issues in the
Theory of Security (WITS'05)},
year = {2005},
address = {Long Beach, California},
month = {January},
url = {http://membres-liglab.imag.fr/prost/Papers/WITS05.pdf}
}
@inproceedings{BraunEchFinGrePro05,
author = {N. Brauner and R. Echahed and G. Finke and H. Gregor and F. Prost },
title = {Specializing Narrowing for Timetable Generation: A Case Study.},
booktitle = {Proceedings of Practical Aspects of Declarative Languages (PADL'05)},
address = {Long Beach, California},
year = {2005},
url = {http://www.springerlink.com/content/b5ngc0vq6l4qw3q8/},
month = {January}
}
@inproceedings{EchProSer03,
author = {R. Echahed and F. Prost and W. Serwe},
title = {Statically Assuring Secrecy for Dynamic Concurrent Processes},
booktitle = {Proceedings of the $5^{\mathit{th}}$
International Conference on Principles and Practice of
Declarative Programming (PPDP '03)},
year = {2003},
address = {Uppsala Swede},
url = {http://membres-liglab.imag.fr/prost/Papers/PPDP03.ps},
month = {August}
}
@techreport{EchPro03,
author = {R. Echahed and F. Prost},
title = {Handling Harmless Interference},
institution = {Leibnitz-IMAG},
year = {2003},
address = {46 av, Felix Viallet, 38 031 Grenoble, France},
month = {Juin},
url = {http://www-leibniz.imag.fr/NEWLEIBNIZ/LesCahiers/2003/Cahier82/CLLeib82.pdf}
}
@inproceedings{Giseh03,
author = {N. Brauner and R. Echahed and G. Finke and F. Prost and
W. Serwe},
title = {Int\'egration des m\'ethodes de r\'e\'ecriture et de
recherche op\'erationnelle pour la mod\'elisation et la
r\'esolution de contraintes },
booktitle = {1$^{ere}$ conf\'erence francophone en gestion et
ing\'eni\'erie des syst\`emes hospitaliers (GISEH 2003)},
pages = {333-340},
year = {2003},
month = {January}
}
@techreport{EchProSer02,
author = {R. Echahed and F. Prost and W. Serwe},
title = {Assuring Secrecy for Concurrent Declarative Programs},
institution = {Leibnitz-IMAG},
year = {2002},
address = {46 av, Felix Viallet, 38 031 Grenoble, France},
month = {January},
url = {http://www-leibniz.imag.fr/NEWLEIBNIZ/LesCahiers/2002/Cahier40/CLLeib40.pdf}
}
@techreport{TypMobAn,
author = {F. Prost},
title = {Types for Static Analyzis of Mobile Processes},
institution = {Leibnitz-IMAG},
year = {2001},
address = {46 av, Felix Viallet, 38 031 Grenoble, France},
month = {July},
url = {http://www-leibniz.imag.fr/NEWLEIBNIZ/LesCahiers/2001/Cahier29/CLLeib29.pdf}
}
@inproceedings{Pro01,
author = {F. Prost},
title = {On the Semantics of Non-Interference Type-based Analyses},
booktitle = {JFLA'001, Journ\'ees Francophones des Langages Applicatifs},
month = {January},
year = {2001}
}
@inproceedings{Prostcube,
author = {F. Prost},
title = {A Static Calculus of Dependencies for the $\lambda$-cube},
booktitle = {Proc. of IEEE 15th Ann. Symp. on Logic in Computer Science (LICS'2000)},
year = 2000,
publisher = {IEEE Computer Society Press},
url = {http://membres-liglag.imag.fr/prost/Papers/LICS00.ps.gz},
abstract = {
Dependency analysis consists in finding how different parts of a program depend one from
each other. It is the root of many program analyses such as dead-code, binding time,
strictness, program slicing etc.
We address the problem of dependency analysis in the context of typed $\lambda$-calculus. We
consider all systems of the $\lambda$-cube and extend them conservatively in order to
determine which parts of a $\lambda$-term may contribute to its evaluation. We show how
typing information can be used to statically identify dependencies. }
}
@inproceedings{ProstForm,
title = {A Formalization of Static Analyses in System {F}},
author = {F. Prost},
editor = {Ganzinger, H.},
booktitle = {Automated Deduction -- CADE-16, 16th International Conference on
Automated Deduction},
year = {1999},
month = {july},
address = {Trento, Italy},
series = {LNAI 1632},
url = {http://membres-liglab.imag.fr/prost/Papers/CADE99.ps.gz},
publisher = {Springer-Verlag}
}
@phdthesis{ProstTh,
author = {F. Prost},
title = {Interpr\'etation de l'analyse statique en th\'eorie des types},
school = {\'Ecole Normale Sup\'erieure de Lyon},
year = {1999},
month = {december}
}
@misc{ProF,
author = {F. Prost},
title = {A formalization of Static Analyses in System F.},
year = {1999},
howpublished = {Research Report RR1999-07, LIP, ENS
Lyon, France},
url = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1999/RR1999-07.ps.Z}
}
@inproceedings{DamianiProst,
author = {F. Damiani and F. Prost},
title = {Detecting and Removing Dead Code Using Rank-2 Intersection},
booktitle = {International Workshop: TYPES'96, selected papers},
volume = {1512},
series = {Lecture Notes in Computer Science},
year = {1998},
publisher = {Springer-Verlag}
}
@misc{ProML,
author = {F. Prost},
title = {Using {ML} Type Inference for Dead Code Analysis},
year = {1997},
howpublished = {Research Report RR97-09, LIP, ENS
Lyon, France},
url = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1997/RR1997-09.ps.Z}
}
@inproceedings{ProstOrpo,
author = {P. Orponen and F. Prost},
title = {Parallel Programming on Hopfield Nets},
booktitle = {STEP'96 -- Genes, Nets and Symbols},
editor = {Jarmo Alander, Timo Honkela and Matti Jakobsson},
year = {1996},
publisher = {Publication of the Finnish Artificial Intelligence Society},
pages = {5-12}
}
@misc{ProstMark,
author = {F. Prost},
title = {Marking Techniques for Extraction},
year = {1995},
howpublished = {Research Report RR95-47, LIP, ENS
Lyon, France},
url = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1995/RR1995-47.ps.Z}
}
This file was generated by bibtex2html 1.98.