Being able to detect program runtime complexity is useful in many tasks (eg, checking
expected performance and identifying potential security vulnerabilities). In this work, we …

Automatically inferring invariant specifications has proven valuable in enabling a wide range
of software verification and validation approaches over the past two decades. Recent …

The algorithmic complexity vulnerability (ACV) that may lead to denial of service attacks
greatly disrupts the security and availability of applications, and due to the widespread use …

Determining program complexity bounds is a fundamental problem with a variety of
applications in software development. In this paper we present a novel approach for …

Program verification, in general, is undecidable. In the recent years, SMT/SAT solver based
proof assistants and theorem provers have been deployed to prove desirable (eg, necessary …