Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Ernst, Gidon"'
We consider the problem of specifying and proving the security of non-trivial, concurrent programs that intentionally leak information. We present a method that decomposes the problem into (a) proving that the program only leaks information it has de
Externí odkaz:
http://arxiv.org/abs/2309.03442
We present a Hoare logic that extends program specifications with regular expressions that capture behaviors in terms of sequences of events that arise during the execution. The idea is similar to session types or process-like behavioral contracts, t
Externí odkaz:
http://arxiv.org/abs/2205.06584
The statefulness property of network protocol implementations poses a unique challenge for testing and verification techniques, including Fuzzing. Stateful fuzzers tackle this challenge by leveraging state models to partition the state space and assi
Externí odkaz:
http://arxiv.org/abs/2112.15498
Publikováno v:
EPTCS 338, 2021, pp. 89-96
We propose a conceptual integration of deductive program verification into existing user interfaces for software debugging. This integration is well-represented in the "Debug Adapter Protocol", a widely-used and generic technology to integrate debugg
Externí odkaz:
http://arxiv.org/abs/2108.02968
Memory-safety issues and information leakage are known to be depressingly common. We consider the compositional static detection of these kinds of vulnerabilities in first-order C-like programs. Indeed the latter are relational hyper-safety violation
Externí odkaz:
http://arxiv.org/abs/2107.05225
Autor:
Ernst, Gidon
Invariants are the predominant approach to verify the correctness of loops. As an alternative, loop contracts, which make explicit the premise and conclusion of the underlying induction proof, can sometimes capture correctness conditions more natural
Externí odkaz:
http://arxiv.org/abs/2010.05812
Autor:
Ernst, Gidon
Cuv\'ee is a program verification tool that reads SMT-LIB-like input files where terms may additionally contain weakest precondition operators over abstract programs. Cuv\'ee translates such inputs into first-order SMT-LIB by symbolically executing t
Externí odkaz:
http://arxiv.org/abs/2010.05023
Concolic execution and fuzzing are two complementary coverage-based testing techniques. How to achieve the best of both remains an open challenge. To address this research problem, we propose and evaluate Legion. Legion re-engineers the Monte Carlo t
Externí odkaz:
http://arxiv.org/abs/2002.06311
We present an algorithm that quickly finds falsifying inputs for hybrid systems, i.e., inputs that steer the system towards violation of a given temporal logic requirement. Our method is based on a probabilistically directed search of an increasingly
Externí odkaz:
http://arxiv.org/abs/1812.04159
Few real-world hybrid systems are amenable to formal verification, due to their complexity and black box components. Optimization-based falsification---a methodology of search-based testing that employs stochastic optimization---is attracting attenti
Externí odkaz:
http://arxiv.org/abs/1803.06276