Neuzz: Efficient fuzzing with neural program smoothing

D She, K Pei, D Epstein, J Yang… - 2019 IEEE Symposium …, 2019 - ieeexplore.ieee.org
Fuzzing has become the de facto standard technique for finding software vulnerabilities.
However, even state-of-the-art fuzzers are not very efficient at finding hard-to-trigger …

Stochastic optimization of floating-point programs with tunable precision

E Schkufza, R Sharma, A Aiken - ACM SIGPLAN Notices, 2014 - dl.acm.org
The aggressive optimization of floating-point computations is an important problem in high-
performance computing. Unfortunately, floating-point instruction sets have complicated …

Software Verification of Hyperproperties Beyond k-Safety

R Beutner, B Finkbeiner - International Conference on Computer Aided …, 2022 - Springer
Temporal hyperproperties are system properties that relate multiple execution traces. For
(finite-state) hardware, temporal hyperproperties are supported by model checking …

Fairify: Fairness verification of neural networks

S Biswas, H Rajan - 2023 IEEE/ACM 45th International …, 2023 - ieeexplore.ieee.org
Fairness of machine learning (ML) software has become a major concern in the recent past.
Although recent research on testing and improving fairness have demonstrated impact on …

Perfectly parallel fairness certification of neural networks

C Urban, M Christakis, V Wüstholz… - Proceedings of the ACM on …, 2020 - dl.acm.org
Recently, there is growing concern that machine-learned software, which currently assists or
even automates decision making, reproduces, and in the worst case reinforces, bias present …

Probabilistic relational verification for cryptographic implementations

G Barthe, C Fournet, B Grégoire, PY Strub… - ACM SIGPLAN …, 2014 - dl.acm.org
Relational program logics have been used for mechanizing formal proofs of various
cryptographic constructions. With an eye towards scaling these successes towards end-to …

Relational cost analysis

E Çiçek, G Barthe, M Gaboardi, D Garg… - ACM SIGPLAN …, 2017 - dl.acm.org
Establishing quantitative bounds on the execution cost of programs is essential in many
areas of computer science such as complexity analysis, compiler optimizations, security and …

Proactive control of approximate programs

X Sui, A Lenharth, DS Fussell, K Pingali - ACM SIGPLAN Notices, 2016 - dl.acm.org
Approximate computing trades off accuracy of results for resources such as energy or
computing time. There is a large and rapidly growing literature on approximate computing …

A semantic account of metric preservation

A Azevedo de Amorim, M Gaboardi, J Hsu… - ACM SIGPLAN …, 2017 - dl.acm.org
Program sensitivity measures how robust a program is to small changes in its input, and is a
fundamental notion in domains ranging from differential privacy to cyber-physical systems. A …

Synthesizing robust systems

R Bloem, K Chatterjee, K Greimel, TA Henzinger… - Acta Informatica, 2014 - Springer
Abstract Systems should not only be correct but also robust in the sense that they behave
reasonably in unexpected situations. This article addresses synthesis of robust reactive …