|
Confluence of Prefix-Constrained Rewrite Systems
with Nirina Andrianarivelo In proc. of the third International Conference on Formal Structures for Computation and Deduction (FSCD 2018) abstract Transforming Prefix-Constrained or Controlled Rewrite Systems with Nirina Andrianarivelo and Vivien Pelletier In proc. of the 8th International Symposium on Symbolic Computation in Software Science (SCSS 2017) abstract Towards More Precise Rewriting Approximations with Yohan Boichut and Jacques Chabin In proc. of the 9th International Conference on Language and Automata Theory and Applications (LATA 2015) abstract pdf file A ToolBox for Conservative XML Schema Evolution and Document Adaptation with Joshua Amavi, Jacques Chabin and Mirian Halfeld Ferrari Alves In proc. of the 25th International Conference on Database and Expert Systems Applications (DEXA 2014) abstract pdf file Erratum of our RTA'2013 Paper with Yohan Boichut and Jacques Chabin pdf file Over-approximating Descendants by Synchronized Tree Languages with Yohan Boichut and Jacques Chabin In proc. of the 24th International Conference on Rewriting Techniques and Applications (RTA 2013) abstract pdf file Weak Inclusion for recursive XML Types with Joshua Amavi and Jacques Chabin In proc. of the 17th International Conference on Implementation and Application of Automata (CIAA 2012) abstract pdf file Weak Inclusion for XML Types with Joshua Amavi, Jacques Chabin and Mirian Halfeld-Ferrari In proc. of the 16th International Conference on Implementation and Application of Automata (CIAA 2011) abstract pdf file Minimal tree language extensions : a keystone of XML type compatibility and evolution with Jacques Chabin, Mirian Halfeld-Ferrari and Martin A. Musicante In proc. of the 7th International Colloquium on Theoretical Aspects of Computing (ICTAC 2010) abstract pdf file Visibly Pushdown Languages and Term Rewriting with Jacques Chabin In proc. of the 6th International Symposium on Frontiers of Combining Systems (2007) abstract bibtex entry postcript file Regular Sets of Descendants by Some Rewrite Strategies with Julie Vuotto In proc. of the 13th Conf. on rewrite Techniques and Applications (2002) abstract bibtex entry postcript file TTSLI: an Implementation of Tree-Tuple Synchronized Languages with Benoit Lecland In proc. of the 13th Conf. on rewrite Techniques and Applications (2002) abstract bibtex entry postcript file Weakly Regular Relations and Applications with Sébastien Limet and Helmut Seidl In proc. of the 12th Conf. on rewrite Techniques and Applications (2001) abstract bibtex entry postcript file Synchronized Tree Languages Revisited and New Applications with Valérie Gouranton and Helmut Seidl In proc. of the Conf. on Foundations of Software Science and Computation Structures (2001) abstract bibtex entry postcript file Regular Sets of Descendants for Constructor-based Rewrite Systems In proc. of the 6th Conf. on Logic for Programming and Automated Reasoning (1999) abstract bibtex entry postcript file A New Result about the Decidability of the Existential One-step Rewriting Theory with Sébastien Limet In proc. of the 10th Conf. on rewrite Techniques and Applications (1999) abstract bibtex entry postcript file Solving Disequations Modulo some Class of Rewrite Systems with Sébastien Limet In proc. of the 9th Conf. on rewrite Techniques and Applications (1998) abstract bibtex entry postcript file E-Unification by Means of Tree Tuple Synchronized Grammars with Sébastien Limet In proc. of the 22nd Colloquium on Tree Algebra and Programming (1997) abstract bibtex entry postcript file Conditional Directed Narrowing with Sébastien Limet In proc. of the 5th Conf. on Algebraic Methodology and Software Technology (1996) abstract bibtex entry postcript file |
|
Modular Termination of Prefix-Constrained Term Rewrite Systems with Nirina Andrianarivelo Information Processing Letters, vol 174, March 2022 Towards more Precise Rewriting Approximations with Yohan Boichut and Jacques Chabin Journal of Computer and System Sciences (2017) abstract pdf file Conservative Type Extensions for XML Data with Jacques Chabin, Mirian Halfeld-Ferrari, and Martin A. Musicante Transactions on Large-Scale Data and Knowledge-Centered Systems, vol IX (2013) abstract pdf file Tree Automata for Rewrite Strategies with Julie Vuotto Journal of Symbolic Computation (2004) abstract bibtex entry pdf file Regular Sets of Descendants by Leftmost Strategy with Julie Vuotto (Extended and improved version of the proceedings of WRS'2002) Electronic Notes in Theoretical Computer Science, vol 70 no 6, (2002) abstract bibtex entry postcript file E-Unification by Means of Tree Tuple Synchronized Grammars with Sébastien Limet Discrete Math and Theoretical Computer Sciences, vol 1 (1997) abstract bibtex entry |
|
Approximating any Logic Program by a CS-program
with Yohan Boichut and Vivien Pelletier In proc. of the International Workshop on Rewriting Logic and its Applications (WRLA 2018) Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems with Yohan Boichut and Vivien Pelletier In proc. of the International Workshop on Rewriting Logic and its Applications (WRLA 2016) abstract pdf file Over-Approximating Terms Reachable by Context-Sensitive Rewriting with Nirina Andrianarivelo In proc. of the 9th International Worshop on Reachability Problems (RP 2015) abstract pdf file R-Unification thanks to Synchronized-ContextFree Tree languages with Jacques Chabin and Jing Chen In proc. of the 19th Workshop on Unification (2005) abstract bibtex entry postcript file Context-free Tree Languages for Descendants with Julie Vuotto In proc. of the 5th Workshop on Rule-Based Programming (2004) Also published in ENTCS vol 124 no 1, 2005 abstract bibtex entry postcript file Regular Sets of Descendants by Leftmost Strategy with Julie Vuotto In proc. of the 2nd Workshop on Reduction Strategies in Rewriting and Programming (WRS'2002) abstract bibtex entry postcript file |
|
Transforming Prefix-Constrained or Controlled Rewrite Systems with Nirina Andrianarivelo and Vivien Pelletier Research Report 2017-01 Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems (full version) with Yohan Boichut and Vivien Pelletier Research Report 2015-03 Over-Approximating Terms Reachable by Context-Sensitive Rewriting with Nirina Andrianarivelo Research Report 2015-02 Towards more Precise Rewriting Approximations (full version) with Yohan Boichut and Jacques Chabin Research Report 2014-02 Over-approximating Descendants by Synchronized Tree Languages (full version) with Yohan Boichut and Jacques Chabin Research Report 2013-04 Weak Inclusion for recursive XML Types (full version) with Joshua Amavi and Jacques Chabin Research Report 2012-02 Weak Inclusion for XML Types (full version) with Joshua Amavi, Jacques Chabin, and Mirian Halfeld Ferrari Research Report 2011-07 Minimal Extensions of Tree Languages: Application to XML Schema Evolution with Jacques Chabin, Mirian Halfeld-Ferrari, and Martin A. Musicante Research Report 2009-06 Visibly Pushdown Languages and Term Rewriting with Jacques Chabin Research Report 2006-14 Synchronized ContextFree Tree-tuple Languages with Jacques Chabin and Jing Chen Research Report 2006-13 Context-free Tree Languages for Descendants with Julie Vuotto Research Report 2004-04 Regular Sets of Descendants by Leftmost Strategy with Julie Vuotto Research Report 2002-08 Regular Sets of Descendants by some Rewrite Strategies with Julie Vuotto Research Report 2002-01 Weakly Regular Relations and Applications with Sébastien Limet and Helmut Seidl Research Report 2000-17 Synchronized Tree Languages Revisited and New Applications with Valérie Gouranton and Helmut Seidl Research Report 2000-16 A New Result about the Decidability of the Existential One-step Rewriting Theory with Sébastien Limet Research Report 98-12 Demand-driven Search in Functional Logic Programs with Michael Hanus Research Report 98-08 E-Unification by Means of Tree Tuple Synchronized Grammars with Sébastien Limet Research Report 96-16 Directed Narrowing: An Optimization That More Often Terminates with Sébastien Limet Research Report 95-7 Conditional Directed Narrowing (including proofs) with Sébastien Limet Research Report 95-11 |
Back to Homepage