The proceedings contain 127 papers. The topics discussed include: web service classification using support vector machine;off-line signature verification: an approach based on combining distances and one-class classif...
ISBN:
(纸本)9780769542638
The proceedings contain 127 papers. The topics discussed include: web service classification using support vector machine;off-line signature verification: an approach based on combining distances and one-class classifiers;an ant based approach for generating procedural animations;traffic signal control by using traffic congestion prediction based on pheromone model;action selection and sequencing in multiagent systems: an approximate algorithm based on swarm intelligence;metropolis particle swarm optimization algorithm with mutation operator for global optimization problems;continuous search in constraint programming;fault localization in constraint programs;constraint-based vehicle configuration: a case study;strategy and fairness in repeated two-agent interaction;an adaptive prediction-regret driven strategy for bilateral bargaining;and using cellular automata pedestrian flow statistics with heuristic search to automatically design spatial layout.
Automated judging systems have had the tough task of ensuring the normal proceeding of programming contests for a long time. There are numerous ways proposed to secure the execution of a contestant's solution and ...
详细信息
The proceedings contain 17 papers. The topics discussed include: test automation with TTCN-3 - state of the art and a future perspective;a model-based approach to testing software for critical behavior and properties;...
ISBN:
(纸本)3642165729
The proceedings contain 17 papers. The topics discussed include: test automation with TTCN-3 - state of the art and a future perspective;a model-based approach to testing software for critical behavior and properties;a Pareto ant colony algorithm applied to the class integration and test order problem;more testable properties;alternating simulation and IOCO;reducing the cost of model-based testing through test case diversity;built-in data-flow integration testing in large-scale component-based systems;black-box system testing of real-time embedded systems using random and search-based testing;testing product generation in software product lines using pairwise for features coverage;increasing functional coverage by inductive testing: a case study;test data generation for programs with quantified first-order logic specifications;efficient distributed test architectures for large-scale systems;and a learning-based approach to unit testing of numerical software.
The proceedings contain 56 papers. The topics discussed include: policy monitoring in first-order temporal logic;retrofitting legacy code for security;quantitative information flow: from theory to practice?;memory man...
ISBN:
(纸本)364214294X
The proceedings contain 56 papers. The topics discussed include: policy monitoring in first-order temporal logic;retrofitting legacy code for security;quantitative information flow: from theory to practice?;memory management in concurrent algorithms;there's plenty of room at the bottom: analyzing and verifying machine code;constraint solving for program verification: theory and practice by example;invariant synthesis for programs manipulating lists with unbounded data;termination analysis with compositional transition invariants;lazy annotation for program testing and verification;the static driver verifier research platform;breach, a toolbox for verification and parameter synthesis of hybrid systems;petruchio: from dynamic networks to nets;synthesis of quantized feedback control software for discrete time linear hybrid systems;safety verification for probabilistic hybrid systems;and an abstraction-refinement approach to verification of artificial neural networks.
While teaching a course on the foundations of informatics to non-CS students, the author wanted to offer a programming challenge without burdening the participants with the numerous details that typically accompany th...
详细信息
Adaptive packet sizing techniques are widely used in wireless communication to enhance the link reliability. Typically, shorter packets are less error prone than longer packets. Adaptive packet size technique is used ...
详细信息
ISBN:
(纸本)9781612841519
Adaptive packet sizing techniques are widely used in wireless communication to enhance the link reliability. Typically, shorter packets are less error prone than longer packets. Adaptive packet size technique is used in IEEE 802.11 wireless network to enhance link reliability and packet delivery ratio. In this work, we adopt this technique to work in IEEE 802.15.4 based networks, and specifically in wireless sensor networks. A special protocol is designed to implement adaptive packet size transmission in WSN. In WSN, different mote designs and implementations are relying on the use of programmable circuits in their sensor interface boards. Delivering new firmware to these circuits by means of OTAP ( Over The Air programming) requires a reliable link between base station and target mote. Such reliable link can be achieved using the proposed adaptive packet sizing protocol. A testbed based on such scenario is constructed and the proposed protocol was tested to send new firmware update data to the target mote in its distant location under different environmental conditions.
Productivity is the ability to create a quality software product in a limited period with limited resources. The software engineering community advocates that the future of productivity lies in the field of domain eng...
详细信息
Productivity is the ability to create a quality software product in a limited period with limited resources. The software engineering community advocates that the future of productivity lies in the field of domain engineering. However, existing domain engineering approaches suffer from the tension between productivity and applicability. In this paper we propose an approach that reduces this tension by adopting a domain engineering method called Application-based DOmain Modeling (ADOM) as an infrastructure for a new programming approach. The adopted ADOM is applied on Java as its underlying language. This approach will offer guidance and validation for application developers as mechanisms for improving their productivity. This is done by keeping the regular Java development environment and thus maintaining the developer's expressiveness and not compromising the overall applicability of the approach.
For a service robot to perform a given task without human intervention, the robot must be able to make a plan, i.e., a sequence of high-level actions and execute it autonomously. Recently, a few researchers have inves...
详细信息
ISBN:
(纸本)9783642173189
For a service robot to perform a given task without human intervention, the robot must be able to make a plan, i.e., a sequence of high-level actions and execute it autonomously. Recently, a few researchers have investigated Description logic-based task planning techniques. In this paper we discuss our implementation methods of Description logic-based task planning and execution. Some knowledge representation scheme is investigated and a simple planning algorithm is conceived. Some techniques are conceived to bridge the gap between the symbolic world and the program world in order to execute the task plan. We also explain our experiments and the results we have got.
It is well known that modeling with constraints networks require a fair expertise. Thus tools able to automatically generate such networks have gained a major interest. The major contribution of this paper is to set a...
详细信息
It is well known that modeling with constraints networks require a fair expertise. Thus tools able to automatically generate such networks have gained a major interest. The major contribution of this paper is to set a new framework based on Inductive logicprogramming able to build a constraint model from solutions and non-solutions of related problems. The model is expressed in a middle-level modeling language. On this particular relational learning problem, traditional top-down search methods fall into blind search and bottom-up search methods produce too expensive coverage tests. Recent works in Inductive logicprogramming about phase transition and crossing plateau shows that no general solution can face all these difficulties. In this context, we have designed an algorithm combining the major qualities of these two types of search techniques. We present experimental results on some benchmarks ranging from puzzles to scheduling problems.
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic execution, theorem proving, satisfiabil...
详细信息
ISBN:
(纸本)9783642165726
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic execution, theorem proving, satisfiability solving, and usage of specifications and program annotations such as loop invariants. These techniques are suitable for testing of small programs, such as, e.g., implementations of algorithms, that have to be tested extremely well. In such scenarios test data is generated from test data constraints which are first-order logic formulas. These constraints are constructed from path conditions, specifications, and program annotation describing program paths that are hard to be tested randomly. A challenge is, however, to solve quantified formulas. The presented algorithm is capable of solving quantified formulas that state-of-the-art satisfiability modulo theory (SMT) solvers cannot solve. The algorithm is integrated in the formal verification and test generation tool KeY.
暂无评论