A unified framework for describing the azimuthal dependence of two-particle correlations in heavy-ion collisions is introduced, together with the methods for measuring the corresponding observables. The generalization to azimuthal correlations between more than two particles is presented. The high amount of data that modern nucleus-nucleus experiments can accumulate allow novel types of measure...

The theoretical background of practical structural reliability methods encompassing numerical integration, approximate methods and simulation techniques is reviewed in the context of windexcited structures. Their relative merits, shortcomings and limitations are addressed from the standpoint of their accuracy and computational efficiency. Quantitative reliability estimates of a concrete chimney...

In this paper, we present a new method for supporting abstraction refinement in path-sensitive dataflow analysis. We show how an adjustable merge criterion can be used as an interface to control the degree of abstraction. In particular, we partition the merge criterion with two sets of predicates — one related to the dataflow facts being propagated and the other related to path feasibility. The...

Recently considerable attention has been given to the study of risk-sensitive stochasic control problems 1]-13]. Risk-sensitive control is a generalization of the risk-neutral approach, in which we seek to minimize an exponential of the sum of costs. In particular, there has been work on risk-sensitive Markov Decision Processes (MDPs) { i.e., discrete-time problems with a nite or countable stat...

A number of program-analysis problems can be tackled by transforming them into certain kinds of graph-reachability problems in labeled directed graphs. The edge labels can be used to filter out paths that are not of interest: A path P from vertex s to vertex t only counts as a “valid connection” between s and t if the word spelled out by P is in a certain language. Often the languages used for ...

We present a framework that produces path-sensitive analyses with different tradeoffs of accuracy and efficiency. The first component is a program transformation that restructures a CFG in order to encode path-sensitivity into it. The method consists of deleting infeasible paths from the CFG while performing selective node splitting based on information captured from infeasible paths. This tran...

The subject of this paper is flowand context-insensitive pointer analysis. We present, for the first time, a fieldsensitive constraint-based analysis for C and evaluate its effects on time and precision. In addition, we study in detail four solving algorithms, including the Heintze-Tardieu solver, over 7 common C programs ranging in size from 5000 to 150,000 lines of code. Our results indicate ...