Publications Scientifiques
Permanent URI for this communityhttps://dspace.univ-boumerdes.dz/handle/123456789/10
Browse
40 results
Search Results
Item Formal Methods for Internet of Things: a Concise Classification(Université M’hamed Bougara de Boumerdes : Faculté des Sciences, 2024) Talamali, Ibtissem; Lounas, Razika; Mezghiche, MohamedItem Formalisation de la logique de description ALC dans l'assistant de preuve Coq(2009) Chaabani, Mohamed; Mezghiche, Mohamed; Strecker, MartinLe langage d’ontologie Web (Web Ontology Language OWL) est un langage utilis ́e pour le web s ́emantique. OWL est bas ́e sur les logiques de description (LD), une famille de lan- gages adapt ́es pour la repr ́esentation et le raisonnement sur des connaissances d’un domaine d’application d’une fa ̧con structur ́ee et formelle. Le web s ́emantique est actuellement l’un des champs d’application des m ́ethodes formelles, dont l’objectif est d’assurer leur fiabilit ́e. Un point essentiel de l’application de ces m ́ethodes formelles est la preuve de va- lidit ́e des raisonnements dans des LDs, comme celle de la terminaison, l’ad ́equation (soundness) et la compl ́etude d’un raisonneur. Dans ce papier, on pr ́esente une sp ́ecification formelle de la syntaxe et de la s ́emantique de ALC, qui est consid ́er ́ee comme un repr ́esentant typique d’une large gamme de LDs. On prouve pour cette logique les pro- pri ́et ́es d’ad ́equation, de compl ́etude et de terminaison dans l’assistant de preuve Coq.Item Vérification d'une méthode de preuve pour la logique de description ALC(2010) Chaabani, Mohamed; Mezghiche, Mohamed; Strecker, MartinLes logiques de description (DLs) sont une famille de langages utilisés pour la représentation et le raisonnement sur des connaissances d’un domaine d’application d’une manière structurée et formelle. Pour atteindre cet objectif, plusieurs raisonneurs ont été implantés, comme RACER et FACT++. Toutes ces implantations n’ont pas encore été certifiées. Pour garantir la correction des déri- vations des propriétés dans les DLs, il s’avère nécessaire de valider formellement le processus de raisonnement appliqué aux DLs. Dans ce papier, nous présentons une définition d’un raisonneur pour la logique de description ALC basé sur la méthode du tableau sémantique. On assure la validité de notre raisonneur par la preuve des propriétés de son adéquation, de sa complétude et de sa terminaison dans l’assistant de preuve Isabelle/HOL. La preuve procède en deux étapes: elle établit les propriétés sur un niveau abstrait, ensembliste, et les instancie ensuite pour une implantation sur des listes.Item A Formalized procedure for database horizontal fragmentation in isabelle/HOL Proof Assistant(Springer, 2018) Cheikh, Salmi; Chaabani, Mohamed; Mezghiche, MohamedWe propose a logical procedure for the horizontal fragmentation problem based on predicate abstraction over the entire domain of database relations. The set of minterm predicates is constructed using rewriting rules similar to the well-known semantic tableau algorithm. The procedure start from an initial set of simple predicates, build the set of minterm predicates until rules are no longer required. To ensure this proposition, we give a formal proof of its correctness namely, it’s soundness, completeness and termination with Isabelle proof assistant. The main contribution of this work are: refining the minterm approach by adding a semantic layer to predicates, minimizing the set of minterm predicates by automatically eliminating contradictory ones, detecting and handling subsumptions between them. This leads to the best construction time of the final partitioning schema. Finally, a source code of the procedure is generated automatically by the Isabelle proof assistant.Item Multi-agent medical image segmentation : a survey(Elsevier, 2023) Bennai, Mohamed Tahar; Guessoum, Zahia; Mazouzi, Smaine; Cormier, Stéphane; Mezghiche, MohamedDuring the last decades, the healthcare area has increasingly relied on medical imaging for the diagnosis of a growing number of pathologies. The different types of medical images are mostly manually processed by human radiologists for diseases detection and monitoring. However, such a procedure is time-consuming and relies on expert judgment. The latter can be influenced by a variety of factors. One of the most complicated image processing tasks is image segmentation. Medical image segmentation consists of dividing the input image into a set of regions of interest, corresponding to body tissues and organs. Recently, artificial intelligence (AI) techniques brought researchers attention with their promising results for the image segmentation automation. Among AI-based techniques are those that use the Multi-Agent System (MAS) paradigm. This paper presents a comparative study of the multi-agent approaches dedicated to the segmentation of medical images, recently published in the literatureItem Towards compositional verification of synchronous reactive systems(2021) Chabane, Sarah; Ameur-Boulifa, Rabéa; Mezghiche, MohamedWe present work towards a compositional design approach that will lead designers to develop safe reactive systems. To this end, we extend the theory of I/O-automata that is widely used for modelling reactive systems with composition operator required for dealing with a specific assembly of such systems: systems that consist of a chain of components arranged so that the output of each component is the input of the next, and behave like pipelines. We show that the proposed composition operator ensures semantics preserving of reactive components models. The paper presents a general result on correct-by-construction approach for reactive systems designItem Persistent fault injection attack from white-box to black-box(IEEE, 2017) Mesbah, Abdelhak; Mezghiche, Mohamed; Lanet, Jean-LouisAmong the protection mechanisms that ensure the Java Card security, the Byte Code Verifier (BCV) is one of the most important security elements. In fact, embedded applets must be verified prior installation. This prevents ill-formed applet to be loaded. In this article, the behavior of the Oracle BCV towards some unchecked piece of codes is analyzed, and the way to bypass the BCV is highlighted. Then, we demonstrate how one can use this breach to access to the system data of a frame, and persistently activate any code. Using both a white-box approach and fault injection that can transform a well-formed code to an ill-formed one during runtime executionItem A practical approach for verification of graph transformation with description logic(2020) Chaabani, Mohamed; Mezghiche, MohamedGraphs and visual models play a central role in the modeling and meta-modeling of software systems, these models are specified using a modeling formalism, in a high-level abstraction independent of the platform, in which the focus is on the concepts rather than the implementation. This allows keeping the model, transporting it, and then transforming it into code. Several graph transformation tools have been developed to ensure efficient transformations. This transformation requires a process of verification and validation to guarantee the correction of this transformation process, of which there are different ways to checking that a software system achieves its goal. In computer science, formal methods are techniques that allow rigorous reasoning, using semantic and formal methods, to prove their validity with respect to a certain set of properties. In this sense, description logics are promising candidates for encoding graph structures and reasoning about graph transformations, they are privileged target to operationalize graph transformation tools because they have the mechanisms of reasoning or inferenceItem Exploiting links to improve search in XML documents(Digital Information Research Foundation, 2018) Berchiche-Fellag, Samia; Mezghiche, MohamedThis paper describes an approach that ex-ploits links in XML retrieval. The proposed approach con-sists of reranking the set of documents returned for agiven query by considering three sources of evidencenamely, the relevance scores w.r.t query of a documentneighbours, the text of the anchor links, and the docu-ment title tag. Our approach is evaluated on INEX 2006collection. The results showed significant improvementsof the retrieval performancesItem Formal methods in dynamic software updating : a survey(Inderscience, 2019) Lounas, Razika; Mezghiche, Mohamed; Lanet, Jean LouisDymanic software updating DSU consists in updating running programs on-the-fly without any downtime that leads to systems unavailability. The use of DSU in critical applications raises several issues related to update correctness. Indeed, an erroneous dynamic update may introduce safety vulnerabilities and security breaches. In this perspective, the use of formal methods has gained a large interest since they respond to the high need of rigor required by such applications. Several frameworks were developed to first express update correctness which is based on several criteria. Then, the proposed formalisms are used to specify DSU systems, express correctness criteria and establish them. In this paper, we present a review of researches on the application of formal methods to DSU systems. We give a classification of systems according to the paradigms of programming languages and then we explain the correctness criteria and categorise the articles regarding the approaches of formalisation to establish the correctness. This information is useful to help ongoing researches in having an overview on the application of formal methods in DSU