Eliminating Redundant Bounds Checks in Dynamic Buffer Overflow Detection Using Weakest Preconditions

2016 ◽  
Vol 65 (4) ◽  
pp. 1682-1699 ◽  
Author(s):  
Yulei Sui ◽  
Ding Ye ◽  
Yu Su ◽  
Jingling Xue
Keyword(s):  
Buffer Overflow ◽  
Weakest Preconditions

Automated exploit generation for stack buffer overflow vulnerabilities

2015 ◽  
Vol 41 (6) ◽  
pp. 373-380 ◽  
Author(s):  
V. A. Padaryan ◽  
V. V. Kaushan ◽  
A. N. Fedotov
Keyword(s):  
Buffer Overflow

Modeling Analysis and Experiment Research on Rotary Motor Buffer Overflow Valve

2014 ◽  
Vol 709 ◽  
pp. 68-73
Author(s):  
Yuan Shen Zhang ◽  
Xue Ping Xian ◽  
Jie Yin
Keyword(s):  
Service Life ◽  
Operating Performance ◽  
Computer Software ◽  
Buffer Overflow ◽  
Experiment Research ◽  
Maximum Displacement ◽  
Hydraulic Impact ◽  
Modeling Analysis ◽  
Pressure Impact ◽  
Rotary Motor

This paper studies a buffer overflow valve that is attached to a hydraulic rotary motor which could reduce high hydraulic impact when the hydraulic rotary motor starts, brakes or suddenly reverses. A rotary motor buffer overflow valve was modeled and simulated using a computer software, AMESim, and the relation of the buffer overflow valve to the hydraulic impact experienced by the motor was analyzed. The cushioning property of the buffer overflow valve of a rotary motor is verified by using an excavator. It is concluded that having a reasonable design of the buffer overflow valve’s maximum displacement for the buffer set and diameter size for the buffer damping hole, it can reduce the pressure impact experienced by the hydraulic rotary motor and improve its operating performance, which also improves the service life of the system or its hydraulic components.

scholarly journals Quantum weakest preconditions

2006 ◽  
Vol 16 (3) ◽  
pp. 429-451 ◽  
Author(s):  
ELLIE D'HONDT ◽  
PRAKASH PANANGADEN
Keyword(s):  
Quantum Computation ◽  
Representation Theorem ◽  
Completely Positive Maps ◽  
Completely Positive ◽  
Weakest Precondition ◽  
Positive Maps ◽  
Weakest Preconditions ◽  
Predicate Transformer ◽  
Usual State ◽  
Stone Type

We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between the usual state-transformer semantics and the weakest precondition semantics. Rather than trying to reduce quantum computation to probabilistic programming, we develop a notion that is directly taken from concepts used in quantum computation. The proof that weakest preconditions exist for completely positive maps follows immediately from the Kraus representation theorem. As an example, we give the semantics of Selinger's language in terms of our weakest preconditions. We also cover some specific situations and exhibit an interesting link with stabilisers.

Sign in / Sign up

Export Citation Format

Share Document