Results 71 to 80 of about 5,396 (256)
LLVM-based Static Analysis Tool Using Type and Effect Systems
Моделирование и анализ информационных систем, 2011 The intention of this paper is to describe a static analysis tool under development. The principal idea behind the design of this tool is to use type and effect systems for static analysis of real programs. The tool uses LLVM bitcode files as input, thus
M. A. Belyaev, V. A. Tsesko
doaj
Implementing Obfuscating Transformations in the LLVM Compiler Infrastructure
Труды Института системного программирования РАН, 2018 The paper describes the methods for obfuscating C/C++ programs to prevent applying static analyzers to them. The methods are implemented within the well-known LLVM compiler infrastructure.
Victor Ivannikov +6 more
doaj +1 more source
Multithread Approximation: An OpenMP Constructor
Concurrency and Computation: Practice and Experience, Volume 38, Issue 4, February 2026.ABSTRACT This study introduces an OpenMP construct designed to simplify and unify the integration of approximate computing techniques into shared‐memory parallel programs. Approximate Computing leverages the inherent error tolerance of many applications to trade computational accuracy for gains in performance and energy efficiency.
João Briganti de Oliveira +2 more
wiley +1 more source
ThreadMonitor: Low‐Overhead Data Race Detection Using Intel Processor Trace
Concurrency and Computation: Practice and Experience, Volume 38, Issue 2, January 2026.ABSTRACT Data races are among the most difficult multithreading bugs to find, due to their non‐deterministic nature. This and the increasing popularity of multithreaded programming have led to the need for practical automated data race detection. In this context, dynamic data race detectors have received more attention, compared to static tools, owing ...
Farzam Dorostkar +3 more
wiley +1 more source
Complexity, Volume 2026, Issue 1, 2026.This work presents a comparison of different software and hardware implementations of a traffic simulator using a fluid‐based mesoscopic model. The model represents Vehicular Traffic Networks (VTNs) based on the flow resulting by the interconnection of dynamical agents associated to street segments and intersections.
Felipe Morales-Torres +7 more
wiley +1 more source
AutoWIG: automatic generation of python bindings for C++ libraries [PDF]
PeerJ Computer Science, 2018 Most of Python and R scientific packages incorporate compiled scientific libraries to speed up the code and reuse legacy libraries. While several semi-automatic solutions exist to wrap these compiled libraries, the process of wrapping a large library is ...
Pierre Fernique, Christophe Pradal
doaj +2 more sources
Ecology Letters, Volume 28, Issue 12, December 2025.We introduce the range‐resident logistic model, an extension of the spatial logistic model that incorporates empirically supported range‐resident movement, showing that neglecting range residency can lead to under‐ or overestimating population carrying capacity.
Rafael Menezes +4 more
wiley +1 more source
, 2014 The KernelGen project (http://kernelgen.org/) aims to develop Fortran and C compilersbased on the state-of-art open-source technologies for automatic GPU kernels generation from unmodified CPU source code, significantly improving the code porting ...
Микушин, Дмитрий Николаевич +1 more
core +1 more source
MLSA: a static bugs analysis tool based on LLVM IR [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2016 Program bugs may result in unexpected software error, crash or serious security attack. Static program analysis is one of the most common methods to find program bugs.
Hongliang Liang +3 more
doaj +1 more source
Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale
Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.ABSTRACT The Branch‐and‐Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem‐solving and decision‐making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions and abandoning a candidate as soon as it determines that it cannot lead to ...
Guillaume Helbecque +4 more
wiley +1 more source