The requirement capture is made by means of natural language interviews between analyst and stakeholder. Specifications of the application to-be-made arise from this conversation, and they are usually represented in c...
详细信息
ISBN:
(纸本)9781934272947
The requirement capture is made by means of natural language interviews between analyst and stakeholder. Specifications of the application to-be-made arise from this conversation, and they are usually represented in conceptual schemas. Some of the conventional CASE tools use conceptual schemas to automatically generate part of the application code, but they require the analyst to subjectively understand the domain, manually develop the conceptual schemas, and manually verify the resulting application. Furthermore, the used schemes are not easily understood by the stakeholder, which make difficult real time validation. In order to partially solve these problems, in this paper we define heuristic rules for generating java and PHP code from a UN-Lencep (Universidad Nacional de Colombia - Lenguaje Controlado para la Especificación de Esquemas Preconceptuales) speech. We also exemplify this proposal with a case study.
java PathFinder is an explicit-state model checker for java programs. In search for a given condition, JPF explores all possible execution states that a given program can have, including different possibilities of thr...
详细信息
ISBN:
(纸本)9780889868205
java PathFinder is an explicit-state model checker for java programs. In search for a given condition, JPF explores all possible execution states that a given program can have, including different possibilities of thread interleavings. Due to large number of possible states and execution paths, JPF performance has been an issue since the beginning. A great amount of work has been in progress to enhance the time and space requirements of JPF model checking. State Generation and Search Algorithms, in particular, play an important role during the execution of JPF. The focus of this paper is to highlight optimality and completeness issues of JPF's default search algorithm and address it using the well-known Iterative Deepening Search(IDS). Empirical evaluation of Depth First Search(DFS) and Iterative Deepening Search are also presented. From the theoretical point of view, iterative search has better time and space complexity compared to Depth First Search. It is also shown empirically that iterative deepening search can be used to model check programs that are not testable with the default DFS.
The article first makes an intenstive research to the next-generation mobile application platform which is Android to determine the feasbi-asbitilty that the PKM technology can be develope-d in the platform of Android...
详细信息
We propose a formal framework for extending a class-based language, equipped with a given class composition mechanism, to allow programmers to define their own derived composition operators. These definitions can expl...
详细信息
Traits have been designed as units of fine-grained behavior reuse in the object-oriented paradigm. In this paper, we present the language Sugared Welterweight Record-Trait java (SWRTJ), a java dialect with records and...
详细信息
Cross-language method invocations are commonly used for integrating objects residing in different programminglanguage environments. In this experience report, we evaluate the performance and the design impact of alte...
详细信息
Web services have emerged as a technology for designing and composing distributed applications. Recent research increasingly addressed the need to adapt such systems based on changing requirements and environmental co...
详细信息
This paper proposed an ontology-support web focused-crawler: OntoCrawler III for java programs, in which only the user entered some keywords would the system supported by the domain ontology actively provide compariso...
详细信息
We present an OpenMP framework for java that can exploit an available graphics card as an application accelerator. Dynamic languages (java, C#, etc.) pose a challenge here because of their write-once-run-everywhere ap...
详细信息
This paper presents a framework for supporting the optimization of java programs using attributes in java class files. We show how class file attributes may be used to convey both optimization opportunities and profil...
详细信息
This paper presents a framework for supporting the optimization of java programs using attributes in java class files. We show how class file attributes may be used to convey both optimization opportunities and profile information to a variety of java virtual machines including ahead-of-time compilers and just-in-time compilers. We present our work in the context of Soot, a framework that supports the analysis and transformation of java bytecode (class files) [21, 25, 26]. We demonstrate the framework with attributes for elimination of array bounds and null pointer checks, and we provide experimental results for the Kaffe just-in-time compiler, and IBM's High Performance Compiler for java ahead-of-time compiler.
暂无评论