This book constitutes the refereed proceedings of the 12th International Conference on Software Reuse, ICSR 2011, held in Pohang, South Korea, in June 2011. The 16 revised full papers were carefully reviewed and selected from 43 submissions. They are presented together with one keynote, three workshop papers, a doctoral symposium report and two tutorials. Topics of interest are domain analysis and modeling; asset search and retrieval; architecture-centric approaches to reuse; component-based reuse; COTS-based development; generator-based techniques; domain-specific languages; testing in the context of software reuse; aspect-oriented techniques; model-driven development; reuse of non-code artifacts; reengineering for reuse; software product line techniques; quality-aspects of reuse; economic models of reuse; benefit and risk analysis, scoping; legal and managerial aspects of reuse; transition to software reuse; industrial experience with reuse; light-weight approaches; software evolution and reuse.

Ada is the only ISO-standard, object-oriented, concurrent, real-time programming language. It is intended for use in large, long-lived applications where reliability and efficiency are essential, particularly real-time and embedded systems. In this book, Alan Burns and Andy Wellings give a thorough, self-contained account of how the Ada tasking model can be used to construct a wide range of concurrent and real-time systems. This is the only book that focuses on an in-depth discussion of the Ada tasking model. Following on from the authors' earlier title Concurrency in Ada, this book brings the discussion up to date to include the new Ada 2005 language and the recent advances in real-time programming techniques. It will be of value to software professionals and advanced students of programming alike: indeed every Ada programmer will find it essential reading and a primary reference work that will sit alongside the language reference manual.

This volume, the 8th in the Transactions on Aspect-Oriented Software Development series, contains two regular submissions and a special section, consisting of five papers, on the industrial applications of aspect technology. The regular papers describe a framework for constructing aspect weavers, and patterns for reusable aspects. The special section begins with an invited contribution on how AspectJ is making its way from an exciting new hype topic to a valuable technology in enterprise computing. The remaining four papers each cover different industrial applications of aspect technology, which include a telecommunication platform, a framework for embedding user assistance in independently developed applications, a platform for digital publishing, and a framework for program code analysis and manipulation.

This book constitutes the refereed proceedings of the 4th International Conference, ICMT 2011, held in Zurich, Switzerland in June 2011. The 14 revised full papers were carefully revised and selected from 51 submissions. The scope of the contributions ranges from theoretical and methodological topics to implementation issues and applications. Topics addressed are such as transformation paradigms and languages, transformation algorithms and strategies, implementation and tools, as well as applications and case studies.

This book constitutes the thoroughly refereed post-workshop proceedings of the 8th International Workshop on Declarative Agent Languages and Technologies, DALT 2010, held in Toronto, Canada, on May 10, 2010, as a satellite workshop of the 9th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2010. The 7 revised full papers presented together with 4 invited lectures were carefully selected during two rounds of reviewing and improvement from 24 initial submissions. DALT aims to make formal methods and declarative technologies and approaches available to and understood by a broader segment of the multi-agent research community; the papers are organized in topical sections on BDI rational agents, communication, coordination and negotiation, as well as social aspects and control systems.

Abu?erover?owoccurswheninputiswrittenintoamemorybu?erthatisnot large enough to hold the input. Bu?er over?ows may allow a malicious person to gain control over a computer system in that a crafted input can trick the defectiveprogramintoexecutingcodethatisencodedintheinputitself.They are recognised as one of the most widespread forms of security vulnerability, and many workarounds, including new processor features, have been proposed to contain the threat. This book describes a static analysis that aims to prove the absence of bu?er over?ows in C programs. The analysis is conservative in the sense that it locates every possible over?ow. Furthermore, it is fully automatic in that it requires no user annotations in the input program. Thekeyideaoftheanalysisistoinferasymbolicstateforeachp- gram point that describes the possible variable valuations that can arise at that point. The program is correct if the inferred values for array indices and pointer o?sets lie within the bounds of the accessed bu?er. The symbolic state consists of a ?nite set of linear inequalities whose feasible points induce a convex polyhedron that represents an approximation to possible variable valuations. The book formally describes how program operations are mapped to operations on polyhedra and details how to limit the analysis to those p- tionsofstructuresandarraysthatarerelevantforveri?cation.Withrespectto operations on string bu?ers, we demonstrate how to analyse C strings whose length is determined by anul character within the string.

Flex is the quickest and most effective technology for the creation of Rich Internet Applications for the Web. Its extensive library of components and totally customizable framework, combined with the ubiquity of Flash Player, has guaranteed its success.

The ecosystem of products that rotate around Flex 2 and Flex 3 is really broad. Flex Builder, Flex SDK, and Charting Components are all essential parts of the technology that fit the different requirements of web development.

