In this paper we propose a systematic strategy for migrating crosscutting concerns in existing object-oriented systems to aspect-oriented programming solutions. the proposed strategy consists of four steps: mining, ex...
详细信息
In this paper we propose a systematic strategy for migrating crosscutting concerns in existing object-oriented systems to aspect-oriented programming solutions. the proposed strategy consists of four steps: mining, exploration, documentation and refactoring of crosscutting concerns. We discuss in detail a new approach to refactoring to aspect-oriented programmingthat is fully integrated with our strategy, and apply the whole strategy to an object-oriented system, namely the JHotDraw framework. Moreover, we present a method to semi-automatically perform the aspect-introducing refactorings based on identified crosscutting concern sorts which is supported by a prototype tool called sair. We perform an exploratory case study in which we apply this tool on the same object-oriented system and compare its results withthe results of manual migration in order to assess the feasibility of automated aspect refactoring. Boththe refactoring tool sair and the results of the manual migration are made available as open-source, the latter providing the largest aspect-introducing refactoring available to date. We report on our experiences with conducting both case studies and reflect on the success and challenges of the migration process.
During the planning and optimization stages of industrial manufacturing work cells with robots, the engineer often faces an unmanageable amount of possible process alternatives. this is especially true for layout plan...
详细信息
ISBN:
(纸本)9789077381489
During the planning and optimization stages of industrial manufacturing work cells with robots, the engineer often faces an unmanageable amount of possible process alternatives. this is especially true for layout planning and robot pathprogramming with regard to reachability, collision behavior and minimum cycle times. In this paper, we present the automated variant simulation as a means to support the engineer in his decision process. the automated variant simulation allows the definition of variable parameters of a process, varies these automatically, simulates the modified process and evaluates the simulation results to find optimum parameters and thus the "best" process variant. We show the general idea of the automated variant simulation and describe its integration into a 3-D simulation system. Finally, we present a case study of a successful application in industry.
programming is taught as foundation module at the beginning of undergraduate studies and/or during foundation year. Learning introductory programming languages such as Pascal, Basic / C (procedural) and C++ / Java (ob...
详细信息
ISBN:
(纸本)9781605586595
programming is taught as foundation module at the beginning of undergraduate studies and/or during foundation year. Learning introductory programming languages such as Pascal, Basic / C (procedural) and C++ / Java (object oriented) requires learners to understand the underlying programming paradigm, syntax, logic and the structure. Learning to program is considered hard for novice learners and it is important to understand what makes learning program so difficult and how students learn. the prevailing focus on multimedia learning objects provides promising approach to create better knowledge transfer. this project aims to investigate: (a) students' perception in learning to program and the difficulties. (b) effectiveness of multimedia learning objects in learning introductory programming language in a face-to-face learning environment. Copyright 2009 ACM.
the proceedings contain 23 papers. the topics discussed include: building SMT-based software model checkers: an experience report;combining nonmonotonic knowledge bases with external sources;combining description logi...
ISBN:
(纸本)364204221X
the proceedings contain 23 papers. the topics discussed include: building SMT-based software model checkers: an experience report;combining nonmonotonic knowledge bases with external sources;combining description logics, description graphs, and rules;unification modulo homomorphic encryption;argument filterings and usable rules for simply typed dependency pairs;DL-Lite with temporalised concepts, rigid axioms and roles;axiomatization and completeness of lexicographic products of modal logics;taming the complexity of temporal epistemic reasoning;a declarative agent programming language based on action theories;combinations of theories for decidable fragments of first-order logic;improving coq propositional reasoning using a lazy CNF conversion scheme;efficient combination of decision procedures for MUS computation;and learning to integrate deduction and search in reasoning about quantified Boolean formulas.
Several learning systems based on Inverse Entailment (IE) have been proposed, some that compute single clause hypotheses, exemplified by Progol, and others that, produce multiple clauses in response to a single seed e...
详细信息
ISBN:
(纸本)9783642042379
Several learning systems based on Inverse Entailment (IE) have been proposed, some that compute single clause hypotheses, exemplified by Progol, and others that, produce multiple clauses in response to a single seed example. A common denominator of these systems, is a restricted hypothesis search space, within which each clause must individually explain some example E, or some member of an abductive explanation for E. this paper proposes a new IE approach, called Induction on Failure (IoF), that generalises existing Horn clause learning systems by allowing the computation of hypotheses within a larger search space, namely that of Connected theories. A proof procedure for IoF is proposed that generalises existing IE systems and also resolves Yamamoto's example. A prototype implementation is also described. Finally, a semantics is presented called Connected theory Generalisation, which is proved to extend Kernel Set Subsumption and to include hypotheses constructed within this new IoF approach.
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express more detailed circumstances of a particul...
详细信息
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express more detailed circumstances of a particular flow;they provide precise necessary conditions for information flow along a path or chop in a dependence graph. Ordinary boolean path conditions, however, cannot express temporal properties, e.g. that for a specific flow it is necessary that some condition holds, and later another specific condition holds. In this contribution, we introduce temporal path conditions, which extend ordinary path conditions by temporal operators in order to express temporal dependencies between conditions for a flow. We present motivating examples, generation and simplification rules, application of model checking to generate witnesses for a specific flow, and a case study. We prove the following soundness property: if a temporal path condition for a path is satisfiable, then the ordinary boolean path condition for the path is satisfiable. the converse does not hold, indicating that temporal path conditions are more precise.
this paper addresses the issue of guaranteeing the correctness of fault diagnosis mechanisms in multi-agent systems. We propose an automated approach to verifying the property of diagnosability by combining fault inje...
详细信息
ISBN:
(纸本)9780769538709
this paper addresses the issue of guaranteeing the correctness of fault diagnosis mechanisms in multi-agent systems. We propose an automated approach to verifying the property of diagnosability by combining fault injection with model checking. In particular we show how to reason about individual agent's and system wide knowledge of faults, which is essential for the agents to cooperate and coordinate to recover from them. the multi-agent system model checker MCMAS is used for verification and epistemic specifications are defined to specify that a system accurately diagnoses faults.
the proceedings contain 21 papers. the topics discussed include: usability issues in description logic knowledge base completion;the advent of formal diagrammatic reasoning systems;the logic of learning;time and logic...
ISBN:
(纸本)9783642018145
the proceedings contain 21 papers. the topics discussed include: usability issues in description logic knowledge base completion;the advent of formal diagrammatic reasoning systems;the logic of learning;time and logic: A.N. prior's formal analysis of temporal concepts;factor analysis of incidence data via novel decomposition of matrices;a unified hierarchy for functional dependencies, conditional functional dependencies and association rules;robust elements in rough set abstractions;some computational problems related to pseudo-intents;yet a faster algorithm for building the Hasse diagram of a concept lattice;context graphs-representing formal concepts by connected subgraphs;handling large formal context using BDD - perspectives and limitations;a novel approach to cell form;identifying ecological traits: a concrete FCA-based approach;and a concept lattice-based kernel for SVM text classification.
Withthe increasing speed and capacity of answer set solvers and showcase applications in a variety of fields, Answer Set programming (ASP) is maturing as a programming paradigm for declarative problem solving. Compre...
详细信息
Withthe increasing speed and capacity of answer set solvers and showcase applications in a variety of fields, Answer Set programming (ASP) is maturing as a programming paradigm for declarative problem solving. Comprehensive programming methodologies have been developed for procedural and object-oriented paradigms to assist programmers in developing their programs from the problem specification. In many cases, however it is not clear how, or even if, such methodologies can be applied to answer set programming. In this paper, we present a first and rather pragmatic methodology for ASP and illustrate our approach through the encoding of graphical puzzle.
We give a case study for a Satisfiability Modulo theories (SMT) solver usage in functional verification of a real world operating system. In particular, we present a view of the E-matching pattern annotations on quant...
详细信息
ISBN:
(纸本)9781605584843
We give a case study for a Satisfiability Modulo theories (SMT) solver usage in functional verification of a real world operating system. In particular, we present a view of the E-matching pattern annotations on quantified formulas as a kind of logicprogramming language, used to encode semantics of the programming language undergoing verification. We postulate a few encoding patterns to be benchmark problems for a possible E-matching alternative. We also describe features required from the SMT solver in deductive software verification scenarios. Copyright 2009 ACM.
暂无评论