profile photo
أ.د.خالد محمد الصادق بسيس
  • 115888385
  • 0581791001

مهام إدارية

عضو المجلس العلمي لجامعة الأمير سطام بن عبد العزيز ابتداء من السنة الجامعية 1439-1440 

رئيس وحدة البحث العلمي  بكلية هندسة و علوم الحاسب بجامعة الأمير سطام بن عبد العزيز  ابتداء من السنة الجامعية 1439-1440 

المشرف على قسم علوم الحاسب بكلية هندسة و علوم الحاسب بجامعة الأمير سطام بن عبد العزيز 1437-1438 و 1438-1439

عضو مجلس كلية هندسة و علوم الحاسب بجامعة الأمير سطام بن عبد العزيز 1437-1438 و 1438-1439

رئيس لجنة الدراسات العليا بكلية هندسة و علوم الحاسب بجامعة الأمير سطام بن عبد العزيز 1437-1438

المؤهلات العلمية

1983 الشھادة الجامعیة للدراسات العلمیة (ریاضیَّات و فیزیاء) من كلیة العلوم بتونس

1987 شھادة مھندس أوَّل في الإعلامیة من كلیة العلوم بتونس

1990 شھادة التعمُّق في البحث من جامعة نانسي 1 بفرنسا

1993 شھادة الدكتوراه من جامعة نانسي 1 بفرنسا

1999 شھادة التأھیل الجامعي من كلیة العلوم بتونس

الخبرات الإدارية

تمتدُّ خبرتي لما یزید عن 27 عاما من أبرزھا

* إنتدابي بالوظیفة العمومیة الفرنسیة مرسَّم كباحث بالمعھد الوطني للبحوث في الإعلامیة والأتوماتیك INRIA 

بفرنسا عام 1993 م

* انتدابي بالوظیفة العمومیة التونسیة كباحث بالمعھد الإقلیمي لعلوم الإعلامیة والإتصال عن بعد عام  1987 م

* تمتدُّ تجربتي بالتدریس بفرنسا و بتونس و بالمملكة العربية السعودية  لأكثر من 25 عاما منھا15 عاما كأستاذ تعلیم عا ل

* مشاركتي في عدد ھام من لجان الإنتداب لجمیع أصناف خطط التدریس :أستاذ، استاذ مشارك ٬ أستاذ مساعد، مساعد

* مشاركتي كخبیر لمدّة أربع سنوات في اللجنة القطاعیّة لعلوم الإعلامیة لإصلاح التعلیم العالي بتونس وذلك بتركیز منظومة إِمَدْ :إجازة  ماجستیر  دكتوراه

* انتخابي لإدارة قسم علوم الإعلامیة لمدة 3 سنوات بكلیة العلوم بتونس عام 2006 م

الأبحاث العلمية

DISSERTATIONS

-LDT : Un langage de définition des transformations de programmes logiques. Dissertation

of Diplome d’Etudes Approfondies (DEA), Informatique, Faculté des Sciences de Nancy, France. Defended September 1990.

-Construction de programmes logiques par synthèse de propriétés. Dissertation of Doctorat De l’Université de Nancy 1. Defended November 1993.

-Preuve de formule implicatives. Dissertation of Habilitation universitaire à diriger de la recherche de la Faculté des Sciences de Tunis, Université de Tunis El Manar. Defended June 1999.

JOURNALS

[1] Asma LouhichiWided Ghardallou, Khaled Bsaïes, Lamia Labed JilaniOlfa MraihiAli Mili: Verifying while loops with invariant relations. IJCCBS 5(1/2): 78-102 (2014)

 [2] Lamia Labed JilaniOlfa MraihiAsma LouhichiWided Ghardallou, Khaled Bsaïes, Ali Mili: Invariant functions and invariant relations: An alternative to invariant assertions. International Journal of Symbolic Computation 48: 1-36 (2013)

 [3] Wided GhardallouOlfa MraihiAsma LouhichiLamia Labed Jilani, Khaled Bsaïes, Ali Mili: A versatile concept for the analysis of  loops. International  Algebraic Programming 81(5): 606-622 (2012)

 [4] Lamia Labed JilaniImen Derbel, Khaled Bsaïes, Hamdi NasreddineAli Mili: Reasoning About Quantitative Architectural Attributes (Invited Paper). JSW 6(4): 574-583 (2011)

 [5] M. Demba and Khaled Bsaïes. Appropriate Lemmas Discovery. Journal of Information Science, 163(4):221-237. Elsevier Science, 2004.

 [6] Francis Alexandre, Khaled Bsaïes et Moussa Demba: Correction de conjectures fausses par synthese de programmes. Technique et Science Informatiques (TSI). 22(1): 307-310 (2003)

 [7] F. Alexandre and  Khaled Bsaïes. A Methodology for Developing Logic Programs. Int. Journal Fundamenta Informatica, 29(3):203-224, 1997.

 [8] Khaled Bsaïes, F. Alexandre and A. Quéré. Transformation of Generate and Test Logic Programs. International Journal of Methods of Logics in Computer Science, 1(3):335-357, 1994.

