Výsledky vyhledávání - "Olesen, Mads Chr."

Modelling attack-defense trees using timed automata

Autor: Gadyatskaya, Olga, Hansen, René Rydhof, Larsen, Kim Guldstrand, Legay, Axel, Olesen, Mads Chr., Poulsen, Danny Bøgsted, Fränzle, Martin, Markey, Nicolas

Publikováno v: FORMATS 2016-14th International Conference on Formal Modelling and Analysis of Timed Systems
FORMATS 2016-14th International Conference on Formal Modelling and Analysis of Timed Systems, Aug 2016, Quebec City, Canada. pp.35-50, ⟨10.1007/978-3-319-44878-7_3⟩
Gadyatskaya, O, Hansen, R R, Larsen, K G, Legay, A, Olesen, M C & Poulsen, D B 2016, Modelling Attack-defense Trees Using Timed Automata . in Formal Modeling and Analysis of Timed Systems . Springer, Lecture Notes in Computer Science, vol. 9884, pp. 35-50, 14th International Conference on Formal Modelling and Analysis of Timed Systems, Quebec City, Canada, 24/08/2016 . https://doi.org/10.1007/978-3-319-44878-7_3
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science ISBN: 9783319448770
FORMATS
Formal Modeling and Analysis of Timed Systems: 14th International Conference, FORMATS 2016, Quebec, QC, Canada, August 24-26, 2016, Proceedings, 35-50
STARTPAGE=35;ENDPAGE=50;TITLE=Formal Modeling and Analysis of Timed Systems

International audience; Performing a thorough security risk assessment of an organisation has always been challenging, but with the increased reliance on outsourced and off-site third-party services, i.e., " cloud services " , combined with internal

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03ae4120f57464c1090c1996a17d66b7
https://doi.org/10.1007/978-3-319-44878-7_3

Zobrazit plný text záznamu

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs

Autor: Dalsgaard, Andreas Engelbredt, Enevoldsen, Søren, Fogh, Peter, Jensen, Lasse Storgaard, Jensen, Peter Gjøl, Jepsen, Tobias S., Kaufmann, Isabella, Larsen, Kim Guldstrand, Nielsen, Søren Moss, Olesen, Mads Chr., Pastva, Samuel, Srba, Jiri

Publikováno v: Dalsgaard, A E, Enevoldsen, S, Fogh, P, Jensen, L S, Jensen, P G, Jepsen, T S, Kaufmann, I, Larsen, K G, Nielsen, S M, Olesen, M C, Pastva, S & Srba, J 2018, ' A Distributed Fixed-Point Algorithm for Extended Dependency Graphs ', Fundamenta Informaticae, vol. 161, no. 4, pp. 351-381 . https://doi.org/10.3233/FI-2016-0000

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::012c0d6b238c699f2bcafdc528575d95
https://vbn.aau.dk/da/publications/8e68d5ba-2b7a-4d7e-86a2-cae272df4147

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Formal modelling and analysis of Bitflips in ARM assembly code

Autor: Hansen, Rene Rydhof, Larsen, Kim Guldstrand, Olesen, Mads Chr., Wognsen, Erik Ramsgaard

Publikováno v: Hansen, R R, Larsen, K G, Olesen, M C & Wognsen, E R 2016, ' Formal modelling and analysis of Bitflips in ARM assembly code ', Information Systems Frontiers, vol. 18, no. 5, pp. 909–925 . https://doi.org/10.1007/s10796-016-9665-7

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::fd3b402366566f5432c7356cfbbaf754
https://vbn.aau.dk/da/publications/1a140871-d775-4663-ac48-ccb42496ceb6

Zobrazit plný text záznamu

Multi-Core Reachability for Timed Automata

Autor: Dalsgaard, Andreas, Laarman, Alfons, Larsen, Kim G., Olesen, Mads Chr., van de Pol, Jaco, Jurdziński, Marcin, Ničković, Dejan

Publikováno v: Formal Modeling and Analysis of Timed Systems: 10th International Conference, FORMATS 2012, London, UK, September 18-20, 2012, Proceedings, 91-106
STARTPAGE=91;ENDPAGE=106;TITLE=Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science ISBN: 9783642333644
FORMATS

Model checking of timed automata is a widely used technique. But in order to take advantage of modern hardware, the algorithms need to be parallelized. We present a multi-core reachability algorithm for the more general class of well-structured trans

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18844fe1ea565170097183acd4a7bf7f
https://doi.org/10.1007/978-3-642-33365-1_8

Zobrazit plný text záznamu

Coccinelle:Tool support for automated CERT C Secure Coding Standard certification

Autor: Olesen, Mads Chr., Hansen, Rene Rydhof, Lawall, Julia L., Palix, Nicolas Jean-Michel

