Search

Your search keyword '"Martina Maggio"' showing total 203 results
Start Over Author "Martina Maggio"
203 results on '"Martina Maggio"'

202. Model-bounded monitoring of hybrid systems

Author

Ichiro Hasuo, Étienne André, Masaki Waga, Kyoto University [Kyoto], National Institute of Informatics (NII), Proof-oriented development of computer-based systems (MOSEL), Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria), Graduate University for Advanced Studies [Hayama] (SOKENDAI), This work is partially supported by JST ACT-X Grant No. JPMJAX200U, by JST ERATO HASUO Metamathematics for Systems Design Project (No. JPMJER1603), by JSPS Grant-in-Aid No. 18J22498, and by ANR-NRF ProMiS (ANR-19-CE25-0015)., Martina Maggio, James Weimer, JST ACT-X Grant No. JPMJAX200U, ERATO HASUO Metamathematics for Systems Design Project (No. JPMJER1603), JST, JSPS Grant-in-Aid No. 18J22498, Mohammad Al Farque, Meeko Oishi, ANR-19-CE25-0015,ProMiS,Mitigation formelle d'attaques via canaux auxiliaires par vérification paramétrée(2019), Kyoto University, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Modeling and Verification of Distributed Algorithms and Systems (VERIDIS), Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
FOS: Computer and information sciences, Scheme (programming language), 0209 industrial biotechnology, Computer Science - Logic in Computer Science, Control and Optimization, Monitoring, Formal Languages and Automata Theory (cs.FL), Computer Networks and Communications, Computer science, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification, Computer Science - Formal Languages and Automata Theory, Systems and Control (eess.SY), 02 engineering and technology, Machine learning, computer.software_genre, cyber-physical systems, Electrical Engineering and Systems Science - Systems and Control, Reduction (complexity), 020901 industrial engineering & automation, Artificial Intelligence, Reachability, Bounding overwatch, FOS: Electrical engineering, electronic engineering, information engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], computer.programming_language, business.industry, Cyber-physical system, D.2.4, hybrid automata, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, Logic in Computer Science (cs.LO), Automaton, Human-Computer Interaction, F.3.1, Hardware and Architecture, Hybrid system, runtime verification, Artificial intelligence, business, computer, Interpolation
Abstract

Monitoring of hybrid systems attracts both scientific and practical attention. However, monitoring algorithms suffer from the methodological difficulty of only observing sampled discrete-time signals, while real behaviors are continuous-time signals. To mitigate this problem of sampling uncertainties, we introduce a model-bounded monitoring scheme, where we use prior knowledge about the target system to prune interpolation candidates. Technically, we express such prior knowledge by linear hybrid automata (LHAs) - the LHAs are called bounding models. We introduce a novel notion of monitored language of LHAs, and we reduce the monitoring problem to the membership problem of the monitored language. We present two partial algorithms - one is via reduction to reachability in LHAs and the other is a direct one using polyhedra - and show that these methods, and thus the proposed model-bounded monitoring scheme, are efficient and practically relevant., This is the author (and slightly extended) version of the manuscript of the same name published in the proceedings of the 12th ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS 2021)

Published
2021

203. Model Checking of Cache for WCET Analysis Refinement

Author

Valentin Touzeau, Claire Maïza, David Monniaux, VERIMAG (VERIMAG - IMAG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Antoine Bertout, Martina Maggio, ANR-12-INSE-0001,W-SEPT,WCET: SEmantique, Précision, Traçabilité(2012), and European Project: 306595,EC:FP7:ERC,ERC-2012-StG_20111012,STATOR(2013)

Subjects
Least Recently Used Cache, [INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Hardware_MEMORYSTRUCTURES, Computer Science - Programming Languages, Cache Analysis, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Worst Case Execution Time, Model Checking, Programming Languages (cs.PL), Logic in Computer Science (cs.LO)
Abstract

International audience; On real-time systems running under timing constraints, scheduling can be performed when one is aware of the worst case execution time (WCET) of tasks. Usually, the WCET of a task is unknown and schedulers make use of safe over-approximations given by static WCET analysis. To reduce the over-approximation, WCET analysis has to gain information about the underlying hardware behavior, such as pipelines and caches. In this paper, we focus on the cache analysis, which classifies memory accesses as hits/misses according to the set of possible cache states. We propose to refine the results of classical cache analysis using a model checker, introducing a new cache model for the least recently used (LRU) policy.

Published
2017

Catalog

Books, media, physical & digital resources
See catalog results