Inria / Raweb 2009
Presentation of the Project Pareo

Bibliography

Major publications by the team in recent years

[1]: E. Balland, C. Kirchner, P.-E. Moreau.
Formal Islands, in: 11th International Conference on Algebraic Methodology and Software Technology, Kuressaare, Estonia, M. Johnson, V. Vene (editors), LNCS, Springer-Verlag, jul 2006, vol. 4019, p. 51–65
http://www.loria.fr/~moreau/Papers/BallandKM-AMAST2006.pdf.
[2]: G. Barthe, H. Cirstea, C. Kirchner, L. Liquori.
Pure Patterns Type Systems, in: Principles of Programming Languages - POPL2003, New Orleans, USA, ACM, Jan 2003, p. 250–261.
[3]: G. Bonfante, Y. Guiraud.
Polygraphic programs and polynomial-time functions, in: Logical Methods in Computer Science, 2009, vol. 5, n^o 2:14, p. 1-37.
[4]: P. Brauner, C. Houtmann, C. Kirchner.
Principles of Superdeduction, in: Twenty-Second Annual IEEE Symposium on Logic in Computer Science - LiCS 2007, Wroclaw Pologne, IEEE Computer Society, 2007
http://dx.doi.org/10.1109/LICS.2007.37.
[5]: H. Cirstea, C. Kirchner.
The rewriting calculus - Part I and II, in: Logic Journal of the Interest Group in Pure and Applied Logics, May 2001, vol. 9, n^o 3, p. 427-498.
[6]: Y. Guiraud.
Termination orders for 3-dimensional rewriting, in: Journal of Pure and Applied Algebra, 2006, vol. 207, n^o 2, p. 341-371.
[7]: Y. Guiraud, P. Malbos.
Higher-dimensional categories with finite derivation type, in: Theory and Applications of Categories, 2009, vol. 22, n^o 18, p. 420-478.
[8]: C. Kirchner, R. Kopetz, P.-E. Moreau.
Anti-Pattern Matching, in: 16th European Symposium on Programming, Braga, Portugal, Lecture Notes in Computer Science, Springer, 2007, vol. 4421, p. 110–124
http://www.loria.fr/~moreau/Papers/KirchnerKM-2007.pdf.
[9]: P.-E. Moreau, C. Ringeissen, M. Vittek.
A Pattern Matching Compiler for Multiple Target Languages, in: 12th Conference on Compiler Construction, Warsaw (Poland), G. Hedin (editor), LNCS, Springer-Verlag, may 2003, vol. 2622, p. 61–76
http://www.loria.fr/~moreau/Papers/MoreauRV-CC2003.ps.gz.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[10]: E. Balland.
Conception d'un langage dédié à l'analyse et la transformation de programmes, Université Henri Poincaré - Nancy I, 03 2009
http://tel.archives-ouvertes.fr/tel-00435881/en/, Ph. D. Thesis.
[11]: G. Burel.
Bonnes démonstrations en déduction modulo, Université Henri Poincaré - Nancy I, 03 2009
http://tel.archives-ouvertes.fr/tel-00372596/en/, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[12]: G. Bonfante, Y. Guiraud.
Polygraphic programs and polynomial-time functions, in: Logical Methods in Computer Science (LMCS), 2009, vol. 5, n^o 2:14, p. 1-37
http://hal.inria.fr/inria-00122932/en/.
[13]: G. Burel, C. Kirchner.
Regaining Cut Admissibility in Deduction Modulo using Abstract Completion, in: Information and Computation, 2009, In Press p
http://hal.inria.fr/inria-00132964/en/.
[14]: H. Cirstea, C. Kirchner, R. Kopetz, P.-E. Moreau.
Anti-patterns for Rule-based Languages, in: Journal of Symbolic Computation, 2009
http://hal.inria.fr/inria-00429226/en/.
[15]: Y. Guiraud, P. Malbos.
Higher-dimensional categories with finite derivation type, in: Theory and Applications of Categories, 2009, vol. 22, n^o 18, p. 420-478
http://hal.archives-ouvertes.fr/hal-00326974/en/.
[16]: C. Kirchner, H. Kirchner, A. Santana De Oliveira.
Analysis of Rewrite-Based Access Control Policies, in: Electronic Notes in Theoretical Computer Science, 2009, vol. 234, p. 55-75
http://hal.inria.fr/inria-00433409/en/.
[17]: F. Nahon, C. Kirchner, H. Kirchner, P. Brauner.
Inductive Proof Search Modulo, in: Annals of Mathematics and Artificial Intelligence, 2009, vol. 55, n^o 1, p. 123-154
http://hal.inria.fr/inria-00337380/en/.

