default search action
Zain Alabedin Haj Hammadeh
Person information
- affiliation: Deutsches Zentrum für Luft- und Raumfahrt e.V. (DLR), Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Zain Alabedin Haj Hammadeh, Monowar Hasan, Mohammad Hamad:
Securing Real-Time Systems using Schedule Reconfiguration. ISORC 2024: 1-10 - 2023
- [c11]Hany Abdelmaksoud, Zain Alabedin Haj Hammadeh, Görschwin Fey, Daniel Lüdtke:
DEL: Dynamic Symbolic Execution-based Lifter for Enhanced Low-Level Intermediate Representation. DATE 2023: 1-2 - [c10]Hazem Abaza, Abhinaba Habishyashi, Debayan Roy, Andrea Bastoni, Zain Alabedin Haj Hammadeh, Shiqing Fan, Selma Saidi, Sergey Tverdyshev:
RDMA-Based Deterministic Communication Architecture for Autonomous Driving. RTCSA 2023: 137-146 - 2022
- [c9]Hazem Abaza, Zain Alabedin Haj Hammadeh, Daniel Lüdtke:
DELOOP: Automatic Flow Facts Computation Using Dynamic Symbolic Execution. WCET 2022: 3:1-3:12 - 2020
- [j2]Mohammad Hamad, Zain Alabedin Haj Hammadeh, Selma Saidi, Vassilis Prevelakis:
Temporal-based intrusion detection for IoV. it Inf. Technol. 62(5-6): 227-239 (2020) - [j1]Zain Alabedin Haj Hammadeh, Sophie Quinton, Rolf Ernst:
Weakly-hard Real-time Guarantees for Earliest Deadline First Scheduling of Independent Tasks. ACM Trans. Embed. Comput. Syst. 18(6): 121:1-121:25 (2020)
2010 – 2019
- 2019
- [b1]Zain Alabedin Haj Hammadeh:
Deadline Miss Models for Temporarily Overloaded Systems. Braunschweig University of Technology, Germany, 2019 - 2018
- [c8]Zain Alabedin Haj Hammadeh, Rolf Ernst:
Weakly-Hard Real-Time Guarantees for Weighted Round-Robin Scheduling of Real-Time Messages. ETFA 2018: 384-391 - [c7]Mohammad Hamad, Zain Alabedin Haj Hammadeh, Selma Saidi, Vassilis Prevelakis, Rolf Ernst:
Prediction of abnormal temporal behavior in real-time systems. SAC 2018: 359-367 - 2017
- [c6]Zain Alabedin Haj Hammadeh, Rolf Ernst, Sophie Quinton, Rafik Henia, Laurent Rioux:
Bounding deadline misses in weakly-hard real-time systems with task dependencies. DATE 2017: 584-589 - [c5]Zain Alabedin Haj Hammadeh, Sophie Quinton, Marco Panunzio, Rafik Henia, Laurent Rioux, Rolf Ernst:
Budgeting Under-Specified Tasks for Weakly-Hard Real-Time Systems. ECRTS 2017: 17:1-17:22 - [c4]Rafik Henia, Lisa Roux, Nicolas Sordon, Zain Alabedin Haj Hammadeh, Rolf Ernst, Sophie Quinton:
Demo Abstract: Bounding Deadline Misses for Weakly-Hard Real-Time Systems Designed in CAPELLA. RTAS 2017: 155-156 - 2016
- [c3]Leonie Ahrendts, Zain Alabedin Haj Hammadeh, Rolf Ernst:
Guarantees for runnable entities with heterogeneous real-time requirements. DATE 2016: 1646-1651 - 2015
- [c2]Wenbo Xu, Zain Alabedin Haj Hammadeh, Alexander Kröller, Rolf Ernst, Sophie Quinton:
Improved Deadline Miss Models for Real-Time Systems Using Typical Worst-Case Analysis. ECRTS 2015: 247-256 - 2014
- [c1]Zain Alabedin Haj Hammadeh, Sophie Quinton, Rolf Ernst:
Extending typical worst-case analysis using response-time dependencies to bound deadline misses. EMSOFT 2014: 10:1-10:10
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint