An increasing number of software systems is developed using component technologies such as COM, CORBA, or EJB. Still, there is a lack of support to reverse engineer such systems. Existing approaches claim reverse engi...
详细信息
ISBN:
(纸本)9781424421572
An increasing number of software systems is developed using component technologies such as COM, CORBA, or EJB. Still, there is a lack of support to reverse engineer such systems. Existing approaches claim reverse engineering of components, but do not support composite components. Also, external dependencies such as required interfaces are not made explicit. Furthermore, relaxed component definitions are used, and obtained components are thus indistinguishable from modules or classes. We present an iterative reverse engineering approach that follows the widely used definition of components by Szyperski. It enables third-party reuse of components by explicitly stating their interfaces and supports composition of components. Additionally, components that are reverse engineered with the approach allow reasoning on properties of software architectures at the model level. For the approach, source code metrics are combined to recognize components. We discuss the selection of source code metrics and their interdependencies, which were explicitly taken into account. An implementation of the approach was successfully validated within four case studies. Additionally, a fifth case study shows the scalability of the approach for an industrial-size system.
Correctness of compilers is a vital precondition for the correctness of the software translated by them. In this paper, we present two approaches for the formalization of static single assignment (SSA) form together w...
详细信息
This paper describes Paradis-Net, a typed event-driven message-passing interface for designing distributed systems. Paradis-Net facilitates the development of both peer-to-peer and client-server architectures through ...
详细信息
Assessing numerous models from students in written exams or homework is an exhausting *** present an approach for a fair and transparent assessment of the completeness of models according to a natural language domain ...
详细信息
ISBN:
(纸本)9783642016479
Assessing numerous models from students in written exams or homework is an exhausting *** present an approach for a fair and transparent assessment of the completeness of models according to a natural language domain description. The assessment is based on checklists generated by the tool Sumo. Sumo directly works on an annotated version of the original exam text, so no 'gold standard' is needed.
Formal semantics of programming languages needs to model the potentially infinite state transition behavior of programs as well as the computation of their final results simultaneously. This requirement is essential i...
详细信息
The Ephyra QA system has been developed as a flexible open-domain QA framework. This framework allows us to combine several techniques for question analysis and answer extraction and to incorporate multiple knowledge ...
The Ephyra QA system has been developed as a flexible open-domain QA framework. This framework allows us to combine several techniques for question analysis and answer extraction and to incorporate multiple knowledge bases to best fit the requirements of the TREC QA track, in which we participated this year for the first time. The techniques used include pattern learning and matching, answer type analysis and redundancy elimination through filters. In this paper, we give an overview of the Ephyra system as used within TREC 2006 and analyze the system's performance in the QA track.
Automated matching of semantic service descriptions is the key to automatic service discovery and binding. But when trying to find a match for a certain request it may often happen, that the request cannot be serviced...
详细信息
ISBN:
(纸本)1595936548
Automated matching of semantic service descriptions is the key to automatic service discovery and binding. But when trying to find a match for a certain request it may often happen, that the request cannot be serviced by a single offer but could be handled by combining existing offers. In this case automatic service composition is needed. Although automatic composition is an active field of research it is mainly viewed as a planning problem and treated separatedly from service discovery. In this paper we argue that an integrated approach to the problem is better than seperating these issues as is usually done. We propose an approach that integrates service composition into service discovery and matchmaking to match service requests that ask for multiple connected effects, discuss general issues involved in describing and matching such services and present an efficient algorithm implementing our ideas.
In service-oriented computing, software agents interact by requesting and providing services. Since providing a service incurs cost, uncooperative behavior dominates in the absence of an incentive mechanism. An econom...
详细信息
Applying meta search systems is a suitable method for supporting the user if there are many different retrieval services available on the Web. Due to information splitting strategies of literature services existing me...
详细信息
Mobile devices are able to spontaneously form highly dynamic ad hoc networks allowing for communication even when no infrastructure exists. Ideally, these networks enable the participating devices to share resources a...
详细信息
Mobile devices are able to spontaneously form highly dynamic ad hoc networks allowing for communication even when no infrastructure exists. Ideally, these networks enable the participating devices to share resources and services, thus overcoming the often severe limitations of the individual devices' capabilities. In order to make this possible, powerful semantic service trading is needed. In this paper, we propose a semantic overlay of hierarchical service rings to achieve this goal. In contrast to existing approaches this method is adapted to the specific characteristics of ad hoc networks.
暂无评论