International Peer-Reviewed Conference/Proceedings

[18]: O. Andrei, H. Kirchner.
A Port Graph Calculus for Autonomic Computing and Invariant Verification, in: TERMGRAPH 2009, 5th International Workshop on Computing with Terms and Graphs, Satellite Event of ETAPS 2009, To appear in Electronic Notes in Theoretical Computer Science, Elsevier, 2009
http://hal.inria.fr/inria-00418560/en/.
[19]: F. Blanqui, C. Roux.
On the relation between sized-types based termination and semantic labelling, in: 18th EACSL Annual Conference on Computer Science Logic - CSL 09, Portugal Coimbra, 2009
http://hal.inria.fr/inria-00397689/en/.
[20]: T. Bourdier, H. Cirstea, D. J. Dougherty, H. Kirchner.
Extensional and Intensional Strategies, in: 9th International Workshop on Reduction Strategies in Rewriting and Programming - WRS'09, Brésil Brasilia, 2009
http://hal.inria.fr/inria-00429235/en/.
[21]: T. Bourdier, H. Cirstea, P.-E. Moreau, A. Santana De Oliveira.
Analysis of Lattice-Based Access Control Policies using Rewiting Systems and Tom., in: 1st Luxembourg Day on Security and Reliability, Luxembourg Luxembourg city, 2009
http://hal.inria.fr/inria-00433424/en/.
[22]: G. Burel.
Automating Theories in Intuitionistic Logic, in: 7th International Symposium on Frontiers of Combining Systems -FroCoS'09, Italie Trento, S. Ghilardi, R. Sebastiani (editors), Springer, 2009, vol. 5749, p. 181-197
http://hal.inria.fr/inria-00395934/en/.
[23]: H. Cirstea, P.-E. Moreau, A. Reilles.
TomML: A Rule Language For Structured Data, in: International RuleML Symposium on Rule Interchange and Applications - RuleML 2009, États-Unis d'Amérique Las Vegas, 2009, p. 262-271
http://hal.inria.fr/inria-00429229/en/.
[24]: H. Cirstea, P.-E. Moreau, A. Santana De Oliveira.
Rewrite Based Specification of Access Control Policies, in: 3rd International Workshop on Security and Rewriting Techniques - SecReT 2008, États-Unis d'Amérique Pittsburgh, 2009, vol. 234, p. 37-54
http://hal.inria.fr/inria-00335091/en/.
[25]: H. Huang, H. Kirchner.
Policy Composition based on Petri Nets, in: 33rd Annual IEEE International Computer Software and Applications Conference COMPSAC2009, États-Unis d'Amérique Seattle, IEEE Computer Society Press, 2009, p. 416–421
http://hal.inria.fr/inria-00433398/en/.
[26]: H. Kirchner, H. Huang.
Component-based Security Policy Design with Colored Petri Nets, in: Semantics and Algebraic Specification, Italie Udine, J. Palsbberg (editor), Springer, Marina Lenisa, 2009, vol. 5700, p. 21-42
http://hal.inria.fr/inria-00433372/en/.
[27]: C. Kirchner, P.-E. Moreau, C. Tavares.
A Type System for Tom, in: The Tenth International Workshop on Rule-Based Programming, Brésil Brasilia, 2009
http://hal.inria.fr/inria-00426439/en/.

Internal Reports

[28]: J.-C. Bach, E. Balland, P. Brauner, R. Kopetz, P.-E. Moreau, A. Reilles.
Tom Manual, 2009
http://hal.inria.fr/inria-00121885/en/, Rapport Technique.

Other Publications

[29]: T. Bourdier, H. Cirstea, M. Jaume, H. Kirchner.
On Formal Specification and Analysis of Security Policies, 2009
http://hal.inria.fr/inria-00429240/en/.
[30]: Y. Guiraud, P. Malbos.
Identities among relations for higher-dimensional rewriting systems, 2009
http://hal.archives-ouvertes.fr/hal-00426228/en/, Preprint, 16 pages.
[31]: C. Houtmann.
Three Dimensional Proofnets for Classical Logic, 2009
http://hal.inria.fr/inria-00426469/en/.
[32]: H. Huang, H. Kirchner.
Modular Security Policy Design based on Extended Petri Nets, 2009
http://hal.inria.fr/inria-00396924/en/.
[33]: H. Huang, H. Kirchner.
Secure Interoperation in Heterogeneous Systems based on Colored Petri Nets, 2009
http://hal.inria.fr/inria-00396952/en/.

