1603358
A Procedure for Mediation of Queries to Sources in Disparate Contexts
This paper discusses the algorithm we are using for the mediation of queries to disparate information sources in a Context Interchange system, where information sources may have di erent interpretations arising from their respective context. Queries are assumed to be formulated without regard for semantic heterogeneity, and are rewritten to corresponding mediated queries by taking into account the semantics of data codi ed in axioms associated with sources and receivers (the corresponding context theories). Our approach draws upon recent advances in abductive logic programming and presents an integration of techniques for query rewriting and semantic query optimization. We also demonstrate how this can be e ciently implemented using the constraint logic programming system ECLiPSe.
3110757
Context Knowledge Representation and Reasoning in the Context Interchange System
The Context Interchange Project presents a unique approach to the problem of semantic conflict resolution among multiple heterogeneous data sources. The system presents a semantically meaningful view of the data to the receivers (e.g. user applications) for all the available data sources. The semantic conflicts are automatically detected and reconciled by a Context Mediator using the context knowledge associated with both the data sources and the data receivers. The results are collated and presented in the receiver context. The current implementation of the system provides access to flat files, classical relational databases, on-line databases, and web services. An example application, using actual financial information sources, is described along with a detailed description of the operation of the system for an example query.
5563723
Data Integration Using Web Services
In this paper we examine the opportunities for data integration in the context of the emerging Web Services systems development paradigm. The paper introduces the programming standards associated with Web Services and provides an example of how Web Services can be used to unlock heterogeneous business systems to extract and integrate business data. We provide an introduction to the problems and research issues encountered when applying Web Services to data integration. We provide a formal definition of aggregation (as a type of data integration) and discuss the impact of Web Services on aggregation. We show that Web Services will make the development of systems for aggregation both faster and less expensive to develop. A system architecture for Web Services based aggregation is presented that is representative of products available from software vendors today. Finally, we highlight some of the challenges facing Web Services that are not currently being addressed by standards bodies or software vendors. These include context mediation, trusted intermediaries, quality and source selection, licensing and payment mechanisms, and systems development tools. We suggest some research directions for each of these challenges.
17041428
Context interchange in a client-server architecture
Abstract Many organizations today require information from diverse information systems, and government efforts are moving toward a national information infrastructure for sharing information. However, the systems used by these organizations lack the capabilities to meaningfully translate information among semantically heterogeneous environments. Because the meaning of data acquired from a source environment is usually different from that needed or expected in the receiver's environment, the effectiveness of information exchange is dependent on the system's capability for context interchange, i.e., the representation, exchange, comparison, and transformation of context knowledge. We show here a practical means for developing context interchange capabilities in a client-server architecture by use of semantic values (i.e., data and their context(as the unit of data exchange. The key components in this architecture are the context mediator server, whose job is to identify and construct the semantic values being sent, determine when the exchange is meaningful, and convert the semantic values to the form required by the client (i.e., receiver), and the data environment server, whose job is to assist in the location, access, development, and maintenance of the context knowledge for all clients and servers.
38159603
The COntext INterchange (COIN) Project: Data Extraction and Interpretation from Semi-Structured Web Sources
2677077
Context interchange: new features and formalisms for the intelligent integration of information
The Context Interchange strategy presents a novel perspective for mediated data access in which semantic conflicts among heterogeneous systems are not identified a priori, but are detected and reconciled by a context mediator through comparison of contexts axioms corresponding to the systems engaged in data exchange. In this article, we show that queries formulated on shared views, export schema, and shared “ontologies” can be mediated in the same way using the Context Interchange framework. The proposed framework provides a logic-based object-oriented formalsim for representing and reasoning about data semantics in disparate systems, and has been validated in a prototype implementation providing mediated data access to both traditional and web-based information sources.
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.
1155385
Implementing statecharts in PROMELA/SPIN
We translate statecharts into PROMELA, the input language of the SPIN verification system, using extended hierarchical automata as an intermediate format. We discuss two possible frameworks for this translation, leading to either sequential or parallel code. We show that in this context the sequential code can be verified more efficiently than the parallel code. We conclude with a discussion of an application of the resulting translator to a well-known case study, which demonstrates the feasibility of linear temporal logic model checking of statecharts.
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.
39950733
A Refinement Theory that Supports both 'Decrease of Nondeterminism' and 'Increase of Parallelism'
The decrease of nondeterminism development paradigm that underlies most refinement approaches for concurrent systems is contrasted with the less studied increase of parallelism paradigm used by many protocol designers. We show that the widely used refinement notion of Abadi & Lamport exclusively supports the first paradigm and formulate a generalization that allows derivations of systems applying both paradigms alternatively. We develop the proof technique delayed simulation to prove Abadi & Lamport refinement and its generalization.
6090717
From Testing Theory to Test Driver Implementation
In this article we describe the theoretical foundations for the VVT-RT test system (Verification, Validation and Test for Reactive Real-Time Systems) which supports automated test generation, test execution and test evaluation for reactive systems. VVT-RT constructs and evaluates tests based on formal CSP specifications [6], making use of their representation as labelled transition systems generated by the CSP model checker FDR [3]. The present article provides a sound formal basis for the development and verification of high-quality test tools: Since, due to the high degree of automation offered by VVT-RT, human interaction becomes superfluous during critical phases of the test process, the trustworthiness of the test tool is an issue of great importance. The VVT-RT system will therefore be formally verified so that it can be certified for testing safety-critical systems. The present article represents the starting point of this verification suite, where the basic strategies for test generation and test evaluation used by the system are formally described and verified. VVT-RT has been designed to support automation of both untimed and real-time tests. The present article describes the underlying theory for the untimed case. Exploiting these results, the concepts and high-level algorithms used for the automation of real-time tests are described in a second report which is currently prepared [14]. At present, VVT-RT is applied for hardware-in-the-loop tests of railway and tramway control computers.