Global ETD Search

1	How Often do Experts Make Mistakes? Palix, Nicolas, Lawall, Julia L., Thomas, Gaël, Muller, Gilles January 2010 (has links) 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. History of pattern occurrences bug tracking Herodotos Coccinelle Data processing Computer science Metrics (D.4.8) Complexity measures Performance measures Process metrics (NEW) Product metrics (NEW) Software science** Language Constructs and Features (E.2) Abstract data types Classes and objects (NEW) Concurrent programming structures Constraints (NEW) Control structures Coroutines Data types and structures Dynamic storage management Frameworks (NEW) Inheritance (NEW) Input/output Modules, packages Patterns (NEW) Polymorphism (NEW) Procedures, functions, and subroutines Recursion
2	Malleability, obliviousness and aspects for broadcast service attachment Harrison, William January 2010 (has links) 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. service-oriented aspect-oriented programming language middleware concurrency Data processing Computer science Software Architectures (NEW) Data abstraction (NEW) Domain-specific architectures (NEW) Information hiding (NEW) Language Constructs and Features (E.2) Abstract data types Classes and objects (NEW) Concurrent programming structures Constraints (NEW) Control structures Coroutines Data types and structures Dynamic storage management Frameworks (NEW) Inheritance (NEW) Input/output Modules, packages Patterns (NEW) Polymorphism (NEW) Procedures, functions, and subroutines Recursion
3	AspectKE: Security aspects with program analysis for distributed systems Fan, Yang, Masuhara, Hidehiko, Aotani, Tomoyuki, Nielson, Flemming, Nielson, Hanne Riis* January 2010 (has links) 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. aspect oriented programming program analysis security policies distributed systems tuple spaces Data processing Computer science Language Constructs and Features (E.2) Abstract data types Classes and objects (NEW) Concurrent programming structures Constraints (NEW) Control structures Coroutines Data types and structures Dynamic storage management Frameworks (NEW) Inheritance (NEW) Input/output Modules, packages Patterns (NEW) Polymorphism (NEW) Procedures, functions, and subroutines Recursion Security and Protection (K.6.5) Access controls Authentication Cryptographic controls Information flow controls Security kernels Verification Algebraic approaches to semantics Denotational semantics Operational semantics Partial evaluation (NEW) Process models (NEW) Program analysis (NEW)

1

Page generated in 0.0856 seconds