programming automated web navigation assistants, i.e., applications that automatically navigate the web performing specific tasks for the user, is far from easy. Since HTML pages offered by legacy web-based applicatio...
详细信息
programming automated web navigation assistants, i.e., applications that automatically navigate the web performing specific tasks for the user, is far from easy. Since HTML pages offered by legacy web-based applications, which are designed to be manipulated only by people using browsers, web pages contain semi-structured information [P. Atzeni, et al., 1997] whose data schema can easily be changed, the creation and even the maintenance of this kind of applications, is very expensive. However, an increasing amount of information sources and online applications have been added to the web during the last few years, so assistants for automating tasks over those web-enabled applications are more and more needed. These assistants may automate tasks by filling in forms, following links, analyzing data embedded in web pages and performing computations over those data on behalf of the user. Software engineering techniques are clearly needed to reduce the cost, not just creating these programs (by significantly reducing their time-to-market), but even more importantly, maintaining them working properly, reducing the cost of readapting them to web site pages whose structure or navigation schemes are frequently changed. This paper proposes the well known formal method message sequence charts (MSC) [ITU-T, 1997] as a base for defining a language for programming web navigation assistants which may navigate a web site according to the user's aims. This specification language, called XPlore, is specially suited for both requirements engineering and automatic generation of an executable, and has been successfully tested on several well known web sites.
This paper presents a correct-by-construction synthesis method for generating operating system based device drivers from a formally specified device behavior model. Existing driver development is largely manual using ...
详细信息
ISBN:
(纸本)1581137427
This paper presents a correct-by-construction synthesis method for generating operating system based device drivers from a formally specified device behavior model. Existing driver development is largely manual using an ad-hoc design methodology. Consequently, this task is error prone and becomes a bottleneck in embedded system design methodology. Our solution to this problem starts by accurately specifying device access behavior with a formal model, viz. extended event driven finite state machines. We state easy check soundness conditions on the model that subsequently guarantee properties such as bounded execution time and deadlock-free behavior. We design a deadlock-free resource accessing scheme for our device access model. Finally, we synthesize an operating system (OS) based event processing mechanism, which is the core of the device driver, using a disciplined methodology that assures the correctness of the resulting driver. We validate our synthesis method using two case studies: an infrared port and the USB device controller for an SA1100 based handheld. Besides assuring a correct-by-construction driver, the size of the specification is 70% smaller than a manually written driver, which is a strong indicator of improved design productivity.
We show that automata theory can be useful for engineering, developing and documenting multiagent systems. Algorithmization and programming principles for logic control are formulated, regarding algorithms and program...
详细信息
We show that automata theory can be useful for engineering, developing and documenting multiagent systems. Algorithmization and programming principles for logic control are formulated, regarding algorithms and programs as finite automata.
Contemporary neural architectures having one or more hidden layers suffer from the same deficiencies that genetic algorithms and methodologies for non-trivial automatic programming do; namely, they cannot exploit inhe...
详细信息
Contemporary neural architectures having one or more hidden layers suffer from the same deficiencies that genetic algorithms and methodologies for non-trivial automatic programming do; namely, they cannot exploit inherent domain symmetries for the transference of knowledge from an application of lesser to greater rank, or across similar applications. As a direct consequence, no ensemble of contemporary neural architectures allows for the effective codification and transference of knowledge within a society of individuals (i.e., swarm knowledge). These deficiencies stem from the fact that contemporary neural architectures cannot reason symbolically using heuristic ontologies. They cannot directly provide symbolic explanations of what was learned for purposes of inspection and verification. Moreover, they do not allow the knowledge engineer to precondition the internal feature space through the application of domain-specific modeling languages. A symbolic representation can support the heuristic evolution of an ensemble of neural architectures. Each neural network in the ensemble imbues a hidden layer and for this reason is NP-hard in its learning performance. It may be argued that the internal use of a neat representation subsumes the heuristic evolution of a scruffy one. It follows that there is a duality of representation under transformation. The goal of AI then is to find symbolic representations, transformations, and associated heuristic ontologies. This paper provides an introduction to this quest. Consider the game of chess for example. If a neural network or symbolic heuristic is used to evaluate board positions, then the best found iterate (i.e., of weights or symbols) serves as a starting point for iterative refinement. This paper addresses the ordering and similarity of the training instances in refining subsequent iterates. If we fix the learning technology, then we need to focus on reducing the problem, composing intermediate results, and transferring th
Most recent general purpose processors feature short vector SIMD instructions, like SSE on Pentium III/4. We automatically generate platform-adapted short vector code for DSP transform algorithms using SPIRAL. SPIRAL ...
详细信息
Most recent general purpose processors feature short vector SIMD instructions, like SSE on Pentium III/4. We automatically generate platform-adapted short vector code for DSP transform algorithms using SPIRAL. SPIRAL represents and generates fast algorithms as mathematical formulas, and translates them into code. Adaptation is achieved by searching in the space of algorithmic and coding alternatives for the fastest implementation on the given platform. We explain the mathematical foundation that relates formula constructs to vector code, and overview the vector code generator within SPIRAL. Experimental results show excellent speed-ups compared to ordinary C code for a variety of transforms and computing platforms. For the DFT on Pentium 4, our automatically generated code compares favorably with the hand-tuned Intel MKL vendor library.
automatic programming (AP) systems have been used in a great variety of ways since the early days of software engineering. They have been used in Al related research approaches with the nun to generate computer progra...
详细信息
ISBN:
(纸本)3540411720
automatic programming (AP) systems have been used in a great variety of ways since the early days of software engineering. They have been used in Al related research approaches with the nun to generate computer programs from informal, incomplete, natural language-like specifications as well as in more pragmatic approaches related to 4th level languages. Terms such as "application generator", "transformational system", "code synthesizer", "generative software development" were used for naming various approaches to AP. This paper presents a categorization scheme for AP systems. In this categorization scheme, a clear distinction is made between the Al related, hard AP- and soft AP systems. Alter that, a broad range of AP systems as well as their position in the categorization scheme is presented. Finally we discuss the relation between AP and software reuse.
The development of Virtual Instruments (VIs) brings a great revolution to the fields of automated test and measurement. It accelerates the integration of measurement systems and promotes instrument standardization, mo...
详细信息
The development of Virtual Instruments (VIs) brings a great revolution to the fields of automated test and measurement. It accelerates the integration of measurement systems and promotes instrument standardization, modularization, and generalization. Graphical programming platform for automated test is one of the most important applications for virtual instrument technology, and it provides users with an intuitive and friendly programming environment. Visual Component Library (VCL) is the key part of such graphical programming platforms. The research reported in this paper makes full use of the advantages of object orientation methodology to develop the visual VI components for a graphical programming platform. By setting up two base classes for all the VI components, various VIs can be efficiently developed.
Many evolutionary computation methods have been studied. Recently, a new method called Genetic Network programming (GNP), which is based on genetic algorithms and genetic programming has been proposed. GNP has a netwo...
详细信息
Many evolutionary computation methods have been studied. Recently, a new method called Genetic Network programming (GNP), which is based on genetic algorithms and genetic programming has been proposed. GNP has a network structure and can search for solutions effectively. GNP has been mainly applied to dynamic problems. In this paper, GNP is extended to generating programs in the static environment.
At ASU, new commercially available automatic code-generation tools are used to progress from controller design, to simulation, and finally to implementation on embedded hardware. Case studies highlighting a force-feed...
详细信息
Traditional design and implementation of large atmospheric models is a difficult, tedious and erroneous task. With the CTADEL project we propose a new method of code generation, where the designer describes the model ...
详细信息
ISBN:
(纸本)3540435913
Traditional design and implementation of large atmospheric models is a difficult, tedious and erroneous task. With the CTADEL project we propose a new method of code generation, where the designer describes the model in an abstract high-level specification language which is translated into highly optimized Fortran code. In this paper we show the abilities of this method on a coupled ocean-atmosphere model, in which we have to deal with multi-resolution domains and different time-steps. We, briefly, describe a new concept in compiler design, the use of templates for code generation, to elevate the burden of choosing architecture optimized numerical routines.
暂无评论