Benchmark testing has demonstrated the reality of significant throughput runtime improvement in simulation performance, when integrating the LOGOS DATPG (digital automatic test program generator) with a hardware accel...
详细信息
Benchmark testing has demonstrated the reality of significant throughput runtime improvement in simulation performance, when integrating the LOGOS DATPG (digital automatic test program generator) with a hardware accelerator. This new capability enables LOGOS to address current and future TPS (test program set) development problems associated with CPU intensive network model simulation. It is noted that the benefit derived from the simulation performance, observed in the integrated system, can be translated by TPS program managers into a cost-effective boiler plate for TPS development program proposals and estimates concerning computing resources and engineering manpower requirements.< >
Although autocoding techniques promise large gains in software development productivity, their "real-world" application has been limited, particularly in safety-critical domains. Often, the major impediment ...
详细信息
Although autocoding techniques promise large gains in software development productivity, their "real-world" application has been limited, particularly in safety-critical domains. Often, the major impediment is the missing trustworthiness of these systems: demonstrating - let alone formally certifying - the trustworthiness of automatic code generators is extremely difficult due to their complexity and size. We develop an alternative product-oriented certification approach which is based on five principles: (1) trustworthiness of the generator is reduced to the safety of each individual generated program; (2) program safety is defined as adherence to an explicitly formulated safety policy; (3) the safety policy is formalized by a collection of logical program properties; (4) Hoare-style program verification is used to show that each generated program satisfies the required properties; (5) the code generator itself is extended to automatically produce the code annotations required for verification. The approach is feasible because the code generator has full knowledge about the program under construction and about the properties to be verified. It can thus generate all auxiliary code annotations a theorem prover needs to discharge all emerging verification obligations fully automatically. Here we report how this approach is used in a certification extension for AutoBayes, an automatic program synthesis system which generates data analysis programs (e.g., for clustering and time-series analysis) from declarative specifications. In particular, we describe how a variable-initialization-before-use safety policy can be encoded and certified.
We establish DICE system treated as a computing augmented training approach to support the classical lecture-based teaching. The result shows students can do more efforts on shaping their programming skills via practi...
详细信息
We establish DICE system treated as a computing augmented training approach to support the classical lecture-based teaching. The result shows students can do more efforts on shaping their programming skills via practice in ***, we developed the method dasiaTestDriven Developmentrdquo (TDD) into DICE introduced in software engineering. DICE TDD classes the training material from exploration to instruction into 16 levels supporting DICE to guide students coding both in programming skills and conceptual knowledge in a specific topic. DICE promotes learning performance up to 11.277% than non-DICE while DICE TDD works up the learning performance to 50.881% than the pure DICE learner, thus we can infer DICE TDD can increase the learning performance about 1.679 times than lectured-based teaching style in *** also figured out Kolbpsilas learning style has different significant on learning performance in TDD verse non-TDD. An adaptive learning model was proposed to adaptive students to different TDD training materials by their individual difference.
An important part of creating systems with complex behavior is quality control. Regression makes it important not just to check that the developed program satisfies all its requirements, but also makes this process ef...
详细信息
An important part of creating systems with complex behavior is quality control. Regression makes it important not just to check that the developed program satisfies all its requirements, but also makes this process efficient, maximally automates it. In practice, this can be done with formalized program requirements and keeping of executable specification together with the code of the program This paper focuses on improvement of presentation of specifications for automata programs where complex behavior is expressed in a number of explicitly separated states. We show how to formalize specifications using tests, temporal formulas and contracts and integrate these presentations into integrated development process. We also suggest how to preserve the correctness of automata programs during redesign of complex behavior.
We are developing a system capable of observing a human performing a task and understanding the task well enough to replicate it. This approach is called Assembly Plan from Observation. In order to replicate the obser...
详细信息
We are developing a system capable of observing a human performing a task and understanding the task well enough to replicate it. This approach is called Assembly Plan from Observation. In order to replicate the observed task, we have to analyze the entire sequence. This can be done by first segmenting the task sequence into its constituent pre-grasp, grasp, and manipulation phases. This paper describes the different analyses that can be done subsequent to the temporal segmentation. These include human grasp recognition, extraction of object motion, and the spatiofrequency (spectrogram) analysis of the manipulation phase.< >
This paper presents a new logic-based method of detecting incidents on signalized streets. The concept of the method is based on the fact that incidents, when reducing capacity of intersections, change the sequence of...
详细信息
This paper presents a new logic-based method of detecting incidents on signalized streets. The concept of the method is based on the fact that incidents, when reducing capacity of intersections, change the sequence of congested sections (congestion patterns) along an arterial street. Rules are derived that use discrepancies between expected and actual congestion patterns to detect the presence of incidents and to identify their location. The feasibility of the method was checked with computer simulation. The following features of the proposed method distinguish it from the existing methods: (1) any data that carries congestion information can be used; (2) all the rules applied to infer incident information are rigorously derived from the fundamental principles of traffic operations and not from subjective human knowledge; (3) the method estimates the range of possible values of capacities affected by the incident; and (4) the method is able to detect incident clearance. This paper presents a novel idea of detecting incidents rather than a fully verified method.
This paper deals with a system called TPMS (Task Planning for Manufacturing Systems). The main aim of this system is to automatically generate programs or sets of commands for robots, AGV, numerical control machines, ...
详细信息
This paper deals with a system called TPMS (Task Planning for Manufacturing Systems). The main aim of this system is to automatically generate programs or sets of commands for robots, AGV, numerical control machines, etc, without spending much time programming the flexible manufacturing system components. The sequence of operations to be handled by the manufacturing system depends on the constraints for the task. The symbolic plan for the task is represented in the form of a precedence graph. The main contributions are the following ones: to link symbolic and execution planning; the referred aims at working for complete manufacturing systems; different industrial operations can be considered at the same time.
Tree automata turned out to be a very convenient framework for modeling and proving properties on infinite systems like communication protocols, Java programs and also in the context of XML programming. Unfortunately,...
详细信息
Tree automata turned out to be a very convenient framework for modeling and proving properties on infinite systems like communication protocols, Java programs and also in the context of XML programming. Unfortunately, these works are not always supported by efficient verification and validation tools. This paper investigates the use of two SAT solvers --- MiniSat and picoSat --- to evaluate queries over tree automata with global equality and disequality constraints (TAGEDs for short). Unlike general tree automata, TAGEDs allow to express constraints useful for e.g., evaluating queries over XML documents, like 'in the document, two nodes do not have the same key'. These queries being based on the membership problem which is NP-complete for TAGEDs, we propose an efficient SAT encoding of the membership problem for TAGEDs and we show its correctness and soundness. The paper reports on the experimental results, and implementation details are given.
This paper presents a mutation analysis tool based on a reflective macro system. Mutation analysis is a powerful and computationally expensive technique that measures the effectiveness of test cases for revealing faul...
详细信息
ISBN:
(纸本)0769514081
This paper presents a mutation analysis tool based on a reflective macro system. Mutation analysis is a powerful and computationally expensive technique that measures the effectiveness of test cases for revealing faults. The principal expense of mutation analysis is that many faulty versions of the program under test, called mutants, must be repeatedly executed. This technique has originally been developed in the framework of procedural programs, and should be revisited to consider some types of faults likely to appear in object-oriented environments. The mutation system detailed in this paper deals with object-oriented concepts introduced in the Java programming language, and is able to generate automatically mutant programs according to 20 types of object-oriented faults.
暂无评论