Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Trtík, Marek"'
We present a novel gray-box fuzzing algorithm monitoring executions of instructions converting numerical values to Boolean ones. An important class of such instructions evaluate predicates, e.g., *cmp in LLVM. That alone allows us to infer the input
Externí odkaz:
http://arxiv.org/abs/2401.12643
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We present a new algorithm for computing upper bounds on the number of executions of each program instruction during any single program run. The upper bounds are expressed as functions of program input values. The algorithm is primarily designed to p
Externí odkaz:
http://arxiv.org/abs/1605.03636
Autor:
Trtik, Marek
We propose a light-weight client-server model of communication between program analyses. Clients are individual analyses and the server mediates their communication. A client cannot see properties of any other and the communication is anonymous. Ther
Externí odkaz:
http://arxiv.org/abs/1511.02415
We propose a method that transforms a C program manipulating containers using low-level pointer statements into an equivalent program where the containers are manipulated via calls of standard high-level container operations like push_back or pop_fro
Externí odkaz:
http://arxiv.org/abs/1510.07995
STANSE is a free (available under the GPLv2 license) modular framework for finding bugs in C programs using static analysis. Its two main design goals are 1) ability to process large software projects like the Linux kernel and 2) extensibility with n
Externí odkaz:
http://arxiv.org/abs/1202.0788
Autor:
Trtík, Marek
We present a generalisation of King's symbolic execution technique called compact symbolic execution. It is based on a concept of templates: a template is a declarative parametric description of such a program part, generating paths in symbolic execu
Externí odkaz:
http://arxiv.org/abs/1201.6033
We introduce a novel technique for finding real errors in programs. The technique is based on a synergy of three well-known methods: metacompilation, slicing, and symbolic execution. More precisely, we instrument a given program with a code that trac
Externí odkaz:
http://arxiv.org/abs/1201.4719
We present a generalisation of King's symbolic execution technique called compact symbolic execution. It proceeds in two steps. First, we analyse cyclic paths in the control flow graph of a given program, independently from the rest of the program. O
Externí odkaz:
http://arxiv.org/abs/1201.4715
Autor:
Strejček, Jan, Trtík, Marek
We present a symbolic-execution-based algorithm that for a given program and a given program location produces a nontrivial necessary condition on input values to drive the program execution to the given location. We also propose an application of ne
Externí odkaz:
http://arxiv.org/abs/1112.5671