This enormous set of possibilities can easily lead to informationoverload for developers like you. There's just too much to learn and too many potential places to go when you hit a brick wall. Wouldn't it be nice to have a library of solutions to solve these problems quickly and easily?

This book provides just that, with more than 100 solutions to common problems in one handy volume.

Flex Solutions: Essential Techniques for Flex 2 and Flex 3 Developers faces problems and provides solutions that can be applied to any project, from the most simple to the most complex. The solutions range from customizing Flex components with ActionScript 3.0, using the data models and the ActionScript classes as Value objects, validating and formatting data, using RPC classes to access remote data, to optimizing data-exchange performance using AMF3.

Solutions are also provided for enhancing the security of Flex applications, and techniques are offered for optimizing the actual work environment by increasing the performance of Flex Builder, adding video content, and creating an AIR project to bring your web application onto the desktop.

If you want to learn about and start to develop rich Internet applications in a short time, being immediately productive and mastering the Flex development techniques, Flex Solutions: Essential Techniques for Flex 2 and 3 Developers is the book you need.Discover real-world solutions for everyday Flex development, saving hours of development timeLearn how to customize and extend the Flex Components Model and design and program the look and feel of your Flex applicationsLearn best practices and tips from a Flex expert for structuring the architecture of Flex applicationsUse the Flex Remote Procedure Classes to connect to remote data with HTTPServices and the Java Platform, PHP, ColdFusion, WebServices, and RemoteObjectUseFlex 3 features such as the AdvancedDataGrid component and the Charting Enhancements featurePort your rich Internet applications onto the desktop with Adobe AIR What you'll learn Tips on using Flex components How to validate and format data How to manage complex data Filtering, sorting and using cursors on data with collection classes How to consume Web Services using RPC components How to display data using list-based controls How to effectively compile and deploy Flex applications How to customize the look and feel of your applications How to make your applications more secure How to become more efficient in using the Flex Builder IDE Unique tricks such as calculating memory usage, making your Flex application into an active desktop, and customizing states How to use the ColdFusion Extensions for Flex Builder How to interface your Flex applications with server-side code written in PHP, Java, Rails, and ColdFusion Working with Flex in enterprise enviroment using the Flex Data Services, Java Remote Object and AMFPHP Who this book is for

This book is for any Flex 2 or Flex 3 developer who is comfortable with the basics and wants to take their knowledge further with quick fire solutions to common problems. Please note that some of the solutions contained in this book require the Flex Builder 3 Professional release of the software.

Service-Oriented Computing is a paradigm for developing and providing software that can address many IT challenges, ranging from integrating legacy systems to building new, massively distributed, interoperable, evaluable systems and applications. The widespread use of SOC demonstrates the practical benefits of this approach. Furthermore it raises the standard for reliability, security, and performance for IT providers, system integrators, and software developers. This book documents the main results of Sensoria, an Integrated Project funded by the European Commission in the period 2005-2010. The book presents, as Sensoria's essence, a novel, coherent, and comprehensive approach to the design, formal analysis, automated deployment, and reengineering of service-oriented applications. Following a motivating introduction, the 32 chapters are organized in the following topical parts: modeling in service-oriented architectures; calculi for service-oriented computing; negotiation, planning, and reconfiguration; qualitative analysis techniques for SOC; quantitative analysis techniques for SOC; model-driven development and reverse engineering for service-oriented systems; and case studies and patterns.

This book constitutes the refereed proceedings of the 14th International Conference on Foundations of Software Science and computational Structures, FOSSACS 2011, held in Saarbrucken, Germany, March 26-April 3, 2011, as part of ETAPS 2011, the European Joint Conferences on Theory and Practice of Software. The 30 revised full papers presented together with one full-paper length invited talk were carefully reviewed and selected from 100 submissions. The papers are organized in topical sections on coalgebra and computability, type theory, process calculi, automata theory, semantics, binding, security, and program analysis."

This book constitutes the refereed proceedings of the 17th International Working Conference on Requirements Engineering: Foundation for Software Quality, REFSQ 2011, held in Essen, Germany, in March 2011. The 10 revised full papers and the 9 short papers presented were carefully reviewed and selected from 59 submissions. The papers are organized in seven topical sections on security and sustainability; process improvement and requirements in context; elicitation; models; services; embedded and real-time systems; and prioritization and traceability.

This book constitutes the thoroughly refereed post-proceedings of the 14th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2009, held in Barcelona, Spain, in June 2009. The 9 revised full papers presented were carefully reviewed and selected for inclusion in this post-proceedings. The papers in this volume present original research results and applications of constraint solving and constraint logic programming in several domains. Among the issues addressed are solving argumentation frameworks, software consistency, modeling languages, static design routing, dynamic constraint satisfaction, and constraint-based modeling.

