26,098 papers · page 260 of 1,305
Wenhao Wu, Jan Hückelheim, Paul D. Hovland, Stephen F. Siegel
Abstract Fortran is widely used in computational science, engineering, and high performance computing. This paper presents an extension to the CIVL verification framework to check correctness properties of Fortran programs. Unlike previous work that translates Fortran to C, LLVM …
Tong Wu, Peter Schrammel, Lucas C. Cordeiro
Abstract We describe and evaluate a violation-witness validator for Java verifiers called Wit4Java. It takes a Java program with a safety property and the respective violation-witness output by a Java verifier to generate a new Java program whose execution deterministically viola…
Haoze Wu, Aleksandar Zeljic, Guy Katz, Clark W. Barrett
Abstract Inspired by sum-of-infeasibilities methods in convex optimization, we propose a novel procedure for analyzing verification queries on neural networks with piecewise-linear activation functions. Given a convex relaxation which over-approximates the non-convex activation f…
Pu Yi, Hao Wang, Tao Xie, Darko Marinov, Wing Lam
Abstract Regression testing is an important activity to check software changes by running the tests in a test suite to inform the developers whether the changes lead to test failures. Regression test prioritization (RTP) aims to inform the developers faster by ordering the test s…
Sheila Zingg, Srdan Krstic, Martin Raszyk, Joshua Schneider, Dmitriy Traytel
Abstract First-order temporal logics and rule-based formalisms are two popular families of specification languages for monitoring. Each family has its advantages and only few monitoring tools support their combination. We extend metric first-order temporal logic (MFOTL) with a re…
Ilia Zlatkin, Grigory Fedyukovich
Abstract State-of-the-art solvers for constrained Horn clauses (CHC) are successfully used to generate reachability facts from symbolic encodings of programs. In this paper, we present a new application to test-case generation: if a block of code is provably unreachable, no test …
Vincenzo Arceri, Martina Olliaro, Agostino Cortesi, Pietro Ferrara
Abstract elided by the publisher.
Ezio Bartocci, Thomas Ferrère, Thomas A. Henzinger, Dejan Nickovic, Ana Oliveira da Costa
Abstract elided by the publisher.
David Bayani, Stefan Mitsch
Machine learning becomes increasingly important to tune or even synthesize the behavior of safety-critical components in highly non-trivial environments, where the inability to understand learned components in general, and neural nets in particular, poses serious obstacles to the…
Gidon Ernst
Abstract elided by the publisher.
Chen Fu, Ernst Moritz Hahn, Yong Li, Sven Schewe, Meng Sun, Andrea Turrini, Lijun Zhang
Abstract elided by the publisher.
Stephen Goldbaum, Attila Mihály, Tosha Ellison, Earl T. Barr, Mark Marron
Abstract elided by the publisher.
Linus Heck, Jip Spel, Sebastian Junges, Joshua Moerman, Joost-Pieter Katoen
Randomization is a powerful technique to create robust controllers, in particular in partially observable settings. The degrees of randomization have a significant impact on the system performance, yet they are intricate to get right. The use of synthesis algorithms for parametri…
Peter Gjøl Jensen, Jirí Srba, Nikolaj Jensen Ulrik, Simon Mejlby Virenfeldt
Abstract elided by the publisher.
Depeng Liu, Bow-Yaw Wang, Lijun Zhang
Pufferfish is a Bayesian privacy framework for designing and analyzing privacy mechanisms. It refines differential privacy, the current gold standard in data privacy, by allowing explicit prior knowledge in privacy analysis. Through these privacy frameworks, a number of privacy m…
Solène Mirliaz, David Pichardie
International audience
Olivier Nicole, Matthieu Lemerre, Xavier Rival
Abstract elided by the publisher.
Jan Onderka, Stefan Ratschan
Abstract elided by the publisher.
Elizabeth Polgreen, Andrew Reynolds, Sanjit A. Seshia
In classic program synthesis algorithms, such as counterexample-guided inductive synthesis (CEGIS), the algorithms alternate between a synthesis phase and an oracle (verification) phase. Many synthesis algorithms use a white-box oracle based on satisfiability modulo theory (SMT) …
Pavithra Prabhakar
We present a notion of bisimulation that induces a reduced network which is semantically equivalent to the given neural network. We provide a minimization algorithm to construct the smallest bisimulation equivalent network. Reductions that construct bisimulation equivalent neural…