Results 241 to 250 of about 109,368 (283)
Thermal-stable rotor with enhanced cooling design for efficient electric motor applications. [PDF]
Wijittemee W +4 more
europepmc +1 more source
Visual Recommendations and Label Layout for Stacked Graphs
openaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SaVioR: Thwarting Stack-Based Memory Safety Violations by Randomizing Stack Layout
IEEE Transactions on Dependable and Secure Computing, 2022Stack-based memory corruption vulnerabilities have been exploited, allowing attackers to execute arbitrary code and read/write arbitrary memory. Although several solutions have been proposed to prevent memory errors on the stack, they are either limited to a specific type of attack (either spatial or temporal attacks) or cause significant performance ...
Seongman Lee, Hyeonwoo Kang, Jinsoo Jang
exaly +2 more sources
Detecting Stack Layout Corruptions with Robust Stack Unwinding
Lecture Notes in Computer Science, 2016The stack is a critical memory structure to ensure the correct execution of programs because control flow changes through the data stored in it, such as return addresses and function pointers. Thus the stack has been a popular target by many attacks and exploits like stack smashing attacks and return-oriented programming (ROP).
Yangchun Fu +5 more
exaly +2 more sources
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
SIAM Journal on Computing, 1999Summary: Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags).
Lenwood S Heath
exaly +3 more sources
Defense against Stack-Based Attacks Using Speculative Stack Layout Transformation
Lecture Notes in Computer Science, 2013This paper describes a novel technique to defend binaries against intra-frame stack-based attacks, including overflows into local variables, when source code is unavailable. The technique infers a specification of a function’s stack layout, i.e., variable locations and boundaries, and then seeks to apply a combination of transformations, including ...
Benjamin D. Rodes +5 more
exaly +2 more sources
Topological Stack-Queue Mixed Layouts of Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2020exaly +2 more sources

