Publications

Articles

    1. Jules Desharnais et Bernhard Möller. The θ-join as a join with θ. 18th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2020), Palaiseau, France, prévu pour avoir lieu du 8 au 11 avril 2020, mais reporté à cause de la COVID-19.
    1. Nafi Diallo, Wided Ghardallou, Jules Desharnais et Ali Mili. Convergence: Integrating termination and abort-freedom. Journal of Logical and Algebraic Methods in Programming, 97: 1–29, février 2018.
    1. Jules Desharnais, Nafi Diallo, Wided Ghardallou et Ali Mili. Projecting programs on specifications: Definition and implications. Science of Computer Programming, 138:26–48, mai 2017.
    2. Mathieu Alain et Jules Desharnais. Relations as images. 16th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2017), Lyon, mai 2017, Lecture Notes in Computer Science, volume 10226, Springer, pages 43–59.
    3. Jules Desharnais et Bernhard Möller. Non-associative Kleene algebra and temporal logics. 16th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2017), Lyon, mais 2017, Lecture Notes in Computer Science, volume 10226, Springer, pages 93–108.
    4. Nafi Diallo, Wided Ghardallou, Jules Desharnais, Marcelo Frias, Ali Jaoua et Ali Mili. What is a Fault? And Why Does it Matter? Innovations in Systems and Software Engineering, 13:(2–3): 219–239, Springer, septembre 2017.
    1. Nghi Huynh, Marc Frappier, Amel Mammar, Régine Laleau et Jules Desharnais. A formal validation of the RBAC ANSI 2012 standard using B. Science of Computer Programming, 131:76–93, Décembre 2016.
    1. Nafi Diallo, Wided Ghardallou, Jules Desharnais et Ali Mili. Program Derivation by Correctness Enhancements. Refinement Workshop 2015 (REFINE), Oslo, 22 juin 2015.
    2. Jules Desharnais, Nafi Diallo, Wided Ghardallou, Marcelo F. Frias, Ali Jaoua et Ali Mili. Relational mathematics for relative correctness. 15th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2015), Braga, Portugal, 28 septembre–1 octobre 2015, Lecture Notes in Computer Science, volume 9348, pages 191–208, 2015.
    3. JNghi Huynh, Marc Frappier, Amel Mammar, Régine Laleau et Jules Desharnais. Validation du standard RBAC ANSI 2012 avec B. 14e journées sur les Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL 2015), Bordeaux, 9–10 juin 2015.
    1. Nghi Huynh, Marc Frappier, Amel Mammar, Régine Laleau et Jules Desharnais.Validating the RBAC ANSI 2012 Standard using B. 4th International ABZ 2014 Conference, Toulouse, France, juin 2014, dans Abstract State Machines –– Alloy, B, TLA VDM, and Z, Lecture Notes in Computer Science, volume 8477, Springer, pages 255–270.
    2. Jules Desharnais et Bernhard Möller. Fuzzifying modal algebra. 14th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2014), Marienstatt, Allemagne, avril –mai 2014, Lecture Notes in Computer Science, volume 8428, Springer, pages 395–411.
    3. Jules Desharnais, Anastasiya Grinenko et Bernhard Möller. Relational laws and constructs of linear algebra. Journal of Logical and Algebraic Methods in Programming, 83(2):154–168, mars 2014.
    1. Olfa Mraihi, Asma Louhichi, Lamia Labed Jilani, Jules Desharnais et Ali Mili. Invariant assertions, invariant relations, and invariant functions. Science of Computer Programming, 78(9):1212–1239, septembre 2013.
    1. Jules Desharnais et Georg Struth. Internal axioms for domain semirings. Science of Computer Programming, 76(3):181–203, mars 2011. Numéro spécial : sélection d'articles de MPC 2008.
    2. Jules Desharnais, Bernhard Möller et Georg Struth. Algebraic Notions of Termination. Logical Methods in Computer Science, 7(1):1–29, février 2011.
    1. Jean-Lou De Carufel et Jules Desharnais. Abstract representation theorems for demonic refinement algebras. Journal of Logic and Algebraic Programming, 79(8):740–767, novembre 2010. Numéro spécial : sélection d'articles de RelMiCS/AKA 2008.
    1. Jules Desharnais, Peter Jipsen et Georg Struth. Domain and antidomain semigroups. 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and 6th International Conference on Applications of Kleene Algebra, AKA 2009, Doha, Qatar, novembre 2009, dans Relations and Kleene Algebra in Computer Science, Lecture Notes in Computer Science, volume 4988, Springer, pages 73–97.
    2. Jules Desharnais, Peter Jipsen et Georg Struth. Internal axioms for domain semirings. Topology, Algebra and Categories in Logic (TACL 2009), Amsterdam, juillet 2009,
    3. Hans Bherer, Jules Desharnais et Richard St-Denis. Control of parameterized discrete event systems. Discrete Event Dynamic Systems, 19(2):213–265, juin 2009.
    1. Jules Desharnais et Georg Struth. Domain axioms for a family of near-semirings. 12th International Conference on Algebraic Methodology and Software Technology (AMAST 2008), Urbana, IL, États-Unis, juillet 2008. Lecture Notes in Computer Science, volume 5140, Springer, pages 330–345.
    2. Jules Desharnais et Georg Struth. Modal semirings revisited. 9th International Conference on Mathematics of Program Construction (MPC 2008), Marseille, France, juillet 2008. Lecture Notes in Computer Science, volume 5133, Springer, pages 360–387.
    3. Jean-Lou De Carufel et Jules Desharnais. On the structure of demonic refinement algebras with enabledness and termination. 10th International Conference on Relational Methods in Computer Science et 5th International Conference on Applications of Kleene Algebra (RelMiCS/AKA 2008), Frauenwörth, Allemagne, avril 2008. Lecture Notes in Computer Science, volume 4988, Springer, pages 68–82.
    4. Jean-Lou De Carufel et Jules Desharnais. Latest news about demonic algebra with domain. 10th International Conference on Relational Methods in Computer Science et 5th International Conference on Applications of Kleene Algebra (RelMiCS/AKA 2008), Frauenwörth, Allemagne, avril 2008. Lecture Notes in Computer Science, volume 4988, Springer, pages 53–67.
    1. Therrezinha Fernandes et Jules Desharnais. Describing data flow analysis techniques with Kleene algebra. Science of Computer Programming, 65(2):173–194, mars 2007. Numéro spécial : sélection d'articles de MPC 2004.
    1. Jules Desharnais, Bernhard Möller et Georg Struth. Kleene algebra with domain. ACM Transactions on Computational Logic (TOCL), 7(4):798–833, octobre 2006.
    2. Jean-Lou De Carufel et Jules Desharnais. Demonic algebra with domain. Relations and Kleene Algebra in Computer Science. 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra (RelMiCS/AKA 2006), Manchester, Angleterre, août–septembre 2006, Lecture Notes in Computer Science, volume 4136, Springer, pages 120–134.
    3. Hans Bherer, Jules Desharnais et Richard St-Denis. On the reachability and nonblocking properties for parameterized discrete event systems. 8th International Workshop on Discrete Event Systems (WODES 2006), Ann Arbor, Michigan, USA, 10–12 juillet 2006, IEEE, pages 113–118.
    4. Hans Bherer, Jules Desharnais et Richard St-Denis. Parameterized discrete event systems under partial observation revisited. 8th IASTED International Conference on Control and Applications, mai 2006, Montréal, pages 273–280. Résumé.
    5. Ali Mili, Lan Wu, Frederick T. Sheldon, M. Shereshevsky et Jules Desharnais. Modeling redundancy: Quantitative and qualitative models. 4th IEEE International Conference on Computer Systems and Applications, Dubai/Sharjah, UAE, mars 2006, pages 1–8.
    6. Jules Desharnais, Bernhard Möller et Fairouz Tchier. Kleene under a modal demonic star. The Journal of Logic and Algebraic Programming, 66(2):127–160, février–mars 2006. Numéro spécial sur les algèbres de relations et les algèbres de Kleene.
    1. Jules Desharnais et Bernhard Möller. Least reflexive points of relations. Higher Order and Symbolic Computation, 18(1–2):51–77, juin 2005. Numéro spécial à la mémoire de Robert Paige, membre du group IFIP WG 2.1.
    2. V. Cortellessa, D. Del Gobbo, M. Shereshevsky, J. Desharnais et A. Mili. Relational characterizations of system fault tolerance. Science of Computer Programming, 56(3):343–361, mai–juin 2005.
    3. A. Mili, F. Sheldon, F. Mili et J. Desharnais. Recoverability preservation: a measure of last resort. Innovations in Systems and Software Engineering, 1(1):54–62, avril 2005.
    4. Claude Bolduc et Jules Desharnais. Static analysis of programs using omega algebra with tests. 8th International Conference on Relational Methods in Computer Science (RelMiCS 8), combinée avec les COST 274 / Tarski workshops et 3rd International workshop on applications of Kleene algebra, St. Catharines, Ontario, février 2005. Lecture Notes in Computer Science, volume 3929, Springer, 2006, pages 60–72.
    5. Vincent Mathieu et Jules Desharnais. Verification of pushdown systems using omega algebra with domain. 8th International Conference on Relational Methods in Computer Science (RelMiCS 8), combinée avec les COST 274 / Tarski workshops et 3rd International workshop on applications of Kleene algebra, St. Catharines, Ontario, février 2005. Lecture Notes in Computer Science, volume 3929, Springer, 2006, pages 188–199.
    6. A. Mili, F.T. Sheldon, F. Mili, M. Shereshevsky et J. Desharnais. Perspectives on redundancy: Applications to software certification. Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) – Track 9, pages 317c (1–10), Big Island, Hawaii, janvier 2005.
    1. J. Desharnais, B. Möller et G. Struth. Modal Kleene algebra and applications – A survey. JoRMiCS – Journal on Relational Methods in Computer Science, 1: 93–131, 2004.
    2. Ali Mili, Frederick Sheldon, Fatma Mili et Jules Desharnais. Recoverability preservation: A measure of last resort. First Conference on the PRInciples of Software Engineering (PriSE'04), novembre 2004, Buenos Aires, Argentine.
    3. Hans Bherer, Jules Desharnais, Marc Frappier et Richard St-Denis. Synthesis of state feedback controllers for parameterized discrete event systems. 2nd International Symposium on Automated Technology for Verification and Analysis (ATVA 2004), National Taiwan University, octobre–novembre 2004, Lecture Notes in Computer Science, volume 3299, Springer, pages 487-–490.
    4. Jules Desharnais, Bernhard Möller et Georg Struth. Termination in modal Kleene algebra. 3rd IFIP International Conference on Theoretical Computer Science Foundations of Mobile Computing (IFIP TCS 2004), août 2004, Toulouse.
    5. Therrezinha Fernandes et Jules Desharnais. Describing gen/kill static analysis techniques with Kleene algebra. 7th International Conference on Mathematics of Program Construction (MPC 2004), Stirling, Écosse, Royaume-Uni, juillet 2004, Lecture Notes in Computer Science, volume 3125, Springer, pages 110–128.
    1. Hans Bherer, Jules Desharnais, Marc Frappier et Richard St-Denis. Intégration d'une technique de vérification dans une procédure de synthèse de contrôleurs de systèmes paramétrés. 4e Colloque Francophone sur la Modélisation des Systèmes Réactifs, MSR'03, octobre 2003, Metz, France.
    2. M. Debbabi, J. Desharnais, B. Ktari, F. Michaud et N. Tawbi. A framework for the certification of COTS. 2e rencontre francophone sur Sécurité et Architecture Réseaux (SAR2003), Juin–Juillet 2003, Nancy, France.
    3. Jules Desharnais. Kleene algebra with relations. 7th International Seminar on Relational Methods in Computer Science combinée avec 2nd International Workshop on Applications of Kleene Algebra, Bad Malente, Allemagne, mai 2003, Lecture Notes in Computer Science, volume 3051, Springer, 2004, pages 8–20.
    4. Hans Bherer, Jules Desharnais, Marc Frappier et Richard St-Denis. Investigating discrete controllability with Kleene algebra. 7th International Seminar on Relational Methods in Computer Science combinée avec 2nd International Workshop on Applications of Kleene Algebra, Bad Malente, Allemagne, mai 2003, Lecture Notes in Computer Science, volume 3051, Springer, 2004, pages 73–84.
    1. M. Debbabi, J. Desharnais, M. Fourati, E. Menif, F. Painchaud et N. Tawbi. Secure self-certified code for Java. Formal Aspects of Security 2002 (Fasec'2002), Royal Holloway, University of London, Grande-Bretagne, décembre 2002, Lecture Notes in Computer Science 2629, Springer, 2003, pages 133–151.
    1. J. Desharnais et B. Möller. Characterizing determinacy in Kleene algebras. Information Sciences, 139(3–4):253–273, décembre 2001.
    2. L. L. Jilani, J. Desharnais et A. Mili. Defining and applying measures of distance between specifications. IEEE Transactions on Software Engineering, 27(8):673–703, août 2001.
    3. R. Ben Ayed, J. Desharnais, M. Frappier et A. Mili. Assigning meaning to understanding: A logic of program comprehension. Joint meeting of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2001) and the 7th International Conference on Information Systems Analysis and Synthesis (ISAS 2001), Orlando, USA, juillet 2001.
    4. J. Bergeron, R. Charpentier, M. Debbabi, J. Desharnais, E. Giasson, B. Ktari, F. Michaud, M. Salois et N. Tawbi. Secure integration of critical software via certifying compilers. 13th Annual Canadian Information Technology Security Symposium, juin 2001, Ottawa, 10 pages.
    5. J. Bergeron, M. Debbabi, J. Desharnais, M. M. Erhioui, Y. Lavoie et N. Tawbi. Static detection of malicious code in executable programs. 1st Symposium on Requirements Engineering for Information Security, mars 2001, Indianapolis, 8 pages.
    6. J. Desharnais, R. Khédri et A. Mili. Interpretation of tabular expressions using arrays of relations. Dans Relational Methods for Computer Science Applications, volume 65 de la série Studies in Fuzziness and Soft Computing, Springer Physica Verlag, février 2001, pages 3–14.
    1. R. Mili, J. Desharnais, M. Frappier et A. Mili. Semantic distance between specifications. Theoretical Computer Science, 247(1–2):257–276, septembre 2000.
    2. R. Ben Ayed, J. Desharnais, M. Frappier et A. Mili. A calculus of program adaptation and its applications. Science of Computer Programming, 38(1–3):73–123, août 2000.
    3. J. Desharnais, B. Möller et F. Tchier. Kleene under a demonic star. 8th International Conference on Algebraic Methodology And Software Technology (AMAST 2000), mai 2000, Iowa City, Iowa, USA, Lecture Notes in Computer Science, volume 1816, pages 355–370.
    1. Monomorphic characterization of n-ary direct products. Information Sciences, 119 (3–4):275–288, octobre 1999.
    2. F. Tchier et J. Desharnais. Applying a generalization of a theorem of Mills to generalized looping structures. Colloque Science and Engineering for Software Development, organisé à la mémoire du Dr. Harlan D. Mills et affilié à la 21st International Conference on Software Engineering, Los Angeles, mai 1999, pages 31–38.
    3. J. Bergeron, M. Debbabi, J. Desharnais, B. Ktari, M. Salois, N. Tawbi, R. Charpentier et M. Patry. Detection of malicious code in COTS software: a short survey. First International Software Assurance Certification Conference (ISACC'99), Washington D.C., mars 1999.
    1. M. Frappier, J. Desharnais, A. Mili et F. Mili. Verifying objects against axiomatic specifications: A fixed point approach. 5e Conférence Maghrébine en Génie Logiciel et Intelligence Artificielle (MCSEAI'98), pages 259–274, Tunis, Tunisie, décembre 1998.
    2. J. Desharnais, M. Frappier, R. Khédri et A. Mili. Integration of sequential scenarios. IEEE Trans. on Software Engineering, 24(9):695–708, septembre 1998.
    3. B. Chaib-draa et J. Desharnais. A relational model of cognitive maps. Int. J. of Human-Computer Studies, 49(2):181–200, août 1998.
    4. R. Ben Ayed, J. Desharnais, M. Frappier et A. Mili. Mathematical foundations for program transformations. Logic Programming Synthesis and Transformation, 8th International Workshop, LOPSTR 1998, Manchester, Royaume-Uni, Juin 1998. Lecture Notes in Computer Science, volume 1559, Springer, 1999, pages 319–321.
    5. M. Frappier, A. Mili et J. Desharnais. Unifying program construction and modification. Logic Journal of the IGPL (Interest Group in Pure and Applied Logics), 6(2):317–340, mars 1998.
    1. L. Labed Jilani, M. Frappier, J. Desharnais, A. Mili et R. Mili. Retrieving software components that minimize adaptation effort. 12th IEEE Int. Conference on Automated Software Engineering, Incline Village, Nevada, novembre 1997.
    2. J. Desharnais, M. Frappier, R. Khédri et A. Mili. Integration of sequential scenarios. 6th European Software Engineering Conference / 5th ACM SIGSOFT Symposium on the Foundations of Software Engineering, Zurich, Suisse, septembre 1997, Lecture Notes in Computer Science, volume 1301, Springer, 1997, pages 310–326. Aussi, ACM Software Engineering Notes, 22(6):310–326, novembre 1997.
    3. R. Mili, J. Desharnais, M. Frappier et A. Mili. A calculus of program modifications. ACM SIGSOFT 1997 Symposium on Software Reusability (SSR'97), Boston, MA, USA, mai 1997. ACM Software Engineering Notes, 22(3):157–168.
    4. M. Frappier, A. Mili et J. Desharnais. Defining and detecting feature interactions. IFIP TC 2 Working Conference on Algorithmic Languages and Calculi, pages 212–239, Le Bischenberg, France, février 1997, Chapman and Hall, 1997.
    5. M. Frappier, A. Mili et J. Desharnais. Detecting feature interactions on relational specifications. Feature Interactions in Telecommunications IV, IOS Press, 1997.
    1. M. Frappier, A. Mili et J. Desharnais. A relational calculus for program construction by parts. Science of Computer Programming, 26(1–3):237–254, mai 1996.
    2. F. Tchier et J. Desharnais. La sémantique démoniaque par des graphes de contrôle relationnels. 4e Conférence Maghrébine en Génie Logiciel et Intelligence Artificielle, pages 17–28, Alger, Algérie, avril 1996.
    1. J. Desharnais, N. Belkhiter, S. Ben Mohamed~Sghaier, F. Tchier, A. Jaoua, A. Mili et N. Zaguia. Embedding a demonic semilattice in a relation algebra. Theoretical Computer Science, 149(2):333–360, octobre 1995.
    2. F. Tchier et J. Desharnais. Generalization of a theorem of Mills. 10th International Symposium on Computer and Information Sciences, Kusadasi, Turquie, octobre 1995, pages 27–34.
    3. M. Frappier, A. Mili et J. Desharnais. Program construction by parts. Mathematics of Program Construction (MPC 1995), juillet 1995, Lecture Notes in Computer Science, volume 947, Springer, 1995, pages 257–281.
    1. N. Belkhiter, A. Jaoua, J. Desharnais, G. Ennis, H. Ounalli et M.M. Gammoudi. Formal properties of rectangular relations. 9th International Symposium on Computer and Information Sciences, Antalya, Turquie, novembre 1994, pages 310–318.
    2. B. Chaib-draa, J. Desharnais et S. Lizotte. A relation graph formulation for relationships among agents. 13th International Distributed Artificial Intelligence Workshop, Lake Quinalt Lodge, WA, juillet 1994.
    3. B. Chaib-draa, J. Desharnais, R. Khédri, I. Jarras, S. Sayadi et F. Tchier. Une approche relationnelle à la décomposition parallèle. Colloque sur les méthodes mathématiques pour la synthèse de systèmes informatiques (BMW 94), Montréal, mai 1994, pages 89–103.
    4. A. Alikacem, S. Ben Mohamed Sghaier, J. Desharnais, M. El Ouali et F. Tchier. From demonic semantics to loop construction: A relation algebraic approach. 3e Conférence Maghrébine en Génie Logiciel et Intelligence Artificielle, Rabat, Maroc, avril 1994, pages 239–248.
    1. J. Desharnais, A. Jaoua, F. Mili, N. Boudriga et A. Mili. A relational division operator: The conjugate kernel. Theoretical Computer Science, 114(2):247–272, 1993.
    2. J. Desharnais, A. Mili et F. Mili. On the mathematics of sequential decompositions. Science of Computer Programming, 20(3):253–289, juin 1993.
    3. N. Belkhiter, J. Desharnais, A. Jaoua et T. Moukam. Providing relevant additional information to users asking queries using a Galois lattice structure. 8th Int. Symposium on Computer and Information Sciences, Antalya, Turquie, novembre 1993.
    1. A. Jaoua, N. Belkhiter, J. Desharnais et T. Moukam. Propriétés des dépendances difonctionnelles dans les bases de données relationnelles. INFOR 30(3):297–316, août 1992.
    2. J. Desharnais, A. Jaoua, N. Belkhiter et F. Tchier. Data refinement in a relation algebra. 2e Conférence Maghrébine en Génie Logiciel et Intelligence Artificielle, avril 1992, Tunis.
    1. A. Jaoua, N. Belkhiter, J. Desharnais et R. Khédri. Augmentation automatique de la fiabilité d'un logiciel. ICO Québec, 3(3):332–337, automne 1991.
    2. A. Jaoua, N. Belkhiter, J. Desharnais et T. Moukam. Augmentation automatique de la fiabilité d'un logiciel. Colloque GIRICO d'Intelligence Artificielle et de Génie Logiciel, Université de Sherbrooke, mai 1991.
    1. J. Desharnais et N. H. Madhavji. Abstract relational specifications. IFIP TC2 Working Conference on Programming Concepts and Methods, avril 1990, Israël, North-Holland, pages 267–284.
    1. J. Desharnais et N. H. Madhavji. Relation level semantics. 8th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, Inde, décembre 1988. Lecture Notes in Computer Science, volume 338, Springer, pages 304–328.
    2. N. H. Madhavji, L. Pinsonneault, K. Toubache et J. Desharnais. A new approach to cursor movements in user interfaces of integrated programming environments. Information and Software Technology, 30(9):535–546, novembre 1988.
    3. N. H. Madhavji, J. Desharnais, L. Pinsonneault et K. Toubache. Adapting modules to an integrated programming environment. 8th IEEE Conference on Computer Languages, pages 364–371, Miami Beach, FL, octobre 1988.
    4. A. Mili, J. Desharnais et J.-R. Gagné. Version japonaise de : Formal models of stepwise refinement of programs, ACM Computing Surveys, 18(3):231–276, septembre 1986, parue dans le journal japonais BIT, Kyoritsu Shuppan Co., Ltd, 79–108, mai 1988.
    1. A. Mili, J. Desharnais et F. Mili. Relational heuristics for the design of deterministic programs. Acta Informatica, 24(3):239–276, 1987.
    2. J. Desharnais, F. Mili et A. Mili. A perspective on programming knowledge. 4th Int. Workshop on Software Specification and Design, Monterey, CA, avril 1987, pages 9–12.
    1. A. Mili, J. Desharnais et J.-R. Gagné. Formal models of stepwise refinement of programs. ACM Computing Surveys, 18(3):231–276, septembre 1986.
    1. A. Mili, J. Desharnais et J.-R. Gagné. Strongest invariant functions : their use in the systematic analysis of while statements. Acta Informatica, 22(1):47–66, avril 1985.
    1. A. Mili et J. Desharnais. A system for classifying program verification methods: Assigning meanings to program verification methods. 7th Int. Conference on Software Engineering, Orlando, FL, mars 1984, pages 499–509.
    2. J. Desharnais et A. Mili. Relations as the basis for program specification, analysis and design. Int. Workshop on Models and Languages for Specification and Design, Orlando, FL, mars 1984, pages 137–139.
    3. A. Mili et J. Desharnais. Toward the automatic symbolic execution of while statements. 17th Hawaii Int. Conference on System Sciences, Honolulu, HI, janvier 1984, pages 378–382.

Livres, chapitres de livres et numéros thématiques de revues

    1. Claude Bolduc, Jules Desharnais et Béchir Ktari, éditeurs. Comptes rendus de Mathematics of Program Construction, 10th International Conference, MPC 2010, Québec, Canada, 21–23 juin 2010. Lecture Notes in Computer Science, volume 6120, Springer, 2010.
    1. Jules Desharnais et Bernhard Möller. Least reflexive points of relations. Dans O. Danvy, H. Mairson, F. Henglein et A. Pettorossi, éditeurs, Automatic Program Development – A Tribute to Robert Paige, pages 215–228, Springer, janvier 2008.
    1. Jules Desharnais, Marc Frappier et Wendy McCaull, éditeurs. Relational Methods in Computer Science: The Québec Seminar. Methodos Publishers, Bissendorf, Germany, 152 pages, 2002. Sélection d'articles de 5th Seminar on Relational Methods in Computer Science (RelMiCS 2000), Valcartier, Québec, Canada, 10–14 janvier 2000.
    1. Jules Desharnais, Marc Frappier et Wendy McCaull, éditeurs. Numéro spécial : Relational methods in computer science. Information Sciences, 139(3–4), décembre 2001. Sélection d'articles de 5th Seminar on Relational Methods in Computer Science (RelMiCS 2000), Valcartier, Québec, Canada, 10–14 janvier 2000.
    1. J. Desharnais, M. Frappier et A. Mili. State Transition Diagrams. Dans P. Bernus, K. Mertins et G. Schmidt, éditeurs, Handbook on Architectures of Information Systems, chapitre 7, pages 147–166, Springer, 1998.
    1. J. Desharnais, A. Mili et T. T. Nguyen. Refinement and demonic semantics. Dans C. Brink, W. Kahl et G. Schmidt, éditeurs, Relational Methods in Computer Science, chapitre 11, pages 166–183, Springer, 1997.
    2. J. Desharnais, B. Hodgson et J. Mullins. Linear logic. Dans C. Brink, W. Kahl et G. Schmidt, éditeurs, Relational Methods in Computer Science, chapitre 7, pages 106–114, Springer, 1997.
    1. J. Desharnais, A. Mili, R. Mili, J. Mullins et Y. Slimani. Semantics of concurrent programming. Dans A. Y. Zomaya, éditeur, Parallel and Distributed Computing Handbook, chapitre 2, pages 24–58. McGraw-Hill, New York, NY, 1996.
    1. A. Mili, J. Desharnais et F. Mili. Computer Program Construction. Oxford University Press, New York, NY, 1994.

Tutoriels

  1. Jules Desharnais. Basics of Relation Algebra. Tutoriel présenté pendant la 10th International Conference on Relational Methods in Computer Science (RelMiCS10) and 5th International Conference on Applications of Kleene Algebra (AKA5), Frauenwörth, Allemagne, avril 2008. http://www.uni-augsburg.de/rel_aka

Rapports de recherche

  1. Jules Desharnais et Bernhard Möller. Non-associative Kleene algebra and temporal logics. Rapport de recherche 2016-08, Institut für Informatik, Universität Augsburg, Décembre 2016.
  2. Patrice Lacroix et Jules Desharnais. Buffer Overflow Vulnerabilities in C and C++. Rapport de recherche DIUL-RR-0803, Département d'informatique et de génie logiciel, Université Laval, 75 pages, août 2008.
  3. Jean-Lou De Carufel et Jules Desharnais. On the Structure of Demonic Refinement Algebras. Rapport de recherche DIUL-RR-0802, Département d'informatique et de génie logiciel, Université Laval, 31 pages, janvier 2008.
  4. Jean-Lou De Carufel et Jules Desharnais. Demonic algebra with domain. Rapport de recherche DIUL-RR-0601, Département d'informatique et de génie logiciel, Université Laval, 55 pages, juin 2006.
  5. Jules Desharnais, Bernhard Möller et Fairouz Tchier. Kleene under a modal demonic star. Rapport de recherche 2004-11, Institut für Informatik, Universität Augsburg, 41 pages, mai 2004.
  6. Jules Desharnais, Bernhard Möller and Georg Struth. Modal Kleene algebra and applications – A survey. Rapport de recherche DIUL-RR-0401, Département d'informatique et de génie logiciel, Université Laval, 31 pages, mars 2004.
  7. Jules Desharnais, Bernhard Möller et Georg Struth. Termination in modal Kleene algebra. Rapport de recherche 2004-4, Institut für Informatik, Universität Augsburg, 16 pages, janvier 2004.
  8. Jules Desharnais, Bernhard Möller et Georg Struth. Kleene algebra with domain. Rapport de recherche 2003-7, Institut für Informatik, Universität Augsburg, 45 pages, mai 2003.
  9. Jules Desharnais et Bernhard Möller. Least reflexive points of relations. Rapport de recherche 2002-13, Institut für Informatik, Universität Augsburg, 33 pages, juin 2002.
  10. Jules Desharnais et Bernhard Möller. Characterizing determinacy in Kleene algebras (version révisée). Rapport de recherche 2001-3, Institut für Informatik, Universität Augsburg, 30 pages, avril 2001.
  11. Jules Desharnais et Bernhard Möller. Characterizing determinacy in Kleene algebras. Rapport de recherche 2000-5, Institut für Informatik, Universität Augsburg, 34 pages, mai 2000.
  12. Jules Desharnais, Bernhard Möller et Fairouz Tchier. Kleene under a demonic star. Rapport de recherche 2000-3, Institut für Informatik, Universität Augsburg, 17 pages, février 2000.

Thèse

Jules Desharnais. Abstract relational semantics. Thèse de doctorat, Université McGill, juillet 1989.