7,452 research outputs found
Probabilistic data flow analysis: a linear equational approach
Speculative optimisation relies on the estimation of the probabilities that
certain properties of the control flow are fulfilled. Concrete or estimated
branch probabilities can be used for searching and constructing advantageous
speculative and bookkeeping transformations.
We present a probabilistic extension of the classical equational approach to
data-flow analysis that can be used to this purpose. More precisely, we show
how the probabilistic information introduced in a control flow graph by branch
prediction can be used to extract a system of linear equations from a program
and present a method for calculating correct (numerical) solutions.Comment: In Proceedings GandALF 2013, arXiv:1307.416
Reachability in Biochemical Dynamical Systems by Quantitative Discrete Approximation (extended abstract)
In this paper, a novel computational technique for finite discrete
approximation of continuous dynamical systems suitable for a significant class
of biochemical dynamical systems is introduced. The method is parameterized in
order to affect the imposed level of approximation provided that with
increasing parameter value the approximation converges to the original
continuous system. By employing this approximation technique, we present
algorithms solving the reachability problem for biochemical dynamical systems.
The presented method and algorithms are evaluated on several exemplary
biological models and on a real case study.Comment: In Proceedings CompMod 2011, arXiv:1109.104
Inferring Termination Conditions for Logic Programs using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is
guaranteed to terminate. This generalises traditional termination analysis
where an analyser tries to verify termination for a specified mode. Our
contribution is a methodology in which components of traditional termination
analysis are combined with backwards analysis to obtain an analyser for
termination inference. We identify a condition on the components of the
analyser which guarantees that termination inference will infer all modes which
can be checked to terminate. The application of this methodology to enhance a
traditional termination analyser to perform also termination inference is
demonstrated
- …