Irène Guessarian

Patrick Cégielski, Irène Guessarian: Normalization of Some Extended Abstract State Machines. Fields of Logic and Computation 2010: 165-180

Eugénie Foustoucos, Irène Guessarian: Inf-datalog, Modal Logic and Complexities. ITA 43(1): 1-21 (2009)

Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich: Tree inclusion problems. ITA 42(1): 5-20 (2008)

Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich: Multiple serial episodes matching. Inf. Process. Lett. 98(6): 211-218 (2006)

Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri Matiyasevich: Window Subsequence Problems for Compressed Texts. CSR 2006: 127-136

Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich: Multiple serial episode matching. CoRR abs/cs/0603050 (2006)

Ahmed Ait-Bouziad, Irène Guessarian, Laurent Vieille: Automatic generation of simplified weakest preconditions for integrity constraint verification. CoRR abs/cs/0603053 (2006)

Eugénie Foustoucos, Irène Guessarian: Complexity of Monadic inf-datalog. Application to temporal logic. CoRR abs/cs/0603122 (2006)

Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, Eugénie Foustoucos, Irène Guessarian: On relating CTL to Datalog. CoRR abs/cs/0510012 (2005)

Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati: On temporal logic versus datalog. Theor. Comput. Sci. 1(303): 103-133 (2003)

Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, E. Foustoukos, Irène Guessarian: From CTL to Datalog. PCK50 2003: 72-85

Irène Guessarian: Editorial. J. Log. Comput. 12(2): 215 (2002)

Foto N. Afrati, Irène Guessarian, Michel de Rougemont: The expressiveness of DAC. Theor. Comput. Sci. 286(1): 3-32 (2002)

Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich: Window-accumulated subsequence matching problem is linear. Ann. Pure Appl. Logic 113(1-3): 59-80 (2001)

Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich: Window-Accumulated Subsequence Matching Problem is Linear. PODS 1999: 327-336

N. Bensaou, Irène Guessarian: Transforming Constraint Logic Programs. Theor. Comput. Sci. 206(1-2): 81-125 (1998)

Jozef Gruska, Irène Guessarian: Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations. Journal of Automata, Languages and Combinatorics 2(2): 93-134 (1997)

Foto N. Afrati, Irène Guessarian, Michel de Rougemont: The Expressiveness of Datalog Circuits (DAC). MFCS 1997: 119-128

Irène Guessarian, Jean-Eric Pin: Linearizing Some Recursive Logic Programs. IEEE Trans. Knowl. Data Eng. 7(1): 137-149 (1995)

Irène Guessarian, Marcos Veloso Peixoto: About Boundedness for Some Datalog and Datalog^neg Programs. J. Log. Comput. 4(4): 375-403 (1994)

Jozef Gruska, Irène Guessarian: Correctness of Basic Systolic Systems Transformations. IFIP Congress (1) 1994: 315-321

N. Bensaou, Irène Guessarian: An Extended Transformation System for CLP Programs. LOPSTR 1994: 17-35

N. Bensaou, Irène Guessarian: Transforming Constraint Logic Programs. STACS 1994: 33-46

Irène Guessarian: Trees and algebraic semantics. Tree Automata and Languages 1992: 291-310

Irène Guessarian, Marcos Veloso Peixoto: About Boundedness for some DATALOG and DATALOG_neg Programs. MFCS 1992: 284-297

Irène Guessarian: About Algebras, Fixpoints and Semantics. AMAST 1991: 497-528

Irène Guessarian: Deciding Boundedness for Uniformly Connected Datalog Programs. ICDT 1990: 395-405

Irène Guessarian: About Fixpoints for Concurrency. Semantics of Systems of Concurrent Processes 1990: 358-374

Irène Guessarian (Ed.): Semantics of Systems of Concurrent Processes, LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, Proceedings. Lecture Notes in Computer Science 469, Springer 1990, isbn 3-540-53479-2

