Zobrazeno 1 - 10
of 593
pro vyhledávání: '"Vojnar"'
Autor:
Vašíček, Ondřej, Arias, Joaquin, Fiedor, Jan, Gupta, Gopal, Hall, Brendan, Křena, Bohuslav, Larson, Brian, Varanasi, Sarat Chandra, Vojnar, Tomáš
This paper proposes a new methodology for early validation of high-level requirements on cyber-physical systems with the aim of improving their quality and, thus, lowering chances of specification errors propagating into later stages of development w
Externí odkaz:
http://arxiv.org/abs/2408.09909
We present a novel decision procedure for a fragment of separation logic (SL) with arbitrary nesting of separating conjunctions with boolean conjunctions, disjunctions, and guarded negations together with a support for the most common variants of lin
Externí odkaz:
http://arxiv.org/abs/2403.18999
This chapter, which is an extended and revised version of the conference paper 'Predator: Byte-Precise Verification of Low-Level List Manipulation', concentrates on a detailed description of the algorithms behind the Predator shape analyser based on
Externí odkaz:
http://arxiv.org/abs/2403.18491
Whole-program analysis is an essential technique that enables advanced compiler optimizations. An important example of such a method is points-to analysis used by ahead-of-time (AOT) compilers to discover program elements (classes, methods, fields) u
Externí odkaz:
http://arxiv.org/abs/2308.16566
Biabduction-based shape analysis is a compositional verification and analysis technique that can prove memory safety in the presence of complex, linked data structures. Despite its usefulness, several open problems persist for this kind of analysis;
Externí odkaz:
http://arxiv.org/abs/2307.06346
2LS ("tools") is a verification tool for C programs, built upon the CPROVER framework. It allows one to verify user-specified assertions, memory safety properties (e.g. buffer overflows), numerical overflows, division by zero, memory leaks, and termi
Externí odkaz:
http://arxiv.org/abs/2302.02380
Fast matching of regular expressions with bounded repetition, aka counting, such as (ab){50,100}, i.e., matching linear in the length of the text and independent of the repetition bounds, has been an open problem for at least two decades. We show tha
Externí odkaz:
http://arxiv.org/abs/2301.12851
In this paper, we present Perun: an open-source tool suite for profiling-based performance analysis. At its core, Perun maintains links between project versions and the corresponding stored performance profiles, which are then leveraged for automated
Externí odkaz:
http://arxiv.org/abs/2207.12900
We present a novel scalable deadlock analyser L2D2 capable of handling C code with low-level unstructured lock manipulation. L2D2 runs along the call tree of a program, starting from its leaves, and analyses each function just once, without any knowl
Externí odkaz:
http://arxiv.org/abs/2207.01948
Approximate circuits trading the power consumption for the quality of results play a key role in the development of energy-aware systems. Designing complex approximate circuits is, however, a very difficult and computationally demanding process. When
Externí odkaz:
http://arxiv.org/abs/2206.13077