2018
DOI: 10.1109/access.2018.2852805
|View full text |Cite
|
Sign up to set email alerts
|

WCET-Aware Control Flow Checking With Super-Nodes for Resource-Constrained Embedded Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 15 publications
0
6
0
Order By: Relevance
“…While CFI techniques are built considering an adversarial perspective, there exists a line of research that applies similar methodologies to detect erroneous control-flow redirection due to non-malicious soft-errors [41,68,74,87]. These works utilize very similar techniques, such as by creating signatures for each basic block (code blocks that are delineated by control-flow transfers but do not contain any transfers themselves) and comparing currently executing basic block against a pre-determined graph of valid signature chains [63].…”
Section: A Note On Control-flow Checking For Soft Errorsmentioning
confidence: 99%
“…While CFI techniques are built considering an adversarial perspective, there exists a line of research that applies similar methodologies to detect erroneous control-flow redirection due to non-malicious soft-errors [41,68,74,87]. These works utilize very similar techniques, such as by creating signatures for each basic block (code blocks that are delineated by control-flow transfers but do not contain any transfers themselves) and comparing currently executing basic block against a pre-determined graph of valid signature chains [63].…”
Section: A Note On Control-flow Checking For Soft Errorsmentioning
confidence: 99%
“…For choosing the slice set in our scheme, two elements are critical: the size of the slice, and the number of slices. Since small slices result in more efficient verification, we propose to use a selection method based on the super-node [10] algorithm to reduce the verification effort. However, certain types of program control flow graphs may not be amenable to small slices, and in such a case, Fig.…”
Section: Verifiable Computation Schemementioning
confidence: 99%
“…In recent works, course-grained CFE schemes using dominator [22] or super nodes [23] have been proposed to reduce execution time overhead by detecting only CFEs between dominator or super node. After considering the connectivity of the basic blocks, the dominator is selected among the basic blocks and the super node is created by combining the basic blocks.…”
Section: Granularity Of Cfe Detectionmentioning
confidence: 99%