Précédent : Diffusion de logiciels Remonter :
Projet
PROTHEO Suivant : Abstract
- Livres
- 1
- H. KIRCHNER
(réd.), Trees in Algebra and Programming - CAAP 96. Proc.
21st International Colloquium , Linköping, Sweden,
Lecture Notes in Computer Science, 1059,
Springer-Verlag, 1996.
- Thèses
- 2
- A. AMANISS,
Méthodes de schématisation pour la démonstration
automatique, thèse de doctorat, Université Henri Poincaré
- Nancy 1, septembre 1996.
- 3
- E. MONFROY,
Collaboration de solveurs pour la programmation logique à
contraintes, thèse de doctorat, Université Henri Poincaré
- Nancy 1, novembre 1996.
- 4
- P. STROGOVA,
Techniques de Réécriture pour le Traitement de Problème de
Routage dans des Graphes de Cayley, thèse de doctorat,
Université Henri Poincaré - Nancy 1, décembre 1996.
- Articles
- 5
- A. BOUHOULA,
``Using Induction and Rewriting to Verify and Complete
Parameterized Specifications'', Theoretical Computer
Science 170, décembre 1996, p. 245-276.
- 6
- B. GRAMLICH,
``On Termination and Confluence Properties of Disjoint and
Constructor-Sharing Conditional Rewrite Systems'',
Theoretical Computer Science 165, 1, septembre 1996,
p. 97-131.
- 7
- C. LYNCH,
``Local Simplification'', Information and Computation,
To appear.
- 8
- C. LYNCH,
``Oriented Equational Logic Programming is Complete'',
Journal of Symbolic Computation, To appear.
- 9
- P. NARENDRAN,
M. RUSINOWITCH,
``Any ground associative-commutative theory has a finite
canonical system'', Journal of Automated Reasoning 17,
1, 1996, p. 131-143.
- 10
- C. RINGEISSEN,
``Combining Decision Algorithms for Matching in the Union of
Disjoint Equational Theories'', Information and Computation
126, 2, mai 1996, p. 144-160.
- Communications à
congrès
- 11
- F. AJILI,
C. KIRCHNER,
``Combining Unification and Built-In Constraints'', in:
10th International Workshop on Unification, Munich
(Germany), K. Schulz, S. Kepser (réd.), juin
1996.
- 12
- I. ALOUINI,
C. KIRCHNER,
``Toward the Concurrent Implementation of Computational
Systems'', in: Proceedings International Conference on
Algebraic and Logic Programming, Aachen (Germany),
M. Hanus, M. Rodríguez-Artalejo (réd.), Lecture
Notes in Computer Science, 1139, Springer-Verlag,
p. 1-31, Aachen (Germany), septembre 1996.
- 13
- L. BACHMAIR,
I. V. RAMAKRISHNAN,
L. VIGNERON,
``Efficient Term Rewriting Techniques'', in: CCL'96
Workshop, San Lorenzo (Spain), septembre 1996.
- 14
- N. BERREGEB,
A. BOUHOULA,
M. RUSINOWITCH,
``Automated Verification by Induction with
Associative-Commutative Operators'', in: Proceedings of the
International conference on Computer Aided Verification,
New Jersey, USA, 1996.
- 15
- N. BERREGEB,
A. BOUHOULA,
M. RUSINOWITCH,
``SPIKE-AC: a System for Proofs by Induction in
Associative-Commutative Theories'', in: Proceedings 7th
Conference on Rewriting Techniques and Applications, New
Brunswick (New Jersey, USA), p. 428-431, 1996.
- 16
- P. BOROVANSK´Y, C. KIRCHNER, H. KIRCHNER, P.-E. MOREAU, M. VITTEK, ``ELAN: A logical
framework based on computational systems'', in: Proceedings
of the first international workshop on rewriting logic,
J. Meseguer (réd.), 4, Electronic Notes in
Theoretical Computer Science, Asilomar (California), septembre
1996.
- 17
- P. BOROVANSK´Y, C. KIRCHNER, H. KIRCHNER, ``Controlling Rewriting by
Rewriting'', in: Proceedings of the first international
workshop on rewriting logic, J. Meseguer (réd.),
4, Electronic Notes in Theoretical Computer Science,
Asilomar (California), septembre 1996.
- 18
- A. BOUHOULA,
K. BSAïES, ``A New Framework for
Mechanising Logic Program Diagnosis'', in: Proceedings of
the Sixth International Workshop on Logic Program Synthesis and
Transformation, Stockholm (Sweden), août 1996.
- 19
- A. BOUHOULA, ``A
General Framework for Mechanizing Induction using Test Set'',
in: Proccedings of the 4th Pacific Rim International
Conference on Artificial Intelligence, Cairns (Australia),
Lecture Notes in Artificial Intelligence,
1114, Springer-Verlag, p. 1-12, août 1996.
- 20
- C. CASTRO,
``Binary CSP Solving as an Inference Process'', in:
Proceedings of the Eighth International Conference on Tools in
Artificial Intelligence, ICTAI'96, Toulouse, France,
p. 462-463, novembre 1996.
- 21
- C. CASTRO,
``Solving Binary CSP using Computational Systems'', in:
Proceedings of the first international workshop on rewriting
logic, J. Meseguer (réd.), 4, Electronic
Notes in Theoretical Computer Science, Asilomar (California),
septembre 1996.
- 22
- R. CURIEN,
Z. QIAN,
H. SHI, ``Efficient
Second-Order Matching'', in: Proceedings 7th Conference on
Rewriting Techniques and Applications, New Brunswick (New
Jersey, USA), H. Ganzinger (réd.), Lecture Notes
in Computer Science, 1103, Springer-Verlag,
p. 317-331, juillet 1996.
- 23
- E. DOMENJOUD,
``Undecidability of the word problem in the union of theories
sharing constructors'', in: Proceedings 10th International
Workshop on Unification, Munich (Germany), K. Schulz,
S. Kepser (réd.), p. 92-96, juin 1996.
- 24
- G. DOWEK,
T. HARDIN,
C. KIRCHNER,
F. PFENNING,
``Unification via Explicit Substitutions: The Case of
Higher-Order Patterns'', in: Proceedings of Joint
International Conference and Symposium on Logic
Programming, M. Maher (réd.), The MIT press, Bonn
(Germany), septembre 1996.
- 25
- T. GENET,
I. GNAEDIG,
``Termination Proofs with Efficient gpo Ordering
Constraint Solving'', in: 10th International Workshop on
Unification, Munich (Germany), K. Schulz,
S. Kepser (réd.), juin 1996.
- 26
- B. GRAMLICH,
C.-P. WIRTH, ``Confluence
of Terminating Conditional Rewrite Systems Revisited'', in:
Proceedings 7th Conference on Rewriting Techniques and
Applications, New Brunswick (New Jersey, USA),
H. Ganzinger (réd.), Lecture Notes in Computer
Science, 1103, Springer-Verlag, p. 245-259,
juillet 1996.
- 27
- B. GRAMLICH,
``Conditional Rewrite Systems under Signature Extensions: Some
Counterexamples'', in: Proceedings 10th International
Workshop on Unification, Munich (Germany), K. Schulz,
S. Kepser (réd.), p. 45-50, juin 1996.
- 28
- B. GRAMLICH,
``Confluence without Termination via Parallel Critical Pairs'',
in: Proceedings 21st International Colloquium on Trees in
Algebra and Programming, Linköping (Sweden),
H. Kirchner (réd.), Lecture Notes in Computer
Science, 1059, Springer-Verlag, p. 211-225,
avril 1996.
- 29
- B. GRAMLICH,
``On Proving Termination by Innermost Termination'', in:
Proceedings 7th Conference on Rewriting Techniques and
Applications, New Brunswick (New Jersey, USA),
H. Ganzinger (réd.), Lecture Notes in Computer
Science, 1103, Springer-Verlag, p. 93-107,
juillet 1996.
- 30
- C. HINTERMEIER,
H. KIRCHNER,
P. MOSSES,
``Combining Algebraic and Set Theoretic Specifications'',
in: Recent Trends in Data Type Specification, Proc. 11th
Workshop on Specification of Abstract Data Types joint with the
9th general COMPASS workshop. Oslo, Norway, September 1995.
Selected papers, O. M.Haveraaen, O-J.Dahl (réd.),
Lecture Notes in Computer Science, 1130,
Springer-Verlag, p. 255-273, 1996.
- 31
- C. HINTERMEIER,
H. KIRCHNER,
P. MOSSES, ``
Rn - and Gn-logics'', in:
Higher-Order Algebra, Logic, and Term Rewriting,
G. Dowek, J. Heering, K. Meinke, B. Möller
(réd.), Lecture Notes in Computer Science,
1074, Springer-Verlag, p. 90-108, 1996.
- 32
- C. KIRCHNER,
C. LYNCH,
C. SCHARFF, ``A
Fine-grained Concurrent Completion Procedure'', in:
Proceedings 7th Conference on Rewriting Techniques and
Applications, New Brunswick (New Jersey, USA),
H. Ganzinger (réd.), Lecture Notes in Computer
Science, 1103, Springer-Verlag, p. 3-17,
juillet 1996.
- 33
- C. KIRCHNER,
C. RINGEISSEN,
``Higher Order Equational Unification via Explicit
Substitutions'', in: 10th International Workshop on
Unification, Munich (Germany), K. Schulz,
S. Kepser (réd.), juin 1996.
- 34
- H. KIRCHNER,
P.-E. MOREAU, ``A
reflective extension of ELAN'', in: Proceedings of the
first international workshop on rewriting logic,
J. Meseguer (réd.), 4, Electronic Notes in
Theoretical Computer Science, Asilomar (California), septembre
1996.
- 35
- C. LYNCH,
P. STROGOVA, ``PATCH
Graphs: an Efficient Data Structure for Completion of Finitely
Presented Groups'', in: Proc. Third International
Conference on Artificial Intelligence and Symbolic Mathematical
Computation, J. Pfalzgraf (réd.), Lecture Notes
in Computer Science, 1138, Springer-Verlag,
p. 176-190, Steyr, Austria, septembre 1996.
- 36
- E. MONFROY,
C. RINGEISSEN,
``Domain-Independent Scheme for Constraint Solver Extension'',
in: 2nd IMACS Conference on Applications of Computer
Algebra, RISC (Research Institute for Symbolic
Computation), Castle Hagenberg (Austria), juillet 1996.
- E. MONFROY,
M. RUSINOWITCH,
R. SCHOTT,
``Implementing Non-Linear Constraints with Cooperative
Solvers'', in: Proceedings of ACM Symposium on Applied
Computing, p. 63-72, Philadelphia, PA, février
1996.
- 38
- E. MONFROY,
``Solver Collaborations for Non-Linear Constraints'', in:
2nd IMACS Conference on Applications of Computer Algebra,
RISC (Research Institute for Symbolic Computation), Castle
Hagenberg (Austria), juillet 1996.
- 39
- C. RINGEISSEN,
``Cooperation of Decision Procedures for the Satisfiability
Problem'', in: Frontiers of Combining Systems, First
International Workshop, Munich (Germany), F. Baader,
K. Schulz (réd.), Applied Logic, Kluwer Academic
Publishers, p. 121-140, mars 1996.
- 40
- P. VARMAN,
R. VERMA, ``Tight
Bounds for Prefetching and Buffer Management of Parallel I/O
Systems'', in: Proceedings of the Sixteenth Conference on
the Foundations of Software Technology and Theoretical Computer
Science, Lecture Notes in Computer Science,
1180, Springer-Verlag, p. 200-211, Hyderabad
(India), décembre 1996.
- 41
- L. VIGNERON,
A. WASILEWSKA,
``Automated Study of Rough and Modal Algebras'', in: CCL'96
Workshop, San Lorenzo (Spain), septembre 1996.
- 42
- L. VIGNERON,
A. WASILEWSKA,
``Modal and Rough Algebras'', in: Proceedings of the
CESA'96 International Multiconference (Computational
Engineering in Systems Applications), Symposium on
Modelling, Analysis and Simulation, P. Borne,
G. Dauphin-Tanguy, C. Sueur, S. El Khattabi
(réd.), IMACS/IEEE, p. 1107-1112, Lille (France), juillet
1996.
- 43
- L. VIGNERON,
``Extended Equations for Deduction modulo E'', in: CCL'96
Workshop, San Lorenzo (Spain), septembre 1996.
- 44
- M. VITTEK, ``A
Compiler for Nondeterministic Term Rewriting Systems'', in:
Proceedings 7th Conference on Rewriting Techniques and
Applications, New Brunswick (New Jersey, USA),
H. Ganzinger (réd.), Lecture Notes in Computer
Science, 1103, Springer-Verlag, p. 154-168,
juillet 1996.
- Rapports de
recherche
- 45
- A. BOUHOULA,
J.-P. JOUANNAUD,
J. MESEGUER,
``Specification and proof in membership equational logic'',
rapport de recherche, SRI International, Computer
Science Laboratory, Menlo Park, CA (USA), 1996.
- 46
- A. BOUHOULA,
J.-P. JOUANNAUD,
``Automata-driven automated induction'', rapport de
recherche, SRI International, Computer Science Laboratory,
Menlo Park, CA (USA), 1996.
- 47
- E. MONFROY,
C. RINGEISSEN,
``Domain-Independent Constraint Solver Extension'',
Research Report n°96-R-043, Centre de Recherche en
Informatique de Nancy, Vandoeuvre-lès-Nancy, février 1996.
- 48
- E. MONFROY, ``An
Environment for Designing/Executing Constraint Solver
Collaborations'', Research Report n°96-R-044, Centre
de Recherche en Informatique de Nancy, Vandoeuvre-lès-Nancy,
février 1996.
- Divers
- 49
- F. AJILI,
C. CASTRO,
E. DOMENJOUD,
C. KIRCHNER,
``Rapport de fin de pré-étude du problème d'affectation des
courses pour le GIHP-Champagne'', Rapport de fin de contrat,
novembre 1996.
- 50
- F. AJILI,
E. CONTEJEAN,
``Complete Solving of Linear Diophantine Equations and
Inequations without Adding Variables'', Theoretical Computer
Science, To appear.
- 51
- I. ALOUINI,
``RECO: An implementation of conditional Concurrent Rewriting
on distributed memory machines'', Poster Session of ALP'96,
Aachen (Germany).
- 52
- A. AMANISS,
M. HERMANN,
D. LUGIEZ, ``Set
Operations for Recurrent Term Schematizations'', To appear in
Proc. of International Colloquium on Trees in Algebra and
Programming, Lille, 1997.
- 53
- A. AMANISS,
M. HERMANN,
D. LUGIEZ,
``Travailler avec des ensembles infinis de termes représentés
par des termes iterés'', Journées du GDR Programmation,
Orléans, novembre 1996.
- 54
- T. GENET,
I. GNAEDIG, ``Shared
Term Data Structure for Efficiently Solving gpo Ordering
Constraints'', To appear in Proc. of International Colloquium
on Trees in Algebra and Programming, Lille, 1997.
- 55
- T. GENET,
I. GNAEDIG, ``Preuve
de terminaison par résolution de contraintes d'ordre sur une
structure partagée'', Journées du GDR Programmation, Orléans,
novembre 1996.
- 56
- C. LYNCH,
P. STROGOVA,
``Graphes PATCH: une structure de données pour la complétion
efficace des groupes finiment présentés'', Journées du GDR
Programmation, Orléans, novembre 1996.
- 57
- E. PETITJEAN,
``Résolution parallèle de contraintes linéaires sur les entiers
naturels'', Rapport de DEA, septembre 1996, INPL.
- 58
- S. STRATULAT,
``Vérification automatisée de logiciels de
télécommunications'', Rapport de DEA, septembre 1996,
Université Henri Poincaré - Nancy 1.