CONFERENCES
[9] Wissal Ben Marzouka:
New method of registration based on the theory of possibility. 4th International Conference on Advanced Technologies for Signal and Image Processing, ATSIP 2018, Sousse, Tunisia, March 21-24, 2018. IEEE , ISBN 978-1-5386-5239-8 ATSIP 20181-6

 [10] Fatma DhaouSciTePress , ISBN 978-989-758-300-1  ENASE 2018275-282

[11] Fatma Dhaou, Inès MouakherChristian AttiogbéKhaled Bsaïes: A Causal Semantics for UML2.0 Sequence Diagrams with Nested Combined Fragments ENASE 2017

[12] Fatma DhaouInès MouakherChristian Attiogbé, Khaled Bsaïes: Refinement of UML2.0 Sequence Diagrams for Distributed Systems. ICSOFT-EA 2016.
[13] Fatma DhaouInès MouakherChristian Attiogbé, Khaled Bsaïes: Extending Causal Semantics of UML2.0 Sequence Diagram for Distributed Systems. ICSOFT-EA 2015 : 339-347

 [14] Sonia Ben TichaAzim RoussanalyAnne Boyer, Khaled Bsaïes: Rocchio Algorithm to Enhance Semantically Collaborative Filtering. WEBIST (Revised Selected Papers)  2014: 295-311

 [15] Sonia Ben TichaAzim RoussanalyAnne Boyer, Khaled Bsaïes: User Semantic Model for Dependent Attributes to Enhance Collaborative Filtering. WEBIST (2) 2014: 205-212

[16] Sonia Ben TichaAzim RoussanalyAnne Boyer, Khaled Bsaïes: User Semantic Preferences for Collaborative Recommendations. EC-Web 2012: 203-211.

 [17] Asma Louhichi, Olfa Mraihi, Wided Ghardallou, Lamia Labed Jilani, Khaled Bsaïes,

Ali Mili: Invariant relations: An automated tool to analyze loops . In Verification and

Evaluation of Computer and Communication Systems: VECoS 2011, Tunis, Tunisia,

September 2011.

 [18] Asma Louhichi, Khaled Bsaïes, Olfa Mraihi, Lamia Labed Jilani, Nafi Diallo, Ali Mili: Design, Implementation and Deployment of a Tool for the Functional Analysis of Loops. AICCSA 2011

 [19] Olfa MraihiWided GhardallouAsma LouhichiLamia Labed Jilani, Khaled Bsaïes, Ali Mili: Computing Preconditions and Postconditions of While Loops. ICTAC 2011: 173-193

