11116452
The object-oriented hypermedia design model
H ypermedia applications typically include complex information , and may allow sophisticated navigation behavior. The Object-Oriented Hypermedia Design Method (OOHDM) [4] uses abstraction and composition mechanisms in an object-oriented framework to, on one hand, allow a concise description of complex information items, and on the other hand, allow the specification of complex navigation patterns and interface transformations. In OOHDM, a hypermedia application is built in a four-step process supporting an incremental or prototype process model. Each step focuses on a particular design concern, and an object-oriented model is built. Classification, aggregation and generalization/specialization are used throughout the process to enhance abstraction power and reuse opportunities. Figure 1 summarizes the steps, products , mechanisms and design concerns in OOHDM. Domain Analysis In this step a conceptual model of the application domain is built using well-known object-oriented modeling principles [3], augmented with some primitives such as attribute perspectives (multiple-valued attributes, similar to HDM perspectives [1]). Conceptual classes may be built using aggregation and generalization/special-ization hierarchies. There is no concern for the types Abstract interface objects, responses to external events, interface transformations Running application
47231847
Enhancing a requirements baseline with scenarios
Scenarios are well recognized as an important strategy towards understanding the interface between the environment and the system, as well as a means to elicit and specify software behavior. We have a broader understanding of scenarios: for us, a scenario is an evolving description of situations in the environment. Our proposal is framed by Leite's (1995) work on a client-oriented requirements baseline, which aims at modeling the external requirements of a software system and its evolution. Scenarios start by describing the environmental situation, according to the main actions performed outside the software system. Scenarios also help the clarification of the interrelation between functional and non-functional requirements. We have validated our strategy and related representations based on case studies of a real situation.
7589770
Specifying Quality Characteristics and Attributes for Websites
In this work, we outline more than a hundred characteristics and attributes for the domain of academic sites in order to analyze the quality requirement tree and a way to specify them. These elements are used in a quantitative methodology for assessment, comparison, and ranking processes. The proposed Web-site Quality Evaluation Methodology (QEM) can be a useful approach to assess the quality in different phases of a Web product life cycle. In the academic study, we have observed three different evaluation audiences regarding visitor users: current and prospective students, academic personnel, and research sponsors. Besides, the aim of this work is to show a hierarchical and descriptive specification framework for characteristics, subcharacteristics and attributes. This framework is a key underlying piece in the construction of a hyperdocumented evaluation tool. Finally, some results are presented and concluding remarks are discussed.
21945654
Designing Hypermedia Applications with Objects and Patterns
In this paper we present a software engineering approach for building hypermedia applications. Our approach combines the use of an object-oriented method with a system of design patterns for navigational and interface design. We first present the core activities in the Object-Oriented Hypermedia Design Method (OOHDM), namely conceptual design navigation design, abstract interface design and implementation, describing the modeling constructs we use to build high-level, abstract navigational and interface structures. Next we give the rationale for using design patterns in the process of building high quality hypermedia applications, and present some simple patterns solving recurrent design problems. We finally discuss some further issues.
7012937
Integrating Lists, Multisets, and Sets in a Logic Programming Framework
The first order theories of lists, bags, compact-lists (i.e., lists where the number of contiguous occurrences of each element is immaterial), and sets are introduced via axioms. Such axiomatizations are shown to be especially suitable for the integration with free functor symbols governed by the classical Clark’s axioms in the context of Constraint Logic Programming. Adaptations of the extensionality principle to the various theories taken into account is then exploited in the design of unification algorithms for the considered data structures. All the theories presented can be combined providing frameworks to deal with several of the proposed data structures simoultaneously. The unification algorithms proposed can be combined (merged) as well to produce engines for such combination theories.
1023546
A WAM Implementation for the Logic Meta Programming Language 'Log
A technique for compiling the meta-programming logic programming language 'Log (read quote log) is presented and the extensions to the standard Warren Abstract Machine (WAM) architecture necessary to support the execution of 'Log programs are described. 'Log is a logic programming language upgraded with a flexible naming scheme and a set of operators allowing each syn tactic entity to be referred to and manipulated at the desired detail level. This language still possesses the declarative semantics of pure Prolog. Upgrading the WAM architecture to support 'Log has required to cope with some novel implementation challenges. First, an efficient internal representation for both meta-representations of 'Log must be provided. Second the execution of a 'Log program generates constraints that must be handled dynamically by the run-time architecture of the WAM. A 'Log compiler has been implemented along with a WAM based run-time sup port architecture.
2892821
Un Linguaggio Logico con Insiemi Finiti Inserito nello Schema CLP
3157847
Intensional Sets in CLP
We propose a parametric introduction of intensionally defined sets into any \(CLP(\mathcal \{D\})\) language. The result is a language \(CLP({\mathcal \{D\}})\), where constraints over sets of elements of \(\mathcal D\) and over sets of sets of elements, and so on, can be expressed. The semantics of \(CLP({\mathcal \{D\}})\) is based on the semantics of logic programs with aggregates and the semantics of CLP over sets. We investigate the problem of constraint resolution in \(CLP({\mathcal \{D\}})\) and propose algorithms for constraints simplification.