Requirements Engineering is one of the most important phases in any product development life cycle since it is the basis for the complete software or product design and realization. Therefore in a worst case scenario ...
详细信息
Requirements Engineering is one of the most important phases in any product development life cycle since it is the basis for the complete software or product design and realization. Therefore in a worst case scenario any error within a requirement can result in a project loss. Computer support for requirement engineers is still premature as most RE applications can not cope with more sophisticated techniques like semantics, natural language processing etc. In this paper we will present the ongoing research work in semantic requirement engineering which will try to close the gap between computer understandable semantics, namely ontologies, and the natural language input of a human.
MDSD is highly regarded and already used in industry. This paper presents an approach for the model driven development of enterprise applications with minimum modeling effort and a maximum of configuration possibiliti...
详细信息
ISBN:
(纸本)1891706268
MDSD is highly regarded and already used in industry. This paper presents an approach for the model driven development of enterprise applications with minimum modeling effort and a maximum of configuration possibilities for the software developer. The approach uses the GeneSEZ framework with the concept of model annotations. It uses UML profiles with stereotypes and tagged values which can almost be used like the known Java annotations.
We describe a practical method for reasoning about realistic concurrent programs. Our method allows global two-state invariants that restrict update of shared state. We provide simple, sufficient conditions for checki...
详细信息
ISBN:
(纸本)9783642142949
We describe a practical method for reasoning about realistic concurrent programs. Our method allows global two-state invariants that restrict update of shared state. We provide simple, sufficient conditions for checking those global invariants modularly. The method has been implemented in VCC1, an automatic, sound, modular verifier for concurrent C programs. VCC has been used to verify functional correctness of tens of thousands of lines of Microsoft's Hyper-V virtualization platform(2) and of SYSGO's embedded real-time operating system PikeOS.
The proceedings contain 18 papers. The special focus in this conference is on Testing software and systems. The topics include: Test automation with TTCN-3 - state of the art and a future perspective;a model-based app...
ISBN:
(纸本)3642165729
The proceedings contain 18 papers. The special focus in this conference is on Testing software and systems. The topics 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;FloPSy - search-based floating point constraint solving for symbolic execution;test data generation for programs with quantified first-order logic specifications;efficient distributed test architectures for large-scale systems;generating models of infinite-state communication protocols using regular inference with abstraction;practical end-to-end performance testing tool for high speed 3G-Based networks;a learning-based approach to unit testing of numerical software;from scenarios to test implementations via promela and a tool for impact analysis of aspect weaving on test cases.
We outline Israel's IOI (international Olympiad in Informatics) project. Israel joined the IOI in 1997 and has participated in the IOI ever since, apart from 2008. We describe the selection and training process in...
详细信息
We generalize in this paper the Dung's abstract argumentation theory in order to represent, in addition to the attack relation, a particular kind of support relation which captures knowledge of the form : “argume...
详细信息
We generalize in this paper the Dung's abstract argumentation theory in order to represent, in addition to the attack relation, a particular kind of support relation which captures knowledge of the form : “argument a is necessary to obtain argument b”. Unlike a general unspecified support, the necessity relation has the advantage to ensure that its interaction with direct attacks generates new (indirect) attacks having exactly the same nature of the direct ones. We discuss the advantageous consequences of this specialization of the support relation on the acceptability semantics of the underlying bipolar framework. Then, we show a suitable translation of any such bipolar framework into a logic program without passing by a preliminary translation into the classical framework of Dung.
Mode-directed tabling amounts to using table modes to control what arguments are used in variant checking of subgoals and how answers are tabled. A mode can be min, max, + (input), (output), or nt (non-tabled). While ...
详细信息
Mode-directed tabling amounts to using table modes to control what arguments are used in variant checking of subgoals and how answers are tabled. A mode can be min, max, + (input), (output), or nt (non-tabled). While the traditional table-all approach to tabling is good for finding all answers, mode-directed tabling is well suited to dynamic programming problems that require selective answers. In this paper, we present three application examples of mode-directed tabling, namely, (1) hydraulic system planning, a dynamic programming problem, (2) the Viterbi algorithm in PRISM, a probabilistic logic reasoning and learning system, and (3) constraint checking in evaluating Answer Set Programs (ASP). For the Viterbi application, the feature of enabling a cardinality limit in a table mode declaration plays an important role. For a PRISM program and a set of data, the explanations may be too large to be completely stored and the cardinality limit allows for Viterbi inference based on a subset of explanations. The mode nt, which specifies an argument that can participate in the computation of a tabled predicate but is never tabled either in subgoal or answer tabling, is useful in constraint checking for the Hamilton cycle problem encoded as an ASP. These examples demonstrate the usefulness of mode-directed tabling.
Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this paper, we describe an efficient algorithm for computing the transitive closures of difference bo...
详细信息
ISBN:
(纸本)9783642142949
Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this paper, we describe an efficient algorithm for computing the transitive closures of difference bounds, octagonal and finite monoid Aline relations. On the theoretical side, this framework provides a common solution to the acceleration problem, for all these three classes of relations. In practice, according to our experiments, the new method performs up to four orders of magnitude better than the previous ones, making it a promising approach for the verification of integer programs.
In May 2010, the third IOI workshop took place in Schloss Dagstuhl, Germany. It was motivated by the discussions held at and after the panel session of 2009's IOI conference in Plovdiv. There, discussions focussed...
详细信息
We develop and apply unsupervised statistical topic models to identify functional components of source code and introduce new information-theoretic techniques for measuring and monitoring software complexity in the fo...
详细信息
ISBN:
(纸本)1891706268
We develop and apply unsupervised statistical topic models to identify functional components of source code and introduce new information-theoretic techniques for measuring and monitoring software complexity in the form of scattering and tangling entropies. This approach formalizes the basic scattering and tangling concepts of Aspect-Oriented programming by considering the distributions of topics over files and files over topics, and formulates project-level metrics for crosscutting. These proposed metrics, Area-Under-Scattering-Curve and Area-Under-Tangling-Curve provide a probabilistic basis for modeling facets of crosscutting in isolation or as components of more sophisticated complexity models. We demonstrate our approach through an empirical analysis of scattering and tangling of five well-known open source projects, in addition to studying the evolution of scattering and tangling for multiple versions of Eclipse and ArgoUML.
暂无评论