Two classical sources of imprecision in static analysis by abstract interpretation are widening and merge operations. Merge operations can be done away by distinguishing paths, as in trace partitioning, at the expense of enumerating an exponential number of paths. In this article, we describe how to avoid such systematic exploration by focusing on a single path at a time, designated by SMT-solv...

We consider unordered XML, where the relative order among siblings is ignored, and propose two simple yet practical schema formalisms: disjunctive multiplicity schemas (DMS), and its restriction, disjunction-free multiplicity schemas (MS). We investigate their computational properties and characterize the complexity of the following static analysis problems: schema satisfiability, membership of...

Static analysis is a core task in query optimization and knowledge base verification. We study static analysis techniques for SPARQL, the standard language for querying Semantic Web data. Specifically, we investigate the query containment problem and query-update independence analysis. We are interested in developing techniques through reductions to the validity problem in logic.

Enterprise architecture management is based on a holistic view on the enterprise addressing business and IT aspects in an integrated manner. EA management is a process to manage the complexity of the overall architecture and to improve the alignment of business and IT. In order to achieve these goals, it is necessary but not sufficient to manage the static complexity that arises from dependenci...

In contrast to the classical cache analysis of Ferdinand, the relational cache analysis does not rely on precise address information. Instead, it uses same block relations between memory accesses to predict cache hits. The relational data cache analysis can thus also predict cache hits if fully unrolling a loop is not feasible during analysis, for example due to high memory consumption or long ...

This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that incorporate explicit timing information in the specification which is used throughout the synthesis procedure to optimize the design. Much of the computational complexity in the synthesis of timed circuits currently is ...

Re-engineering from legacy executable (binary) les is greatly facilitated by identifying and naming statically linked library functions. This paper presents an e cient method for generating les of patterns; each pattern is a transformation of the rst several bytes of a library function's executable code. Given a suitable pattern le, a candidate function can be identi ed in linear time. One patt...

For fractal-like agglomerates with volume fractal dimensions Df ≤ 2 multiple scattering of incident light may be neglected to a good approximation. Therefore the Rayleigh-Debye-Gans (RDG) theory provides a reliable yet convenient route towards computing the differential and total scattering cross sections of fractal particles (Sorensen, 2001). So far, however, besides assuming spherical isotrop...

Static analysis which takes into account the values of data stored in the heapis considered complex and computationally intractable in practice. Thus, moststatic analyzers do not keep track of object fields nor of array contents, i.e.,they are heap-insensitive. In this article, we propose locality conditions forsoundly tracking heap-allocated data in Java (bytecode) programs, by...

We develop a formal perspective on how regular expression matching works in Java1, a popular representative of the category of regex-directed matching engines. In particular, we define an automata model which captures all the aspects needed to study such matching engines in a formal way. Based on this, we propose two types of static analysis, which take a regular expression and tell whether the...