Arthur G. Ryman

Bio: Arthur G. Ryman is an academic researcher from IBM. The author has contributed to research in topics: Web service & Computer-aided software engineering. The author has an hindex of 14, co-authored 32 publications receiving 881 citations.

Visualizing and querying software structures

Abstract: Software engineering problems often involve large sets of objects and complex relationships among them. This report proposes that graphical visualization techniques can help engineers undersland and solve a class of these problems. To illustrate this, two problems are analyzed and recast using the graphical language GraphLog. The first problem is that of simplifying dependencies among components of a system, which translates into removing cycles from a graph. The second problem is that of designing an efficient code overlay structure, which is facilitated in several ways through graphical techniques.

System, method, and computer program product for reformatting non-XML data for use with internet based systems

Abstract: A client submits a service request, e.g., a SOAP request, an HTTP GET request or an HTTP POST request. If necessary, parameters within a Structured Query Language (SQL) string are replaced with corresponding values from the client service request. The SQL statement is executed at a database which, in turn, generates a response to the SQL statement. If necessary, the response is converted to XML. The response is then sent to the client.

OSLC Resource Shape A language for defining constraints on Linked Data

Abstract: IBM has for several years been employing a read/write usage of Linked Data as an architectural style for integrating a suite of applications. (1) We are encouraged by the work done by the W3C Linked Data Platform Working Group which is chartered to produce a W3C Recommendation for HTTP-based (RESTful) application integration patterns using read/write Linked Data . The Linked Data Platform Recommendation will provide the industry with a solid foundation to build on. Yet, more work will need to be done to address in a standard way the needs of enterprise solutions that use Linked Data as an application integration platform. One such need is a type definition language that can be used to communicate and validate constraints on RDF data. This paper explains the need for such a language, why standards like RDFS and OWL are not suitable answers and, finally, introduces OSLC Resource Shapes as a proposed solution.

Architecture and applications of the Hy + visualization system

Abstract: The Hy + system is a generic visualization tool that supports a novel visual query language called GraphLog. In Hy + , visualizations are based on a graphical formalism that allows comprehensible representations of databases, queries, and query answers to be interactively manipulated. This paper describes the design, architecture, and features of Hy + with a number of applications in software engineering and network management.

Systems, methods and computer programs for implementing and accessing web services

Abstract: A method of responding to a request from a client to a Web service is disclosed. The method includes the steps of: a) processing the request to identify a resource file and a requested action, wherein the request is encoded in one of a plurality of protocols; b) accessing the resource file which includes data describing the Web service; c) processing the request using at least a portion of the data to produce a response; and d) returning a response to the client. A computer system is also disclosed. The computer system includes a client adapted to send a request to a Web service, and a middleware which receives the request from the client. The computer system also includes a resource file accessible to the middleware. The resource file includes data describing the Web service. The middleware identifies the resource file and requested action from the request, which is encoded in one of a plurality of protocols.

Modelling strategic relationships for process reengineering

Abstract: Existing models for describing a process (such as a business process or a software development process) tend to focus on the "what" or the "how" of the process. For example, a health insurance claim process would typically be described in terms of a number of steps for assessing and approving a claim. In trying to improve or redesign a process, however, one also needs to have an understanding of the "why"--for example, why do physicians submit treatment plans to insurance companies before giving treatment? and why do claims managers seek medical opinions when assessing treatment plans? An understanding of the motivations and interests of process participants is often crucial to the successful redesign of processes. This thesis proposes a modelling framework i* (pronounced i-star) consisting of two modelling components. The Strategic Dependency (SD) model describes a process in terms of intentional dependency relationships among agents. Agents depended on each other for goals to be achieved, tasks to be performed, and resources to be furnished. Agents are intentional in that they have desires and wants, and strategic in that they are concerned about opportunities and vulnerabilities. The Strategic Rationale (SR) model describes the issues and concerns that agents have about existing processes and proposed alternatives, and how they might be addressed, in terms of a network of means-ends relationships. An agent's routines for carrying out a process can be analyzed for their ability, workability, viability and believability. Means-ends rules are used to suggest methods for addressing issues, related issues to be raised, and assumptions to be challenged. The models are represented in the conceptual modelling language Telos. The modelling concepts are axiomatically characterized. The utility of the framework is illustrated each of four application areas: requirements engineering, business process reengineering, organizational impacts analysis, and software process modelling. Advantage of i* over existing modelling techniques in each of these areas are described.

Display screen or portion thereof with graphical user interface

Abstract: Newness and distinctiveness is claimed in the features of ornamentation as shown inside the broken line circle in the accompanying representation.

Specification matching of software components

Abstract: Specification matching is a way to compare two software components, based on descriptions of the component's behaviors. In the context of software reuse and library retrieval, it can help determine whether one component can be substituted for another or how one can be modified to fit the requirements of the other. In the context of object-oriented programming, it can help determine when one type is a behavioral subtype of another. We use formal specifications to describe the behavior of software components and, hence, to determine whether two components match. We give precise definitions of not just exact match, but, more relevantly, various flavors of relaxed match. These definitions capture the notions of generalization, specialization, and substitutability of software components. Since our formal specifications are pre- and postconditions written as predicates in first-order logic, we rely on theorem proving to determine match and mismatch. We give examples from our implementation of specification matching using the Larch Prover.