This book constitutes the refereed proceedings of the Third International Symposium on NASA Formal Methods, NFM 2011, held in Pasadena, CA, USA, in April 2011.
The 26 revised full papers presented together with 12 tool papers, 3 invited talks, and 2 invited tutorials were carefully reviewed and selected from 141 submissions. The topics covered by NFM 2011 included but were not limited to: theorem proving, logic model checking, automated testing and simulation, model-based engineering, real-time and stochastic systems, SAT and SMT solvers, symbolic execution, abstraction and abstraction refinement, compositional verification techniques; static and dynamic analysis techniques, fault protection, cyber security, specification formalisms, requirements analysis, and applications of formal techniques.

This book constitutes the thoroughly refereed post-proceedings of the Third International Conference on Software Language Engineering, SLE 2010, held in Eindhoven, The Netherlands, in October 2010. The 24 papers presented were carefully reviewed and selected from 79 submissions. The book also contains the abstracts of two invited talks. The papers are grouped in topical sections on grammarware, metamodeling, evolution, programming, and domain-specific languages. The short papers and demos included deal with modeling and transformations and translations.

This book constitutes the thoroughly refereed post-conference proceedings of the 13th Brazilian Symposium on Formal Methods, SBMF 2010, held in Natal, Brazil, in November 2010. The 18 revised full papers were carefully reviewed and selected from 55 submissions. The papers presented cover a broad range of foundational and methodological issues in formal methods for the design and analysis of software and hardware systems as well as applications in various domains.

This book constitutes the thoroughly refereed post-proceedings of the 23rd International Workshop on Languages and Compilers for Parallel Computing, LCPC 2010, held in Houston, TX, USA, in October 2010. The 18 revised full papers presented were carefully reviewed and selected from 47 submissions. The scope of the workshop spans foundational results and practical experience, and targets all classes of parallel platforms including concurrent, multithreaded, multicore, accelerated, multiprocessor, and cluster systems

Mastering the development of .NET 4.0 applications in C# is less about knowing the Visual C# 2010 language and more about knowing how to use the functionality of the .NET framework class library most effectively. Visual C# 2010 Recipes explores the breadth of the .NET Framework class library and provides specific solutions to common and interesting programming problems. Each recipe is presented in a succinct problem/solution format and is accompanied by a working code sample to help you understand the concept and quickly apply it.

When you are facing a Visual C# 2010 problem, this book likely contains a recipeprovidingthe solutionor at least points you in the right direction. Even if you are simply looking to broaden your knowledge of the .NET framework class library, Visual C# 2010 Recipes is the perfect resource to assist you.

This is an updated reference for .NET 4.0 programmers. All code samples come as stand-alone Visual Studio 2010 solutions for your convenience. What you'll learn Clear, concise answers to myriad problems that occur during day-to-day C# 2010 development How to write code according to Microsoft's best practice guidelines Answers to questions covering everything from workflow to XML processing Who this book is for

While there are few developers who do not stand to learn something from this book's concise, solution-oriented format, it is primarily aimed at emerging software professionals taking their first steps into the IT marketplace. These newly qualified and relatively inexperienced developers will gain the most from the book's comprehensive content and fast-access design, which is aimed at helping them cope with the problems and pitfalls that regularly occur when learning a new technology. Table of Contents Application Development Data Manipulation Application Domains, Reflection, and Metadata Threads, Processes, and Synchronization Files, Directories, and I/O XML Processing Windows Forms Graphics, Multimedia, and Printing Database Access Networking Security and Cryptography Unmanaged Code Interoperability Commonly Used Interfaces and Patterns Windows Integration Parallel Programming Using LINQ Windows Presentation Foundation

