PredatorHP Attacks Interval-Sized Regions

09/16/2019
by   Michal Kotoun, et al.
0

This paper describes shortly the basic principles of the PredatorHP (Predator Hunting Party) shape analyzer and presents its recent improvements. One of the most visible changes is the way PredatorHP handles interval-sized memory regions, which is particularly useful for dealing with arrays whose size is not fixed in advance. Further, the paper characterizes PredatorHP's participation in SV-COMP 2019, pointing out its strengths and weakness and the way they were influenced by the latest changes in the tool.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2018

Moore: Interval Arithmetic in C++20

This article presents the Moore library for interval arithmetic in C++20...
research
03/27/2019

The shortest confidence interval for the weighted sum of two Binomial proportions

Interval estimation of the probability of success in a Binomial model is...
research
02/25/2018

SgxPectre Attacks: Leaking Enclave Secrets via Speculative Execution

This paper presents SgxPectre Attacks that exploit the recently disclose...
research
11/08/2022

Finding twin smooth integers by solving Pell equations

Any pair of consecutive B-smooth integers for a given smoothness bound B...
research
08/21/2020

A Tipping Point for the Planarity of Small and Medium Sized Graphs

This paper presents an empirical study of the relationship between the d...
research
11/10/2021

Searching in the Forest for Local Bayesian Optimization

Because of its sample efficiency, Bayesian optimization (BO) has become ...
research
02/23/2018

On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games

We introduce a simplified model for platform game levels with falling pl...

Please sign up or login with your details

Forgot password? Click here to reset