[20] Asma Louhichi, Olfa Mraihi, Lamia Labed Jilani, Khaled Bsaies and Ali Mili. Relational Methods in the analysis of while loops: observations of versatility. In 11th International Conference on Relational Methods in Computer Science (RelMiCS 11) November 1 to 5, 2009 Doha, Qatar. Proceedings in the series. Lecture Notes in Computer Science - LNCS . The proceedings' editors are R.Berghammer, A. Jaoua, and B. Moller.

 [21] R. Zarrad, M. Demba and Khaled Bsaïes. Prouvabilite' et correction des formules Implicatives. JFPC 2008- Quatriemes Journes Francophones de Programmation par Contraintes, Nantes : France 1 - 7 Jul 2008. Rapport Interne Inria-00293706.

 [22] M. Demba, Khaled Bsaïes and F. Alexandre. Proving Theorems by Folding Unfolding. Proc. of Sciences Electroniques Technologies de l'Information et des Télécommunications, SETIT'2004. IEEE. Tunisia, 2004.

 [23] F. Alexandre, Khaled Bsaïes and M. Demba. Predicate synthesis from inductive proof attempt of faulty conjectures. Proc. of Logic Program Synthesis and Transformation LOPSTR'2003. LNCS Springer Verlag. 2003.

 [24] M. Demba, F. Alexandre and Khaled Bsaïes. Correction de conjectures fausses par synthèse de programmes. Douzièmes Journées Francophones de Programmation Logique et Programmation par Contraintes. JFPLC'2003. 307-310. Lavoisier, Hermes Science Publications. 2003.

 [25] M. Demba, F. Alexandre and Khaled Bsaïes. Correcting Faulty Conjectures by Logic Program Synthesis. Proc. ACS/IEEE Int. Conf. on Computer Systems and Applications. Tunis. July 2003.

 [26] M. Demba et Khaled Bsaïes. Découverte de lemmes par instanciation de méta variables dans les preuves par récurrences. Journée Francophone de Programmation Logique et Contraintes. JFPLC'2002. 227{240. Hermes Science Publications. Nice, Mai 2002.

 [27] M. Demba and Khaled Bsaïes. Appropriate Lemma Discovery. Proc. of the 2002 Int. Arab Conf. on Information Technology (ACIT'2002). Qatar 2002.

[28] R. Salem and Khaled Bsaïes. Unfold/Fold Inductive Proofs: An Extension of a Folding Technique. Proc. of the 12th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. In Lecture Notes in Artificial Intelligence, LNAI No 1611, page 612{621. Springer Verlag. Cairo Egypt, June 1999.

 [29] Khaled Bsaïes, F. Hammami, A. Jaoua and W. Ksontini. May reasoning be reduced to an information retrieval problem? Proc. of 4th Int. Workshop on Relational Methods in Computer Science. 15-18 septembre 1998. Varsovie, Pologne.

[30] A. Jaoua, Khaled Bsaïes, W. Ksontini, W. Khayat and S. Chaar. Design and experimentation of a reasoning approach based on information generation retrieval. Proceedings of Joint Conference on Information Systems. Octobre 23-28 1998. USA.

 [31] R. Salem and Khaled Bsaïes. A Strategy for Mechanizing Inductive proofs by Unfolding, Folding and Simpli_cation. in the Proc. of Int. Workshop on Relational Methods in Computer Science. Hammamet, January 1997.

[32] F. Alexandre and Khaled Bsaïes. Une technique de construction de programmes logiques basée sur un démonstrateur. Proc. Conf. Approches Formelles dans l'Assistance au Développement de Logiciels (AFADEL97). Toulouse mai 1997.

 [33] F. Alexandre and Khaled Bsaïes. Derivation of Logic Programs by Generating Eureka Properties. 7th International Workshop on Logic Program Synthesis and Transformations (LoPSTr97). Louvain, Juillet 1997.

[34] A. Bouhoula and Khaled Bsaïes. A New Framework for Mechanizing Logic Program Diagnosis. Accepted for presentation in International Workshop on Logic Program Synthesis and Transformation. Stokholm, August 1996.

 [35] Khaled Bsaïes. Discovering and Verifying Logic Program Properties. In Deaton, Ed. and George, K.M. Berghel, H and Hedrick,G. editors, Proc. of the 1995 ACM/SIGAPP Symposium on Applied Computing (SAC95). ACM-Press. Nashville, USA, 1995.

 [36] Khaled Bsaïes. Implementing the Synthesis of Properties in Unfold/Fold Transformations. In Manuel Hermenegildo editor, Proc. International Conference on Programming Language Implementation and Logic Programming (PLILP'94). In Lecture Notes in Computer Science LNCS, Springer Verlag. September 14-16, 1994, in Madrid (Spain).

[37] F. Alexandre and Khaled Bsaïes. A Methodology for Constructing Logic Programs. Proceeding of the ICLP'94 Post-conference workshop on Application of Logic Programming to Software Engineering, pages 120-138, 1994. S. Margherita Ligure, Italie.

 [38] Khaled Bsaïes. A Schema Guided Eureka Step Discovery for Transforming Logic Programs. Proceeding of the 10th Logic Programming Workshop, LPW'94. N.E.Fichs, and G.Gottlob editors. Zurich 1994.

 [39] Khaled Bsaïes. Automated Derivation of E_cient Logic Programs by Synthesizing Eureka Properties. In D.Miller, editor, Proc. Int. Logic Programming Symposium (ILPS), Vancouver, 1993. MIT-Press.

 [40] KhaledBsaïes and F. Alexandre. The Unfolding Problem in Logic Program Transformation: Decidability Results. In Proc. of the 1993 ACM/SIGAPP Symposium on Applied Computing (SAC93). ACM-Press, February 1993, Indianapolis, Indiana USA.

 [41] Khaled Bsaïes. A Framework for Mechanizing Logic Program Transformation: The Synthesis of Eureka-Properties. In Proc. of ACM SIGPLAN Workshop on Partial Evaluation and semantic-Based Program Manipulation, PEPM 92, pages 108-115, June 1992, San Fransisco, California.

 [42] Khaled Bsaïes. Static Analysis for the Synthesis of Eureka Properties for Transforming Lo2gic Programs. In K. Broda, editor, 4th UK Annual Conference on Logic programming, ALPUK92, pages 41-61. Workshops in Computing Series, Springer-Verlag, March-April 1992, London, UK.

[43] Khaled Bsaïes. On Using Eureka Properties for Transforming Generate and Test Logic Programs. In P. Dewilde and J. Vandewalle, editors, Proc. of The IEEE International Conference on Computer and Software Engineering COMP EURO 92, pages 113-114. IEEE Press, May 1992. Netherlands.

 [44] Khaled Bsaïes. A Strategy for Transforming Generate and Test Logic Programs. In H. Berghel, Ed. Deaton, G. Hedrick, D. Roach, and R. Wainwright, editors, Proc. of the 1992 ACM/SIGAPP Symposium on Applied Computing, pages 563-572. ACM PRESS, March 1992, Kansas City, Missouri.

 [45] Khaled Bsaïes and F. Alexandre. Une Utilisation des Modes entrée-sortie pour Transformer des Programmes Logiques. In the Proc. of the Second Maghrebien Conference on Software Engineering and Arti_cial Intelligence, pages 382-397, 1992, Tunis.

 [46] Khaled Bsaïes and F. Alexandre. Where Eureka Properties Needed in Logic Program Transformation. In E. Gelenbe, E. Halici, and N. Yalabik, editors, Proceedings of the Seventh International Symposium on computer and Information Sciences (ISCIS VII), pages 245-251, 1992. Antalya, Turkey.

 [47] F. Alexandre, Khaled Bsaïes, J.P. Finance and A. Quere. Spes: A System for Logic Program Transformation. In A. Voronkov, editor, Proc. of the International Conference on Logic Programming and Automated Reasoning (LPAR'92), volume 624 of Lecture Notes in Artificial Intelligence LNAI, pages 445-447. Springer-Verlag, July 1992. St. Petersburg, Russia.

 [48] Khaled Bsaïes and F. Alexandre. On Using Formal Tools for Developing Logic Programs. In P. Kellomaki K.Systa and R. Makinen, editors, Proc. of the Fifth Nordic Workshop on Programming Environment Research. Tampere University of Technology, Software Systems Laboratory, 1992. Tampere, Finland.

 [49] F. Alexandre, Khaled Bsaïes and A. Quéré. On Using Mode Input-output for Transforming Logic Programs. In K-K. Lau and T. Clement, editors, Proceedings of the 1st International Workshop on Logic Program Synthesis and Transformation (LoPSTr 91), pages 129-147. Workshops in Computing Series, Springer-Verlag, 1991. Manchester, UK.

TECHNICAL REPORTS INRIA Inria (National Institute of research in Computer Science and Automata France) and CRIN (Informatics Research Center of Nancy France)

[50] M. Demba, Khaled Bsaïes and F. Alexandre. Correcting Faulty Conjectures by Logic Program Synthesis. RI A03-R-219. 2003.

 [51] M. Demba, F. Alexandre and Khaled Bsaïes. Correction de conjectures fausses par synthèse de programmes. RI A03-R-219. 2003.

 [52] M. Demba, F. Alexandre and Khaled Bsaïes. Correction de conjectures fausses par synthèse de programmes. RI A03-R-218. 2003.

[53] F. Alexandre, Khaled Bsaïes and M. Demba. Predicate synthesis from inductive proof attempt of faulty conjectures. RI A03-R-217. 2003.

 [54] M. Demba, F. Alexandre and Khaled Bsaïes. Correction de conjectures fausses. RI A02-R-492. 2002.

 [55] F. Alexandre, M. Bemba and Khaled Bsaïes. Stratégies de preuves par récurrence basées sur le pliage et le d_epliage. RI A01-R-284. 2001.

 [56] F. Alexandre and Khaled Bsaïes. Pliage et récurrence pour la construction de programmes. RI A00-R-382. 2000.

 [57] F. Alexandre and Khaled Bsaïes. Stratégies de dérivation de programmes logiques. RI 99-R-253. 1999.

 [58] F. Alexandre and Khaled Bsaïes. Derivation of Logic Programs by Generating Eureka Properties. RI 97-R-207. 1997.

 [59] F. Alexandre and Khaled Bsaïes. Une technique de construction de programmes logiques basée sur un démonstrateur. RI 97-R-069. 1997.

 [60] F. Alexandre and Khaled Bsaïes. A Methodology for Constructing Logic Programs. RI 97-R-064. 1997.

 [61] Khaled Bsaïes and F. Alexandre. Modes entrée-sortie pour l'analyse statique des programmes logiques. Rapport interne 91-R-186. CRIN, décembre 1991.

 [62] Khaled Bsaïes. Automated Derivation of Efficient Logic Programs by Synthesising and Proving Eureka Properties. extended version of the paper presented in ILPS93 also Rapport interne no93-R-072, CRIN Centre de recherche en informatique de Nancy, décembre 1993.

المهارات

RESEARCH, TEACHING INTERESTS :

Data and program specification

Semantics of declarative programs

Program design and verification

Computer science foundations

Algorithmic and heuristic programming

Automatic Transformation of Declarative programs

Automatic Deduction of implicative properties

Correction of faulty conjectures

Program Synthesis

Compiler Construction techniques

Calculability

Logic in Computer Science

Artificial Intelligence