Branching Temporal Logic of Calls and Returns for Pushdown Systems - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Branching Temporal Logic of Calls and Returns for Pushdown Systems

Huu Vu Nguyen
  • Fonction : Auteur
Tayssir Touili

Résumé

Pushdown Systems (PDSs) are a natural model for sequential programs with (recursive) procedure calls. In this work, we define the Branching temporal logic of CAlls and RETurns (BCARET) that allows to write branching temporal formulas while taking into account the matching between calls and returns. We consider the model-checking problem of PDSs against BCARET formulas with "standard" valuations (where an atomic proposition holds at a configuration c or not depends only on the control state of c, not on its stack) as well as regular valuations (where the set of configurations in which an atomic proposition holds is regular). We show that these problems can be effectively solved by a reduction to the emptiness problem of Alternating Büchi Pushdown Systems. We show that our results can be applied for malware detection.
Fichier principal
Vignette du fichier
CARET For CTL-01May2018.pdf (379.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03902463 , version 1 (15-12-2022)

Identifiants

Citer

Huu Vu Nguyen, Tayssir Touili. Branching Temporal Logic of Calls and Returns for Pushdown Systems. 14th International Conference Integrated Formal Methods (IFM 2018 ), Sep 2018, Maynooth, Ireland. ⟨10.1007/978-3-319-98938-9_19⟩. ⟨hal-03902463⟩
3 Consultations
7 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More