Publikováno v: Olesen, M C, Hansen, R R, Lawall, J L & Palix, N J-M 2014, ' Coccinelle : Tool support for automated CERT C Secure Coding Standard certification ', Science of Computer Programming, vol. 91, no. Part B, pp. 141-160 . https://doi.org/10.1016/j.scico.2012.10.011

Writing correct C programs is well-known to be hard, not least due to the many low-level language features intrinsic to C. Writing secure C programs is even harder and, at times, seemingly impossible. To improve this situation the US CERT has develop

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::406140b5fcd335e2424351ee639ac443
https://vbn.aau.dk/da/publications/94166dee-a3ad-4c39-93e1-3dbcaf6532b7

Zobrazit plný text záznamu

Program Analysis as Model Checking

Autor: Olesen, Mads Chr.

Publikováno v: Olesen, M C 2014, Program Analysis as Model Checking . Publication : Department of Computer Science, The Faculty of Engineering and Science, Aalborg University, no. 85, Institut for Datalogi, Aalborg Universitet .

Software programs are proliferating throughout modern life, to a point where even the simplest appliances such as lightbulbs contain software, in addition to the software embedded in cars and airplanes. The correct functioning of these programs is th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e4c4e908feb7e485f491229c30a3843e
https://vbn.aau.dk/ws/files/316412785/thesis_sent_to_print.pdf

Zobrazit plný text záznamu

Multi-Core Emptiness Checking of Timed Büchi Automata using Inclusion Abstraction

Autor: Laarman, Alfons, Olesen, Mads Chr., Dalsgaard, Andreas, Larsen, Kim G., Pol, Jaco van de

Publikováno v: Laarman, A, Olesen, M C, Dalsgaard, A, Larsen, K G & Pol, J V D 2013, Multi-Core Emptiness Checking of Timed Büchi Automata using Inclusion Abstraction . in Proceedings of the 25th International Conference on Computer Aided Verification (CAV) . vol. 8044, Springer Publishing Company, Lecture Notes in Computer Science, vol. 8044, pp. 968-983, 25th International Concerence on Computer Aided Verification, Saint Petersburg, Russian Federation, 13/07/2013 . https://doi.org/10.1007/978-3-642-39799-8_69

This paper contributes to the multi-core model checking of timed automata (TA) with respect to liveness properties, by investigating checking of TA Büchi emptiness under the very coarse inclusion abstraction or zone subsumption, an open problem in t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d12f5c1745a518cb1cd3ee3eef0b0ebf
https://vbn.aau.dk/da/publications/63e14668-e22d-49be-83e2-39a41252e8b2

Zobrazit plný text záznamu

Adaptable Value-Set Analysis for Low-Level Code

Autor: Brauer, Jörg, Hansen, René Rydhof, Kowalewski, Stefan, Larsen, Kim G., Olesen, Mads Chr.

Publikováno v: Brauer, J, Hansen, R R, Kowalewski, S, Larsen, K G & Olesen, M C 2012, Adaptable Value-Set Analysis for Low-Level Code . in 6th International Workshop on Systems Software Verification (SSV 2011) . vol. 24, Schloss Dagstuhl. Leibniz-Zentrum für Informatik, 6th International Workshop on Systems Software Verification (SSV 2011), Nijmegen, Netherlands, 26/08/2011 . https://doi.org/10.4230/OASIcs.SSV.2011.i

This paper presents a framework for binary code analysis that uses only SAT-based algorithms. Within the framework, incremental SAT solving is used to perform a form of weakly relational value-set analysis in a novel way, connecting the expressivenes

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e214b824d7d712c7f0331d33a7db2823
https://vbn.aau.dk/da/publications/110c7a6e-43e9-4303-8fe3-d8dbc7ef4092

Zobrazit plný text záznamu

What is a Timing Anomaly?

Autor: Cassez, Franck, Hansen, Rene Rydhof, Olesen, Mads Chr.

Publikováno v: Cassez, F, Hansen, R R & Olesen, M C 2012, What is a Timing Anomaly? i T Vardanega (red.), Proceedings of the 12th International Workshop on Worst-Case Execution-Time Analysis . bind 23, Schloss Dagstuhl. Leibniz-Zentrum für Informatik, Dagstuhl, Germany, OpenAccess Series in Informatics, s. 1-12, International Workshop on Worst-Case Execution Time Analysis, Pisa, Italien, 10/07/2012 . https://doi.org/10.4230/OASIcs.WCET.2012.1

Timing anomalies make worst-case execution time analysis much harder, because the analysis will have to consider all local choices. It has been widely recognised that certain hardware features are timing anomalous, while others are not. However, defi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b98e0a031f79d7057e78cfa23aef7dda
https://vbn.aau.dk/ws/files/72450128/p001_cassez.pdf

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání