[1] Andrea Corradini, Dominique Duval, Rachid Echahed, Frédéric Prost, and Leila Ribeiro. The PBPO graph transformation approach. J. Log. Algebr. Meth. Program., 103:213--231, 2019. [ bib | DOI | http ]
[2] Frédéric Prost. Quand les intelligences artificielles se font la guerre. Phébé, 29, 2018. [ bib | http ]
[3] Frédéric Prost. La machine qui pensait mille fois mieux que les autres. Phébé, 35, 2018. [ bib | http ]
[4] Frédéric Prost. Pourquoi l'IA ne sera pas un nouveau frankenstein. Phébé, 40, 2018. [ bib | http ]
[5] Frédéric Prost. Mi-homme mi-machine, voici le nouveau centaure. Phébé, 40, 2018. [ bib | http ]
[6] Frédéric Prost. IA le nouveau test de turing par l'échec. Phébé, 46, 2018. [ bib | http ]
[7] Frédéric Prost. L'anonymat bientôt un lointain souvenir. Phébé, 51, 2018. [ bib | http ]
[8] Frédéric Prost. Montre moi ton visage je te dirais qui tu aimes. Phébé, 57, 2018. [ bib | http ]
[9] Frédéric Prost. Fausses identités : quand votre souris vous trahit. Phébé, 64, 2018. [ bib | http ]
[10] Frédéric Prost. Pourquoi corrélation n'est pas raison. Phébé, 68, 2018. [ bib | http ]
[11] Frédéric Prost. Quand l'éthique se fait informatique. Phébé, 78, 2019. [ bib | http ]
[12] Frédéric Prost. Les dangers insoupçonnés de la montre connectée. Phébé, 83, 2019. [ bib | http ]
[13] Frédéric Prost. Après les "fake news" les faux visages. Phébé, 94, 2019. [ bib | http ]
[14] Frédéric Prost. Comment duper une intelligence artificielle. Phébé, 98, 2019. [ bib | http ]
[15] Frédéric Prost. Tbd. Phébé, 103, 2019. [ bib | www: ]
[16] Frédéric Prost. Intelligence artificielle : pourquoi le rapport villani manque sa cible. Le Point. [ bib | http ]
[17] Andrea Corradini, Dominique Duval, Rachid Echahed, Frédéric Prost, and Leila Ribeiro. The pbpo graph transformation approach. Journal of Logical and Algebraic Methods in Programming, 103:213 -- 231, 2019. [ bib | DOI | http ]
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.

Keywords: Rewrite systems, Graph transformation, Cloning, Algebraic methods
[18] Andrea Corradini, Dominique Duval, Rachid Echahed, Frédéric Prost, and Leila Ribeiro. The pullback-pushout approach to algebraic graph transformation. In Juan de Lara and Detlef Plump, editors, Graph Transformation - 10th International Conference, ICGT 2017, Held as Part of STAF 2017, Marburg, Germany, July 18-19, 2017, Proceedings, volume 10373 of Lecture Notes in Computer Science, pages 3--19. Springer, 2017. [ bib ]
[19] Frédéric Prost. Vers une approche scientifique et thématique de la confidentialité. In RESSI 2017: Rendez-vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, 2017. [ bib | http ]
[20] Frédéric Prost and Jisang Yoon. Parallel clustering of graphs for anonymization and recommender systems. CoRR, abs/1609.00161, 2016. [ bib | http ]
[21] Andrea Corradini, Dominique Duval, Frédéric Prost, and Leila Ribeiro. Parallelism in AGREE transformations. In Rachid Echahed and Mark Minas, editors, 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, volume 9761 of Lecture Notes in Computer Science, pages 37--53. Springer, 2016. [ bib ]
[22] Andrea Corradini, Dominique Duval, Rachid Echahed, Frédéric Prost, and Leila Ribeiro. AGREE - algebraic graph rewriting with controlled embedding. In Francesco Parisi-Presicce and Bernhard Westfechtel, editors, Graph Transformation - 8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings, volume 9151, pages 35--51. Springer, 2015. [ bib ]
[23] M. Mahlla and F. Prost. Gardner's minichess is solved. International Computer Games Association Journal, 13(4), December 2013. [ bib ]
[24] D. Duval, R. Echahed, F. Prost, and L. Ribeiro. Transformation of attributed structures with cloning. In Stefania Gnesi and Arend Rensink, editors, 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, volume 8411 of Lecture Notes in Computer Science, pages 310--324. Springer, 2014. [ bib ]
[25] F. Prost. On the impact of information technologies on society: an historical perspective through the game of chess. In A. Voronkov, editor, Turing-100, volume 10 of EPiC Series, pages 268--277. Easychair, 2012. [ bib ]
[26] D. Duval, R. Echahed, and F. Prost. Graph transformation with focus on incident edges. In Graph Transformations - 6th International Conference (ICGT 2012), volume 7562 of Lectures Notes in Computer Science, pages 156--171. Springer, 2012. [ bib ]
[27] F. Prost and L. Terras. Privacy and nomadic computing - a public-key cryptosystem based on passwords. Technical report, LIG, 2012. [ bib ]
[28] D. Duval, R. Echahed, and F. Prost. Categorical abstract rewriting systems and functoriality of graph transformation. Electronic Communications of the EASST, 41: Graph-Transformation and Visual Modeling Techniques 2011, 2011. [ bib | http ]
[29] F. Prost. Enforcing dynamic interference policy. In Proceedings of the third IEEE International Conference on Privacy, Security, Risk and Trust (PASSAT-11), 2011. [ bib | http ]
[30] F. Prost. Calcul et dépendances. Habilitation à Diriger des Recherches, Université de Grenoble, november 2010. [ bib ]
[31] D. Duval, R. Echahed, and F. Prost. Graph rewriting with polarized cloning. Technical report, LIG, 2010. [ bib | http ]
[32] F. Prost and C. Zerrari. Reasoning about entanglement and separability in quantum higher-order functions. In Proceedings of Unconventional Computation 2009 (UC'09), volume 5715 of Lecture Notes in Computer Science. Springer, 2009. [ bib | .pdf ]
[33] F. Prost. Twilight chess - a chess variant designed to rehabilitate human vs computer challenge. International Computer Games Association Journal, 32(2), 2009. [ bib ]
[34] D. Duval, R. Echahed, and F. Prost. A heterogeneous pushout approach to term-graph transformation. In Proceedings of Rewriting Techniques and Application 2009 (RTA'09), 2009. [ bib | .pdf ]
[35] Dominique Duval, Rachid Echahed, and Frédéric Prost. Modeling Pointer Redirection as Cyclic Term-graph Rewriting. Electr. Notes Theor. Comput. Sci., 176(1):65--84, 2007. [ bib ]
[36] F. Prost. Taming non-compositionality using new binders. In Proceedings of Unconventional Computation 2007 (UC'07), Lecture Notes in Computer Science, 2007. [ bib ]
[37] D. Duval, R. Echahed, and F. Prost. Adjunction for garbage collection with application to graph rewriting. In Proceedings of Rewriting Techniques and Application 2007 (RTA'07), volume 4533 of Lecture Notes in Computer Science. Springer, 2007. [ bib | .pdf ]
We investigate garbage collection of unreachable parts of rooted graphs from a 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.

[38] F. Prost and C. Zerrari. A logical analysis of entanglement and separability in quantum higher-order functions. Technical report, LIG, 2008. [ bib | http ]
[39] D. Duval, R. Echahed, and F. Prost. Modeling pointer redirection as cyclic term-graph rewriting. In Proceedings of the Third International Workshop on Term Graph Rewriting(TERMGRAPH'06), Vienna, Austria, April 2006. [ bib | .pdf ]
[40] D. Duval, R. Echahed, and F. Prost. Data-structure rewriting. Technical report, LIG, March 2005. [ bib | http ]
[41] F. Prost. Sort abstraction for static analyzes of mobile processes. In Sixth Symposium on Trends in Functional Programming (TFP' 2005), Tallinn, Estonia, September 2005. [ bib | .pdf ]
[42] R. Echahed and F. Prost. Security policy in a declarative style. In Proceedings of the 7th International Conference on Principles and Practice of Declarative Programming (PPDP '05), Lisboa, Portugal, July 2005. [ bib | .pdf ]
[43] R. Echahed and F. Prost. Handling declared information leakage. In Proceedings of Workshop on Issues in the Theory of Security (WITS'05), Long Beach, California, January 2005. [ bib | .pdf ]
[44] N. Brauner, R. Echahed, G. Finke, H. Gregor, and F. Prost. Specializing narrowing for timetable generation: A case study. In Proceedings of Practical Aspects of Declarative Languages (PADL'05), Long Beach, California, January 2005. [ bib | http ]
[45] R. Echahed, F. Prost, and W. Serwe. Statically assuring secrecy for dynamic concurrent processes. In Proceedings of the 5th International Conference on Principles and Practice of Declarative Programming (PPDP '03), Uppsala Swede, August 2003. [ bib | .ps ]
[46] R. Echahed and F. Prost. Handling harmless interference. Technical report, Leibnitz-IMAG, 46 av, Felix Viallet, 38 031 Grenoble, France, Juin 2003. [ bib | .pdf ]
[47] N. Brauner, R. Echahed, G. Finke, F. Prost, and W. Serwe. Intégration des méthodes de réécriture et de recherche opérationnelle pour la modélisation et la résolution de contraintes. In 1ere conférence francophone en gestion et ingéniérie des systèmes hospitaliers (GISEH 2003), pages 333--340, January 2003. [ bib ]
[48] R. Echahed, F. Prost, and W. Serwe. Assuring secrecy for concurrent declarative programs. Technical report, Leibnitz-IMAG, 46 av, Felix Viallet, 38 031 Grenoble, France, January 2002. [ bib | .pdf ]
[49] F. Prost. Types for static analyzis of mobile processes. Technical report, Leibnitz-IMAG, 46 av, Felix Viallet, 38 031 Grenoble, France, July 2001. [ bib | .pdf ]
[50] F. Prost. On the semantics of non-interference type-based analyses. In JFLA'001, Journées Francophones des Langages Applicatifs, January 2001. [ bib ]
[51] F. Prost. A static calculus of dependencies for the λ-cube. In Proc. of IEEE 15th Ann. Symp. on Logic in Computer Science (LICS'2000). IEEE Computer Society Press, 2000. [ bib | .ps.gz ]
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 λ-calculus. We consider all systems of the λ-cube and extend them conservatively in order to determine which parts of a λ-term may contribute to its evaluation. We show how typing information can be used to statically identify dependencies.

[52] F. Prost. A formalization of static analyses in system F. In H. Ganzinger, editor, Automated Deduction -- CADE-16, 16th International Conference on Automated Deduction, LNAI 1632, Trento, Italy, july 1999. Springer-Verlag. [ bib | .ps.gz ]
[53] F. Prost. Interprétation de l'analyse statique en théorie des types. PhD thesis, École Normale Supérieure de Lyon, december 1999. [ bib ]
[54] F. Prost. A formalization of static analyses in system f. Research Report RR1999-07, LIP, ENS Lyon, France, 1999. [ bib | .ps.Z ]
[55] F. Damiani and F. Prost. Detecting and removing dead code using rank-2 intersection. In International Workshop: TYPES'96, selected papers, volume 1512 of Lecture Notes in Computer Science. Springer-Verlag, 1998. [ bib ]
[56] F. Prost. Using ML type inference for dead code analysis. Research Report RR97-09, LIP, ENS Lyon, France, 1997. [ bib | .ps.Z ]
[57] P. Orponen and F. Prost. Parallel programming on hopfield nets. In Timo Honkela Jarmo Alander and Matti Jakobsson, editors, STEP'96 -- Genes, Nets and Symbols, pages 5--12. Publication of the Finnish Artificial Intelligence Society, 1996. [ bib ]
[58] F. Prost. Marking techniques for extraction. Research Report RR95-47, LIP, ENS Lyon, France, 1995. [ bib | .ps.Z ]

This file was generated by bibtex2html 1.98.