Formal software verification techniques are widely used to specify and prove the functional correctness of programs. However, nonfunctional properties such as time complexity usually carried out with pen paper. Inefficient code in terms may cause massive performance problems large-scale complex systems. We present a proof concept for using Dafny tool verify worst-case binary search. This approa...

We study the constraint satisfaction problem (CSP) parameterized by a language Γ (CSPΓ) and how choice of affects its worst-case time complexity. Under exponential-time hypothesis (ETH), we rule out existence subexponential algorithms for finite-domain NP-complete CSPΓ problems. This extends to certain infinite-domain CSPs structurally restricted For with finite domain D where all unary relatio...