Irène Guessarian: Fixpoint strategies for deductive databases. Discrete Applied Mathematics 24(1-3): 121-131 (1989)

Irène Guessarian, Wafaa Niar-Dinedane: Fairness and Regularity for Sccs Processes. ITA 23(1): 59-86 (1989)

Irène Guessarian, D. Perrin: LITP: Laboratoire D'Informatique theorique et programmation Paris Presentation of scientific activity. SIGACT News 20(4): 50-53 (1989)

Georges Gardarin, Irène Guessarian, Christophe de Maindreville: Translation of Logic Programs into Functional Fixpoint Equations. Theor. Comput. Sci. 63(3): 253-274 (1989)

Irène Guessarian: Improving Fixpoint Toole for Computer Science. IFIP Congress 1989: 1109-1114

Irène Guessarian: Fixpoint strategies for deductive databases. Bulletin of the EATCS 35: 128-136 (1988)

Irène Guessarian, Lutz Priese: On the Minimal Number of * Operators to Model Regularity in Fair SCCS. Inf. Process. Lett. 29(6): 297-300 (1988)

Irène Guessarian: A Note On Fixpoint Techniques in Data Base Recursive Logic Programs. ITA 22(1): 49-56 (1988)

Irène Guessarian: A characterization of fair computations of finite state SCCS processes. Formal Properties of Finite Automata and Applications 1988: 234-248

Irène Guessarian, Wafaa Niar-Dinedane: An Automaton Characterization of Fairness in SCCS. STACS 1988: 356-372

Hajnal Andréka, Irène Guessarian, István Németi: A Unifying Theorem for Algebraic Semantics and Dynamic Logics. Inf. Comput. 72(1): 31-45 (1987)

David B. Benson, Irène Guessarian: Algebraic Solutions to Recursion Schemes. J. Comput. Syst. Sci. 35(3): 365-400 (1987)

Irène Guessarian, José Meseguer: On the Axiomatization of ``If-Then-Else''. SIAM J. Comput. 16(2): 332-357 (1987)

Irène Guessarian: Equational Axiomatizations of If-Then-Else. CTRS 1987: 98-110

Irène Guessarian: Fixpoint techniques in data base recursive logic programs. Bulletin of the EATCS 29: 32-34 (1986)

Hajnal Andréka, Irène Guessarian, István Németi: A unifying theorem for algebraic semantics and dynamic logics. FCT 1985: 8-17

Irène Guessarian: Pushdown Tree Automata. Mathematical Systems Theory 16(4): 237-263 (1983)

Irène Guessarian: Algebraic Semantics. Lecture Notes in Computer Science 99, Springer 1981, isbn 3-540-10284-1

Irène Guessarian: On Pushdown Tree Automata. CAAP 1981: 211-223

Werner Damm, Irène Guessarian: Combining T and level-N. MFCS 1981: 262-270

F. Ermine, Irène Guessarian: About Program Termination and Simplification. Symposium on Programming 1980: 123-135

Irène Guessarian: Program Transformations and Algebraic Semantics. Theor. Comput. Sci. 9: 39-65 (1979)

Irène Guessarian: On Continuous Completions. Theoretical Computer Science 1979: 142-152

Irène Guessarian: A propos de la sémantique de l'appel par valeur selon A. Arnold. ITA 12(4) (1978)

Bruno Courcelle, Irène Guessarian: On Some Classes of Interpretations. J. Comput. Syst. Sci. 17(3): 406-431 (1978)

Irène Guessarian: Some Applications of Algebraic Semantics. MFCS 1978: 257-266

Irène Guessarian: Tests et leur Caractérisation Syntaxique. ITA 11(2): 133-156 (1977)

Irène Guessarian: Semantic Equivalence of Program Schemes and its Syntactic Characterization. ICALP 1976: 189-200

Irène Guessarian: Equivalence dans l'algèbre ds schémas de programmes. Symposium on Programming 1974: 204-220