Results 41 to 50 of about 45,458 (300)
Runtime Instrumentation for Precise Flow-Sensitive Type Analysis [PDF]
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the program execute and thereby read the important dynamic configuration data ...
Kneuss, Etienne +2 more
core +1 more source
Runtime Analysis for Permutation-based Evolutionary Algorithms
Algorithmica, 2023 Journal version of our paper at GECCO 2022, appeared in Algorithmica. 52 pages.
Benjamin Doerr +2 more
openaire +4 more sources
Runtime analysis of atomicity for multithreaded programs [PDF]
IEEE Transactions on Software Engineering, 2006 Atomicity is a correctness condition for concurrent systems. Informally, atomicity is the property that every concurrent execution of a set of transactions is equivalent to some serial execution of the same transactions. In multithreaded programs, executions of procedures (or methods) can be regarded as transactions.
Liqiang Wang, Scott D. Stoller
openaire +1 more source
A foundation for runtime monitoring [PDF]
, 2017 Runtime Verification is a lightweight technique that complements other verification methods in an effort to ensure software correctness. The technique poses novel questions to software engineers: it is not easy to identify which specifications are ...
Francalanza, Adrian +15 more
core +1 more source
An Automated Framework for Runtime Analysis of Malicious Executables on Linux
Telfor Journal, 2021 One way of testing a malware detection tool is to expose it to a large number of diverse malware samples and verify its detection accuracy. During these tests, the host system must not be harmed by malware and yet be able to analyze its harmful behavior.
I. Vurdelja +3 more
doaj +1 more source
Runtime analysis of probabilistic programs with unbounded recursion [PDF]
Journal of Computer and System Sciences, 2011 We study termination time and recurrence time in programs with unbounded recursion, which are either randomized or operate on some statistically quantified inputs. As the underlying formal model for such programs we use probabilistic pushdown automata (pPDA) which are equivalent to probabilistic recursive state machines.
Tomás Brázdil +3 more
openaire +2 more sources
07011 Executive Summary – Runtime Verification
, 2008 From January 2 to January 6, 2007, the Dagstuhl Seminar 07011 "Runtime Verification" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Sokolsky, Oleg +3 more
core +1 more source
Population Protocols: Beyond Runtime Analysis [PDF]
, 2021 I survey our recent work on the verification of population protocols and their state complexity.
openaire +2 more sources
Runtime Analysis for Self-adaptive Mutation Rates [PDF]
Algorithmica, 2018 We propose and analyze a self-adaptive version of the $(1,λ)$ evolutionary algorithm in which the current mutation rate is part of the individual and thus also subject to mutation. A rigorous runtime analysis on the OneMax benchmark function reveals that a simple local mutation scheme for the rate leads to an expected optimization time (number of ...
Doerr, Benjamin +2 more
openaire +5 more sources
First Steps Towards a Runtime Analysis of Neuroevolution
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023 We consider a simple setting in neuroevolution where an evolutionary algorithm optimizes the weights and activation functions of a simple artificial neural network. We then define simple example functions to be learned by the network and conduct rigorous runtime analyses for networks with a single neuron and for a more advanced structure with several ...
Paul Fischer +2 more
openaire +2 more sources