Static alias analysis of different type of programming languages has been drawing researcher attention. However most of the results of existing techniques for alias analysis are not precise enough compared to needs of modern compilers. Probabilistic versions of these results, in which result elements are associated with occurrence probabilities, are required in optimizations techniques of

Feasibility tests determine whether it is possible for a given real-time system to always meet all of its timing constraints on a specified processing platform. Current feasibility tests for the uniprocessor static-priority scheduling of sporadic task systems run in pseudo-polynomial time. We present a fully polynomial-time approximation scheme (FPTAS) for feasibility analysis in static-priorit...

This paper introduces probabilistic analysis for fixed priority preemptive scheduling of mixed criticality systems on a uniprocessor using the Adaptive Mixed Criticality (AMC) and Static Mixed Criticality (SMC) schemes. We compare this analysis to the equivalent deterministic methods, highlighting the performance gains that can be obtained by utilising more detailed information about worst-case...

In this paper, we discuss our probabilistic ontological solution for analysis of Web profiles. The analysis of Web profiles is a very demanding and multi-layered task; especially probabilistic information in terms of probability distributions and weights is often the key to an expressive analysis. In our research we designed the Probabilistic Profile Analysis Ontology (PPAO) using Markov Logic ...

In this paper, we develop an interactive analysis and visualization tool for probabilistic segmentation results in medical imaging. We provide a systematic approach to analyze, interact and highlight regions of segmentation uncertainty. We introduce a set of visual analysis widgets integrating different approaches to analyze multivariate probabilistic field data with direct volume rendering. We...