@inproceedings{BandaGallagher2010,
  author    = {Banda, Gourinath and Gallagher, John P.},
  title     = {Constraint-based abstraction of a model checker for infinite state systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41516},
  year      = {2010},
  abstract  = {Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be verified. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.},
  language  = {en}
}
@inproceedings{PalixLawallThomasetal.2010,
  author    = {Palix, Nicolas and Lawall, Julia L. and Thomas, Ga{\"e}l and Muller, Gilles},
  title     = {How Often do Experts Make Mistakes?},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41327},
  year      = {2010},
  abstract  = {Large open-source software projects involve developers with a wide variety of backgrounds and expertise. Such software projects furthermore include many internal APIs that developers must understand and use properly. According to the intended purpose of these APIs, they are more or less frequently used, and used by developers with more or less expertise. In this paper, we study the impact of usage patterns and developer expertise on the rate of defects occurring in the use of internal APIs. For this preliminary study, we focus on memory management APIs in the Linux kernel, as the use of these has been shown to be highly error prone in previous work. We study defect rates and developer expertise, to consider e.g., whether widely used APIs are more defect prone because they are used by less experienced developers, or whether defects in widely used APIs are more likely to be fixed.},
  language  = {en}
}
@inproceedings{OPUS4-3948,
  title     = {Preface},
  editor    = {Adams, Bram and Haupt, Michael and Lohmann, Daniel},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41338},
  year      = {2010},
  abstract  = {Aspect-oriented programming, component models, and design patterns are modern and actively evolving techniques for improving the modularization of complex software. In particular, these techniques hold great promise for the development of "systems infrastructure" software, e.g., application servers, middleware, virtual machines, compilers, operating systems, and other software that provides general services for higher-level applications. The developers of infrastructure software are faced with increasing demands from application programmers needing higher-level support for application development. Meeting these demands requires careful use of software modularization techniques, since infrastructural concerns are notoriously hard to modularize. Aspects, components, and patterns provide very different means to deal with infrastructure software, but despite their differences, they have much in common. For instance, component models try to free the developer from the need to deal directly with services like security or transactions. These are primary examples of crosscutting concerns, and modularizing such concerns are the main target of aspect-oriented languages. Similarly, design patterns like Visitor and Interceptor facilitate the clean modularization of otherwise tangled concerns. Building on the ACP4IS meetings at AOSD 2002-2009, this workshop aims to provide a highly interactive forum for researchers and developers to discuss the application of and relationships between aspects, components, and patterns within modern infrastructure software. The goal is to put aspects, components, and patterns into a common reference frame and to build connections between the software engineering and systems communities.},
  language  = {en}
}
@inproceedings{BynensVanLanduytTruyenetal.2010,
  author    = {Bynens, Maarten and Van Landuyt, Dimitri and Truyen, Eddy and Joosen, Wouter},
  title     = {Towards reusable aspects: the callback mismatch problem},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41347},
  year      = {2010},
  abstract  = {Because software development is increasingly expensive and timeconsuming, software reuse gains importance. Aspect-oriented software development modularizes crosscutting concerns which enables their systematic reuse. Literature provides a number of AOP patterns and best practices for developing reusable aspects based on compelling examples for concerns like tracing, transactions and persistence. However, such best practices are lacking for systematically reusing invasive aspects. In this paper, we present the 'callback mismatch problem'. This problem arises in the context of abstraction mismatch, in which the aspect is required to issue a callback to the base application. As a consequence, the composition of invasive aspects is cumbersome to implement, difficult to maintain and impossible to reuse. We motivate this problem in a real-world example, show that it persists in the current state-of-the-art, and outline the need for advanced aspectual composition mechanisms to deal with this.},
  language  = {en}
}
@inproceedings{GoltzPieth2010,
  author    = {Goltz, Hans-Joachim and Pieth, Norbert},
  title     = {A tool for generating partition schedules of multiprocessor systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41556},
  year      = {2010},
  abstract  = {A deterministic cycle scheduling of partitions at the operating system level is supposed for a multiprocessor system. In this paper, we propose a tool for generating such schedules. We use constraint based programming and develop methods and concepts for a combined interactive and automatic partition scheduling system. This paper is also devoted to basic methods and techniques for modeling and solving this partition scheduling problem. Initial application of our partition scheduling tool has proved successful and demonstrated the suitability of the methods used.},
  language  = {en}
}
@inproceedings{Harrison2010,
  author    = {Harrison, William},
  title     = {Malleability, obliviousness and aspects for broadcast service attachment},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41389},
  year      = {2010},
  abstract  = {An important characteristic of Service-Oriented Architectures is that clients do not depend on the service implementation's internal assignment of methods to objects. It is perhaps the most important technical characteristic that differentiates them from more common object-oriented solutions. This characteristic makes clients and services malleable, allowing them to be rearranged at run-time as circumstances change. That improvement in malleability is impaired by requiring clients to direct service requests to particular services. Ideally, the clients are totally oblivious to the service structure, as they are to aspect structure in aspect-oriented software. Removing knowledge of a method implementation's location, whether in object or service, requires re-defining the boundary line between programming language and middleware, making clearer specification of dependence on protocols, and bringing the transaction-like concept of failure scopes into language semantics as well. This paper explores consequences and advantages of a transition from object-request brokering to service-request brokering, including the potential to improve our ability to write more parallel software.},
  language  = {en}
}
@inproceedings{Schrijvers2010,
  author    = {Schrijvers, Tom},
  title     = {Overview of the monadic constraint programming framework},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41411},
  year      = {2010},
  abstract  = {A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. The Monadic Constraint Programming framework gives a monadic definition of constraint programming where the solver is defined as a monad threaded through the monadic search tree. Search and search strategies can then be defined as firstclass objects that can themselves be built or extended by composable search transformers. Search transformers give a powerful and unifying approach to viewing search in constraint programming, and the resulting constraint programming system is first class and extremely flexible.},
  language  = {en}
}
@inproceedings{FanMasuharaAotanietal.2010,
  author    = {Fan, Yang and Masuhara, Hidehiko and Aotani, Tomoyuki and Nielson, Flemming and Nielson, Hanne Riis},
  title     = {AspectKE*: Security aspects with program analysis for distributed systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41369},
  year      = {2010},
  abstract  = {Enforcing security policies to distributed systems is difficult, in particular, when a system contains untrusted components. We designed AspectKE*, a distributed AOP language based on a tuple space, to tackle this issue. In AspectKE*, aspects can enforce access control policies that depend on future behavior of running processes. One of the key language features is the predicates and functions that extract results of static program analysis, which are useful for defining security aspects that have to know about future behavior of a program. AspectKE* also provides a novel variable binding mechanism for pointcuts, so that pointcuts can uniformly specify join points based on both static and dynamic information about the program. Our implementation strategy performs fundamental static analysis at load-time, so as to retain runtime overheads minimal. We implemented a compiler for AspectKE*, and demonstrate usefulness of AspectKE* through a security aspect for a distributed chat system.},
  language  = {en}
}
@inproceedings{HannousseArdourelDouence2010,
  author    = {Hannousse, Abdelhakim and Ardourel, Gilles and Douence, R{\´e}mi},
  title     = {Views for aspectualizing component models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41359},
  year      = {2010},
  abstract  = {Component based software development (CBSD) and aspectoriented software development (AOSD) are two complementary approaches. However, existing proposals for integrating aspects into component models are direct transposition of object-oriented AOSD techniques to components. In this article, we propose a new approach based on views. Our proposal introduces crosscutting components quite naturally and can be integrated into different component models.},
  language  = {en}
}
@inproceedings{HerreHummel2010,
  author    = {Herre, Heinrich and Hummel, Axel},
  title     = {Stationary generated models of generalized logic programs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41501},
  year      = {2010},
  abstract  = {The interest in extensions of the logic programming paradigm beyond the class of normal logic programs is motivated by the need of an adequate representation and processing of knowledge. One of the most difficult problems in this area is to find an adequate declarative semantics for logic programs. In the present paper a general preference criterion is proposed that selects the 'intended' partial models of generalized logic programs which is a conservative extension of the stationary semantics for normal logic programs of [Prz91]. The presented preference criterion defines a partial model of a generalized logic program as intended if it is generated by a stationary chain. It turns out that the stationary generated models coincide with the stationary models on the class of normal logic programs. The general wellfounded semantics of such a program is defined as the set-theoretical intersection of its stationary generated models. For normal logic programs the general wellfounded semantics equals the wellfounded semantics.},
  language  = {en}
}