Publications Scientifiques

Permanent URI for this communityhttps://dspace.univ-boumerdes.dz/handle/123456789/10

Browse

Author: search.filters.author.Mezghiche, MohamedHas files: Yes

Search Results

Now showing 1 - 10 of 35
  • Thumbnail Image
    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, Mohamed
  • No Thumbnail Available
    Item
    Formalisation de la logique de description ALC dans l'assistant de preuve Coq
    (2009) Chaabani, Mohamed; Mezghiche, Mohamed; Strecker, Martin
    Le 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.
  • No Thumbnail Available
    Item
    Vérification d'une méthode de preuve pour la logique de description ALC
    (2010) Chaabani, Mohamed; Mezghiche, Mohamed; Strecker, Martin
    Les 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.
  • No Thumbnail Available
    Item
    A Formalized procedure for database horizontal fragmentation in isabelle/HOL Proof Assistant
    (Springer, 2018) Cheikh, Salmi; Chaabani, Mohamed; Mezghiche, Mohamed
    We 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.
  • No Thumbnail Available
    Item
    Towards compositional verification of synchronous reactive systems
    (2021) Chabane, Sarah; Ameur-Boulifa, Rabéa; Mezghiche, Mohamed
    We 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 design
  • No Thumbnail Available
    Item
    Persistent fault injection attack from white-box to black-box
    (IEEE, 2017) Mesbah, Abdelhak; Mezghiche, Mohamed; Lanet, Jean-Louis
    Among 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 execution
  • No Thumbnail Available
    Item
    A practical approach for verification of graph transformation with description logic
    (2020) Chaabani, Mohamed; Mezghiche, Mohamed
    Graphs 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 inference
  • No Thumbnail Available
    Item
    Exploiting links to improve search in XML documents
    (Digital Information Research Foundation, 2018) Berchiche-Fellag, Samia; Mezghiche, Mohamed
    This 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 performances
  • No Thumbnail Available
    Item
    A new AOMDV lifetime prolonging routing algorithm for Ad-Hoc networks
    (IGI Global, 2019) Baddari, Ibtihel; Riahla, Mohamed Amine; Mezghiche, Mohamed
    Network lifetime is a key design metric in MANETs, it is considered as one of the most important parametersalgorithmstobeusedinadhocnetworks.Eachnetworknodeworkscompletely independently and acts as a router for relaying communications. If some nodes die prematurely because of battery depletion, the network lifetime will be adversely affected, and the network will get disconnected. This article presents AOMDV-LP, a new AOMDV lifetime-prolonging routing algorithm for MANETs. This new algorithm helps to maximize the network lifetime by managing nodesenergy,linkcostandcontrollingthenetworkscongestion.Simulationsquantifytheperformance gains of the authors algorithm
  • No Thumbnail Available
    Item
    Hiding a fault enabled virus through code construction
    (2020) Hamadouche, Samiya; Lanet, Jean-Louis; Mezghiche, Mohamed
    Smart cards are very secure devices designed to execute applica-tions and store confidential data. Therefore, they become the target of manyhardware and software attacks that aim to bypass their embedded securitymechanisms in order to gain access to the sensitive stored data. Recently, anew kind of attacks called combined attacks has appeared. They aim to induceperturbations in the application’s execution environment. Thus, correct andlegitimate application can be dynamically modified to become a hostile one af-ter being loaded in the card using a fault injection. In this paper, we treat theproblem from another angle: how to design an innocent looking code in sucha way that it becomes intentionally hostile after being activated by a fault in-jection? We present an original approach of backward code construction basedon constraints satisfaction and a tree traversal algorithm. After that, we pro-pose a way to optimize the search process by introducing heuristics for a fasterconvergence towards more realistic solutions.We implement this approach inaTrace Generatortool; thereafter evaluate its capacity to generate the re-quired solutions while giving a proof-of-concept of the code desynchronizationtechnique