Irène Guessarian - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 59 from 59

2022

Affine Completeness of Some Free Binary AlgebrasAndré Arnold, Patrick Cégielski, Irène Guessarian. FUIN, 186(1-4):27-44, 2022. [doi]

2021

The algebra of binary trees is affine completeAndré Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian. dmtcs, 23(2), 2021. [doi]

2016

Characterizing Congruence Preserving Functions Z/nZ → Z/mZ Via Rational PolynomialsPatrick Cégielski, Serge Grigorieff, Irène Guessarian. int, 16, 2016. [doi]

2015

Arithmetical Congruence Preservation: From Finite to InfinitePatrick Cégielski, Serge Grigorieff, Irène Guessarian. BIRTHDAY 2015: 210-225 [doi]

2014

On lattices of regular sets of natural integers closed under decrementationPatrick Cégielski, Serge Grigorieff, Irène Guessarian. ipl, 114(4):197-202, 2014. [doi]

Integral Difference Ratio Functions on IntegersPatrick Cégielski, Serge Grigorieff, Irène Guessarian. BIRTHDAY 2014: 277-291 [doi]

2010

Normalization of Some Extended Abstract State MachinesPatrick Cégielski, Irène Guessarian. BIRTHDAY 2010: 165-180 [doi]

2006

Multiple serial episodes matchingPatrick Cégielski, Irène Guessarian, Yuri Matiyasevich. ipl, 98(6):211-218, 2006. [doi]

Window Subsequence Problems for Compressed TextsPatrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri Matiyasevich. csr 2006: 127-136 [doi]

2003

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

On temporal logic versus datalogIrène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati. TCS, 1(303):103-133, 2003. [doi]

2002

The expressiveness of DACFoto N. Afrati, Irène Guessarian, Michel de Rougemont. TCS, 286(1):3-32, 2002. [doi]

EditorialIrène Guessarian. logcom, 12(2):215, 2002. [doi]

2001

Window-accumulated subsequence matching problem is linearLuc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich. APAL, 113(1-3):59-80, 2001.

1999

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

1998

Transforming Constraint Logic ProgramsN. Bensaou, Irène Guessarian. TCS, 206(1-2):81-125, 1998. [doi]

1997

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

Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic TransformationsJozef Gruska, Irène Guessarian. jalc, 2(2):93-134, 1997.

1995

Linearizing Some Recursive Logic ProgramsIrène Guessarian, Jean-Eric Pin. tkde, 7(1):137-149, 1995. [doi]

1994

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

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

Correctness of Basic Systolic Systems TransformationsJozef Gruska, Irène Guessarian. ifip 1994: 315-321

About Boundedness for Some Datalog and Datalog:::neg::: ProgramsIrène Guessarian, Marcos Veloso Peixoto. logcom, 4(4):375-403, 1994.

1992

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

Trees and algebraic semanticsIrène Guessarian. In Tree Automata and Languages. pages 291-310, 1992.

1991

About Algebras, Fixpoints and SemanticsIrène Guessarian. amast 1992: 497-528

1990

About Fixpoints for ConcurrencyIrène Guessarian. litp 1990: 358-374

Deciding Boundedness for Uniformly Connected Datalog ProgramsIrène Guessarian. icdt 1990: 395-405 [doi]

1989

Translation of Logic Programs into Functional Fixpoint EquationsGeorges Gardarin, Irène Guessarian, Christophe de Maindreville. TCS, 63(3):253-274, 1989.

Fixpoint strategies for deductive databasesIrène Guessarian. DAM, 24(1-3):121-131, 1989. [doi]

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

Improving Fixpoint Toole for Computer ScienceIrène Guessarian. ifip 1989: 1109-1114

1988

Fixpoint strategies for deductive databasesIrène Guessarian. eatcs, 35:128-136, 1988.

A characterization of fair computations of finite state SCCS processesIrène Guessarian. litp 1989: 234-248

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

A Note On Fixpoint Techniques in Data Base Recursive Logic ProgramsIrène Guessarian. ita, 22(1):49-56, 1988.

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

1987

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

Algebraic Solutions to Recursion SchemesDavid B. Benson, Irène Guessarian. jcss, 35(3):365-400, 1987.

Notions of fairness for synchronous fork join netsM. Chadili, Irène Guessarian. ifip2 1987: 325-346

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

Equational Axiomatizations of If-Then-ElseIrène Guessarian. ctrs 1988: 98-110

1986

Fixpoint techniques in data base recursive logic programsIrène Guessarian. eatcs, 29:32-34, 1986.

1985

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

1983

Pushdown Tree AutomataIrène Guessarian. mst, 16(4):237-263, 1983.

Survey on classes of interpretations and some of their applicationsIrène Guessarian. sigact, 15(3):45-71, 1983. [doi]

Iterative vs. regular factor algebrasIrène Guessarian, Francesco Parisi-Presicce. sigact, 15(2):32-44, 1983. [doi]

1981

Combining T and level-NWerner Damm, Irène Guessarian. mfcs 1981: 262-270

Algebraic SemanticsIrène Guessarian. Volume 99 of Lecture Notes in Computer Science, Springer, 1981.

On Pushdown Tree AutomataIrène Guessarian. caap 1981: 211-223

1980

About Program Termination and SimplificationF. Ermine, Irène Guessarian. programm 1980: 123-135

1979

On Continuous CompletionsIrène Guessarian. tcs 1979: 142-152

Program Transformations and Algebraic SemanticsIrène Guessarian. TCS, 9:39-65, 1979.

1978

On Some Classes of InterpretationsBruno Courcelle, Irène Guessarian. jcss, 17(3):406-431, 1978.

Some Applications of Algebraic SemanticsIrène Guessarian. mfcs 1978: 257-266

A propos de la sémantique de l appel par valeur selon A. ArnoldIrène Guessarian. ita, 12(4):287-289, 1978.

1977

Tests et leur Caractérisation SyntaxiqueIrène Guessarian. ita, 11(2):133-156, 1977.

1976

Semantic Equivalence of Program Schemes and its Syntactic CharacterizationIrène Guessarian. icalp 1976: 189-200

1974

Equivalence dans l algèbre ds schémas de programmesIrène Guessarian. programm 1974: 204-220

Sign in or sign up to see more results.

runs on WebDSL