This book constitutes the thoroughly refereed post proceedings of the 5th International Haifa Verification Conference, HVC 2009, held in Haifa, Israel in October 2009. The 11 revised full papers presented together with four abstracts of invited lectures were carefully reviewed and selected from 23 submissions. The papers address all current issues, challenges and future directions of verification for hardware, software, and hybrid systems and present academic research in the verification of systems, generally divided into two paradigms - formal verification and dynamic verification (testing).

Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e. deduction (in contrast with model-theoretic approaches, deductive methods can be automated to some extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages.

Computer-Aided Reasoning: ACL2 Case Studies illustrates how the computer-aided reasoning system ACL2 can be used in productive and innovative ways to design, build, and maintain hardware and software systems. Included here are technical papers written by twenty-one contributors that report on self-contained case studies, some of which are sanitized industrial projects. The papers deal with a wide variety of ideas, including floating-point arithmetic, microprocessor simulation, model checking, symbolic trajectory evaluation, compilation, proof checking, real analysis, and several others.
Computer-Aided Reasoning: ACL2 Case Studies is meant for two audiences: those looking for innovative ways to design, build, and maintain hardware and software systems faster and more reliably, and those wishing to learn how to do this. The former audience includes project managers and students in survey-oriented courses. The latter audience includes students and professionals pursuing rigorous approaches to hardware and software engineering or formal methods. Computer-Aided Reasoning: ACL2 Case Studies can be used in graduate and upper-division undergraduate courses on Software Engineering, Formal Methods, Hardware Design, Theory of Computation, Artificial Intelligence, and Automated Reasoning.
The book is divided into two parts. Part I begins with a discussion of the effort involved in using ACL2. It also contains a brief introduction to the ACL2 logic and its mechanization, which is intended to give the reader sufficient background to read the case studies. A more thorough, textbook introduction to ACL2 may be found in the companion book, Computer-Aided Reasoning: An Approach.
The heart of the book is Part II, where the case studies are presented. The case studies contain exercises whose solutions are on the Web. In addition, the complete ACL2 scripts necessary to formalize the models and prove all the properties discussed are on the Web. For example, when we say that one of the case studies formalizes a floating-point multiplier and proves it correct, we mean that not only can you read an English description of the model and how it was proved correct, but you can obtain the entire formal content of the project and replay the proofs, if you wish, with your copy of ACL2.
ACL2 may be obtained from its home page. The results reported in each case study, as ACL2 input scripts, as well as exercise solutions for both books, are available from this page.

Written by the members of the IFIP Working Group 2.3 (Programming Methodology) this text constitutes an exciting reference on the front-line of research activity in programming methodology. The range of subjects reflects the current interests of the members, and will offer insightful and controversial opinions on modern programming methods and practice. The material is arranged in thematic sections, each one introduced by a problem which epitomizes the spirit of that topic. The exemplary problem will encourage vigorous discussion and will form the basis for an introduction/tutorial for its section.

Extensive research and development has produce mutation tools for languages such as Fortran, Ada, C, and IDL; empirical evaluations comparing mutation with other test adequacy criteria; empirical evidence and theoretical justification for the coupling effect; and techniques for speeding up mutation testing using various types of high performance architectures. Mutation has received the attention of software developers and testers in such diverse areas as network protocols and nuclear simulation. Mutation Testing for the New Century brings together cutting edge research results in mutation testing from a wide range of researchers. This book provides answers to key questions related to mutation and raises questions yet to be answered. It is an excellent resource for researchers, practitioners, and students of software engineering.

As information technologies become increasingly distributed and accessible to larger number of people and as commercial and government organizations are challenged to scale their applications and services to larger market shares, while reducing costs, there is demand for software methodologies and appli- tions to provide the following features: Richer application end-to-end functionality; Reduction of human involvement in the design and deployment of the software; Flexibility of software behaviour; and Reuse and composition of existing software applications and systems in novel or adaptive ways. When designing new distributed software systems, the above broad requi- ments and their translation into implementations are typically addressed by partial complementarities and overlapping technologies and this situation gives rise to significant software engineering challenges. Some of the challenges that may arise are: determining the components that the distributed applications should contain, organizing the application components, and determining the assumptions that one needs to make in order to implement distributed scalable and flexible applications, etc.

This work is Volume II of a two-volume monograph on the theory of deterministic parsing of context-free grammars. Volume I, "Languages and Parsing" (Chapters 1 to 5), was an introduction to the basic concepts of formal language theory and context-free parsing. Volume II (Chapters 6 to 10) contains a thorough treat ment of the theory of the two most important deterministic parsing methods: LR(k) and LL(k) parsing. Volume II is a continuation of Volume I; together these two volumes form an integrated work, with chapters, theorems, lemmas, etc. numbered consecutively. Volume II begins with Chapter 6 in which the classical con structions pertaining to LR(k) parsing are presented. These include the canonical LR(k) parser, and its reduced variants such as the LALR(k) parser and the SLR(k) parser. The grammarclasses for which these parsers are deterministic are called LR(k) grammars, LALR(k) grammars and SLR(k) grammars; properties of these grammars are also investigated in Chapter 6. A great deal of attention is paid to the rigorous development of the theory: detailed mathematical proofs are provided for most of the results presented."

The text contains a detailed and current presentation of the program analyses and transformations that extract the flow of data in computer memory systems. The emphasis is on a framework for the optimization of code for imperative programs and greater computer systems efficiency. In addition, the author shows that correctness of program transformations is guaranteed by the conservation of data flow. Professionals and researchers in software engineering, computer engineering, program design analysis, and compiler design will benefit from its presentation of data-flow methods and memory optimization of compilers.