15882359
Deciding Equality Formulas by Small Domains Instantiations
We introduce an efficient decision procedure for the theory of equality based on finite instantiations. When using the finite instantiations method, it is a common practice to take a range of [1..n] (where n is the number of input non-Boolean variables) as the range for all non-Boolean variables, resulting in a state-space of nn. Although various attempts to minimize this range were made, typically they either required various restrictions on the investigated formulas or were not very effective. In many cases, the nn state-space cannot be handled by BDD-based tools within a reasonable amount of time. In this paper we show that significantly smaller domains can be algorithmically found, by analyzing the structure of the formula. We also show an upper bound for the state-space based on this analysis. This method enabled us to verify formulas containing hundreds of integer and floating point variables.
9192328
Translation Validation for Synchronous Languages
Translation validations an alternative to the verification of translators (compilers, code generators). Rather than proving in advance that, the compiler always produces a target code which correctly implements the source code (compiler verification), each individual translation (i.e. a run of the compiler) is followed by a validation phase which verifies that the target code producted on this run correctly implements the submitted source program. In order to be a practical alternative to compiler verification, a key feature of this validation is its full automation.
14822655
Translation Validation
17058444
The Context Interchange Network Prototype
In this paper we describe a prototype implementation of the Context Interchange Network (CIN). The prototype is described in terms of a financial application. The CIN is designed to provide for the intelligent integration of contextually (i.e., semantically) heterogeneous data. The system uses explicit context knowledge representation and a context mediator to automatically detect conflicts and resolve them through context conversion. The network also allows for context explication; making it possible for a receiver of data to understand meaning of the information represented by the source data.
8004380
A Well-Posed Numerical Method to Track Isolated Conformal Map Singularities in Hele-Shaw Flow
We present a new numerical method for calculating an evolving 2D Hele-Shaw interface when surface tension effects are neglected. In the case where the flow is directed from the less viscous fluid into the more viscous fluid, the motion of the interface is ill-posed; small deviations in the initial condition will produce significant changes in the ensuing motion. This situation is disastrous for numerical computation, as small roundoff errors can quickly lead to large inaccuracies in the computed solution. Our method of computation is most easily formulated using a conformal map from the fluid domain into a unit disk. The method relies on analytically continuing the initial data and equations of motion into the region exterior to the disk, where the evolution problem becomes well-posed. The equations are then numerically solved in the extended domain. The presence of singularities in the conformal map outside of the disk introduces specific structures along the fluid interface. Our method can explicitly track the location of isolated pole and branch point singularities, allowing us to draw connections between the development of interfacial patterns and the motion of singularities as they approach the unit disk. In particular, we are able to relate physical features such as finger shape, side-branch formation, and competition between fingers to the nature and location of the singularities. The usefulness of this method in studying the formation of topological singularities (self intersections of the interface) is also pointed out.
37254437
Exact Solutions for the Evolution of a Bubble in Stokes Flow: A Cauchy Transform Approach
A Cauchy transform approach to the problem of determining the free surface evolution of a single bubble in Stokes flow is developed. A number of exact solutions to a class of problems have been derived in the literature using conformal mapping theory, and these solutions are retrieved and further generalized using the new formulation. Certain quantities which are conserved by the dynamics are also identified, the existence of which had not previously been pointed out. A principal purpose of this paper is to use the new formulation to understand when it is possible to externally specify the evolution of the bubble area in such classes of exact solution. It is found to be possible only for certain types of far-field boundary conditions.
34941766
Context interchange: sharing the meaning of data
Previously, users and application developers, through manuals and experience, understood the context of the few systems that served their portion of the enterprise. But the number, types, and increased scope of data and systems that are now being integrated make it impossible to expect users to understand and remain current on the context or meaning of all information. Our research has the goal of representing, moving, and processing the context along with the information it describes. This requires both representations, models, manipulation languages and reconciliation algorithms for context knowledge. In this position paper we present a number of significant research areas which we believe must be resolved so that context knowledge can be used to simplify the integration of multiple disparate database systems. As shown in Figure 1, the export context defines the meaning of the data provided by a data source while the import context defines the context requirements for the data receiver. Providing this context knowledge requires an understanding of issues in context representation, context models, common metadata vocabularies, comparisons of contexts including transformations, and system's architectures and operations.
33236770
Formal Verification of Stabilizing Systems
This paper links too formerly rather disjoint areas: formal verification and stabilization. Stabilization is a vitally emerging paradigm in fault tolerant distributed computing; formal verification investigates mathematically rigorous techniques to reason about systems.