Irène Guessarian

According to our database1, Irène Guessarian
  • authored at least 63 papers between 1974 and 2015.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Characterizing congruence preserving functions $Z/nZ\to Z/mZ$ via rational polynomials.
CoRR, 2015

Arithmetical Congruence Preservation: From Finite to Infinite.
Proceedings of the Fields of Logic and Computation II, 2015

2014
On lattices of regular sets of natural integers closed under decrementation.
Inf. Process. Lett., 2014

Integral Difference Ratio Functions on Integers.
Proceedings of the Computing with New Resources, 2014

2013
Newton representation of functions over natural integers having integral difference ratios.
CoRR, 2013

On Lattices of Regular Sets of Natural Integers Closed under Decrementation.
CoRR, 2013

2010
Normalization of Some Extended Abstract State Machines.
Proceedings of the Fields of Logic and Computation, 2010

2009
Inf-datalog, Modal Logic and Complexities.
ITA, 2009

2008
Tree inclusion problems.
ITA, 2008

2006
Multiple serial episodes matching.
Inf. Process. Lett., 2006

Complexity of Monadic inf-datalog. Application to temporal logic
CoRR, 2006

Automatic generation of simplified weakest preconditions for integrity constraint verification
CoRR, 2006

Multiple serial episode matching
CoRR, 2006

Window Subsequence Problems for Compressed Texts.
Proceedings of the Computer Science, 2006

2005
On relating CTL to Datalog
CoRR, 2005

2003
On temporal logic versus datalog.
Theor. Comput. Sci., 2003

From CTL to Datalog.
Proceedings of the PCK50, 2003

2002
The expressiveness of DAC.
Theor. Comput. Sci., 2002

Editorial.
J. Log. Comput., 2002

2001
Window-accumulated subsequence matching problem is linear.
Ann. Pure Appl. Logic, 2001

1999
Window-Accumulated Subsequence Matching Problem is Linear.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

1998
Transforming Constraint Logic Programs.
Theor. Comput. Sci., 1998

1997
Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations.
Journal of Automata, Languages and Combinatorics, 1997

The Expressiveness of Datalog Circuits (DAC).
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1995
Linearizing Some Recursive Logic Programs.
IEEE Trans. Knowl. Data Eng., 1995

1994
About Boundedness for Some Datalog and Datalogneg Programs.
J. Log. Comput., 1994

Transforming Constraint Logic Programs.
Proceedings of the STACS 94, 1994

An Extended Transformation System for CLP Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1994

Correctness of Basic Systolic Systems Transformations.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1992
About Boundedness for some DATALOG and DATALOG_neg Programs.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Trees and algebraic semantics.
Tree Automata and Languages, 1992

1991
About Algebras, Fixpoints and Semantics.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
About Fixpoints for Concurrency.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Deciding Boundedness for Uniformly Connected Datalog Programs.
Proceedings of the ICDT'90, 1990

1989
Translation of Logic Programs into Functional Fixpoint Equations.
Theor. Comput. Sci., 1989

LITP: Laboratoire D'Informatique theorique et programmation Paris Presentation of scientific activity.
SIGACT News, 1989

Fairness and Regularity for Sccs Processes.
ITA, 1989

Fixpoint strategies for deductive databases.
Discrete Applied Mathematics, 1989

Improving Fixpoint Toole for Computer Science.
IFIP Congress, 1989

1988
A Note On Fixpoint Techniques in Data Base Recursive Logic Programs.
ITA, 1988

On the Minimal Number of * Operators to Model Regularity in Fair SCCS.
Inf. Process. Lett., 1988

Fixpoint strategies for deductive databases.
Bulletin of the EATCS, 1988

An Automaton Characterization of Fairness in SCCS.
Proceedings of the STACS 88, 1988

A characterization of fair computations of finite state SCCS processes.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

1987
A Unifying Theorem for Algebraic Semantics and Dynamic Logics
Inf. Comput., January, 1987

On the Axiomatization of "If-Then-Else".
SIAM J. Comput., 1987

Algebraic Solutions to Recursion Schemes.
J. Comput. Syst. Sci., 1987

Equational Axiomatizations of If-Then-Else.
Proceedings of the Conditional Term Rewriting Systems, 1987

1986
Fixpoint techniques in data base recursive logic programs.
Bulletin of the EATCS, 1986

1985
A unifying theorem for algebraic semantics and dynamic logics.
Proceedings of the Fundamentals of Computation Theory, 1985

1983
Pushdown Tree Automata.
Mathematical Systems Theory, 1983

1981
Combining T and level-N.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

On Pushdown Tree Automata.
Proceedings of the CAAP '81, 1981

Algebraic Semantics
Lecture Notes in Computer Science 99, Springer, ISBN: 3-540-10284-1, 1981

1980
About Program Termination and Simplification.
Proceedings of the International Symposium on Programming, 1980

1979
Program Transformations and Algebraic Semantics.
Theor. Comput. Sci., 1979

On Continuous Completions.
Proceedings of the Theoretical Computer Science, 1979

1978
On Some Classes of Interpretations.
J. Comput. Syst. Sci., 1978

A propos de la sémantique de l'appel par valeur selon A. Arnold.
ITA, 1978

Some Applications of Algebraic Semantics.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
Tests et leur Caractérisation Syntaxique.
ITA, 1977

1976
Semantic Equivalence of Program Schemes and its Syntactic Characterization.
ICALP, 1976

1974
Equivalence dans l'algèbre ds schémas de programmes.
Proceedings of the Programming Symposium, 1974


  Loading...