References in notes

[34]: The Coq Proof Assistant, version 8.2, 2009
http://coq.inria.fr.
[35]: M. Abadi, L. Cardelli.
A Theory of Objects, Springer Verlag, 1996.
[36]: O. Andrei, H. Kirchner.
A Higher-Order Graph Calculus for Autonomic Computing, in: Graph Theory, Computational Intelligence and Thought. A Conference Celebrating Martin Charles Golumbic's 60th Birthday, Haifa Israël, 2008
http://hal.inria.fr/inria-00328554/en/.
[37]: E. Balland, P. Brauner.
Term-graph rewriting in Tom using relative positions, in: 4th International Workshop on Computing with Terms and Graphs TERMGRAPH 2007 ENTCS, Portugal Braga, I. Mackie (editor), ELSEVIER, 2008, vol. 203, p. 3-17
http://hal.inria.fr/inria-00129515/en/.
[38]: E. Balland, P.-E. Moreau.
Term-graph rewriting via explicit paths, in: RTA: International Conference on Rewriting Techniques and Applications RTA Lecture Notes in Computer Science, Autriche Hagenberg, A. Voronkov (editor), Springer, 2008, vol. 5117, p. 32-47
http://hal.inria.fr/inria-00173535/en/.
[39]: E. Balland, P. Brauner, R. Kopetz, P.-E. Moreau, A. Reilles.
Tom: Piggybacking rewriting on java, in: 18th International Conference on Rewriting Techniques and Applications - (RTA), Paris, France, Lecture Notes in Computer Science, jun 2007, vol. 4533, p. 36-47
http://hal.inria.fr/inria-00142045/en/.
[40]: G. Bonfante, Y. Guiraud.
Intensional properties of polygraphs, in: Electronic Notes in Theoretical Computer Science, 2008, vol. 203, n^o 1, p. 65-77.
[41]: P. Borovanský, C. Kirchner, H. Kirchner.
Controlling Rewriting by Rewriting, in: Proceedings of the first international workshop on rewriting logic - (WRLA), Asilomar (California), J. Meseguer (editor), Electronic Notes in Theoretical Computer Science, sep 1996, vol. 4.
[42]: P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau.
ELAN from a rewriting logic point of view, in: Theoretical Computer Science, Jul 2002, vol. 2, n^o 285, p. 155-185.
[43]: A. Burroni.
Higher-dimensional word problems with applications to equational logic, in: Theoretical Computer Science, 1993, vol. 115, n^o 1, p. 43-62.
[44]: N. Dershowitz.
Computing with Rewrite Systems, in: Information and Control, 1985, vol. 65, n^o 2/3, p. 122–157.
[45]: K. Fisher, F. Honsell, J. C. Mitchell.
A Lambda Calculus of Objects and Method Specialization, in: Nordic Journal of Computing, 1994, vol. 1, n^o 1, p. 3–37.
[46]: J.-Y. Girard, Y. Lafont, P. Taylor.
Proofs and Types, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1989, vol. 7.
[47]: J. A. Goguen, C. Kirchner, H. Kirchner, A. Mégrelis, J. Meseguer, T. Winkler.
An Introduction to OBJ-3, in: Proc. 1st CTRS Workshop, Orsay (France), J.-P. Jouannaud, S. Kaplan (editors), Lecture Notes in Computer Science, Springer-Verlag, jul 1987, vol. 308, p. 258–263, Also as internal report CRIN: 88-R-001.
[48]: Y. Guiraud.
Présentations d'opérades et systèmes de réécriture, Université Montpellier 2, 2004, Ph. D. Thesis.
[49]: Y. Guiraud.
The three dimensions of proofs, in: Annals of Pure and Applied Logic, 2006, vol. 141, n^o 1-2, p. 266-295.
[50]: Y. Guiraud.
Two polygraphic presentations of Petri nets, in: Theoretical Computer Science, 2006, vol. 360, n^o 1-3, p. 124-146.
[51]: Y. Guiraud.
Polygraphs for termination of left-linear term rewriting systems, 2007, Preprint.
[52]: H. Huang, H. Kirchner, S. Liu, W. Wu.
Handling Inheritance Violation for Secure Interoperation of Heterogeneous Systems, in: International Journal of Security and Networks, 03 2007, vol. 4, p. 223-233
http://hal.inria.fr/inria-00433391/en/, D.: Software This work was supported in part by National Natural Science Foundation of China under Grant 10701030, INRIA, and National Science Foundation of USA under grants CNS-0524429 and CCF-0627233..
[53]: B. Jay, D. Kesner.
Pure Pattern Calculus, in: European Symposium on Programming – ESOP'06, Vienna, Austria, Lecture Notes in Computer Science, Springer, March 2006, vol. 3924, p. 100-114.
[54]: J.-P. Jouannaud, H. Kirchner.
Completion of a set of rules modulo a set of Equations, in: SIAM J. of Computing, 1986, vol. 15, n^o 4, p. 1155–1194.
[55]: J.-P. Jouannaud, C. Kirchner.
Solving equations in abstract algebras: a rule-based survey of unification, in: Computational Logic. Essays in honor of Alan Robinson, Cambridge (MA, USA), J.-L. Lassez, G. Plotkin (editors), The MIT press, 1991, chap. 8, p. 257–321.
[56]: G. Kahn.
Natural Semantics, INRIA Sophia-Antipolis, feb 1987, n^o 601, Technical report.
[57]: C. Kirchner, F. Kirchner, H. Kirchner.
Strategic Computations and Deductions, in: Festchrift in honor of Peter Andrews, Studies in Logic and the Foundations of Mathematics, Elsevier, 2008.
[58]: C. Kirchner, H. Kirchner, M. Vittek.
Designing Constraint Logic Programming Languages using Computational Systems, in: Proc. 2nd CCL Workshop, La Escala (Spain), F. Orejas (editor), sep 1993.
[59]: H. Kirchner, P.-E. Moreau.
Promoting Rewriting to a Programming Language: A Compiler for Non-Deterministic Rewrite Programs in Associative-Commutative Theories, in: Journal of Functional Programming, 2001, vol. 11, n^o 2, p. 207-251
http://www.loria.fr/~moreau/Papers/KirchnerM-JFP2001.pdf.
[60]: J. W. Klop, V. van Oostrom, R. de Vrijer.
Lambda calculus with patterns, in: Theor. Comput. Sci., 2008, vol. 398, n^o 1-3, p. 16–31
http://dx.doi.org/10.1016/j.tcs.2008.01.019.
[61]: Y. Lafont.
Towards an algebraic theory of boolean circuits, in: J. Pure and Appl. Algebra, 2003, vol. 184, n^o 2-3, p. 257-310.
[62]: S. Mac Lane.
Categories for the working mathematician, 2nd, Springer, 1998.
[63]: P.-E. Moreau.
Programmation et confiance, Institut National Polytechnique de Lorraine - INPL, 06 2008
http://tel.archives-ouvertes.fr/tel-00337408/en/, Ph. D. Thesis.
[64]: P.-E. Moreau, A. Reilles.
Rules and Strategies in Java, in: 7th International Workshop on Reduction Strategies in Rewriting and Programming - WRS 2007 Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007) Electronic Notes in Theoretical Computer Science, France Paris, J. Giesl (editor), Elsevier, 2008, vol. 204, p. 71-82
http://hal.inria.fr/inria-00185698/en/.
[65]: P.-E. Moreau, C. Ringeissen, M. Vittek.
A Pattern Matching Compiler for Multiple Target Languages, in: 12th Conference on Compiler Construction - (CC), G. Hedin (editor), Lecture Notes in Computer Science, Springer-Verlag, MAY 2003, vol. 2622, p. 61–76
http://www.loria.fr/~moreau/Papers/MoreauRV-CC2003.ps.gz.
[66]: M. J. O'Donnell.
Computing in Systems Described by Equations, Lecture Notes in Computer Science, Springer-Verlag, 1977, vol. 58.
[67]: M. Parigot.
Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction, in: Logic Programming and Automated Reasoning, St Petersburg, Russia, A. Voronkov (editor), Springer, 1992, p. 190-201.
[68]: S. Peyton-Jones.
The implementation of functional programming languages, Prentice-Hall, 1987.
[69]: A. Santana De Oliveira.
Réécriture et Modularité pour les Politiques de Sécurité, Université Henri Poincaré - Nancy I, 03 2008
http://tel.archives-ouvertes.fr/tel-00335079/en/, Ph. D. Thesis.
[70]: C. Squier.
A finiteness condition for rewriting systems, in: Theoretical Computer Science, 1994, vol. 131, n^o 2, p. 271-294, Revised by Friedrich Otto and Yuji Kobayashi.
[71]: M. van den Brand, A. van Deursen, P. Klint, S. Klusener, E. A. van der Meulen.
Industrial Applications of ASF+SDF, in: AMAST '96, M. Wirsing, M. Nivat (editors), Lecture Notes in Computer Science, Springer-Verlag, 1996, vol. 1101, p. 9-18.

Logo Inria