Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis

, and the original symbols are recovered from the collected ones with O(k log(1/ε)) operations. We will also introduce novel techniques for the analysis of the error probability of the decoder for finite length Raptor codes. Moreover, we will introduce and analyze systematic versions of Raptor codes, i.e., versions

ABSTRACT The knowledge of the in-situ stress field in rock masses is in general of crucial importance in various areas of geo-engineering, such as mining or civil underground excavations, hydrocarbon extraction, CO2 storage, hydraulic fracture operations, etc. In the context of the Finite Element

Data warehousing and on-line analytical processing (OLAP) are essential elements of decision support, which has increasingly become a focus of the database industry. Many commercial products and services are now available, and all of the principal database management system vendors now have

Many large scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. Here we will address

This paper concerns the static analysis of programs that perform destructive updating on heap-allocated storage. We give an algorithm that conservatively solves this problem by using a finite shape-graph to approximate the possible “shapes” that heap-allocated structures in a program can take on

The paper presents the basic ideas and the mathematical foundation of the partition of unity nite element method (PUFEM). We will show howthe PUFEM can be used to employ the structure of the differential equation under consideration to construct effective and robust methods. Although the method

A permutation group G (acting on a set Ω, usually infinite) is said to be oligomorphic if G has only finitely many orbits on Ω n (the set of n-tuples of elements of Ω). Such groups have traditionally been linked with model theory and combinatorial enumeration; more recently their group

to work extremely well. In this paper, we show that spectral partitioning methods work well on bounded-degree planar graphs and finite element meshes-the classes of graphs to which they are usually applied. While naive spectral bisection does not necessarily work, we prove that spectral partitioning

Traditional finite element analysis (FEA) programs are typically built as standalone desktop software. This paper describes an Internet-enabled framework that facilitates building a FEA program as distributed web services. The framework allows users easy access to the FEA core service