Summary-Based Inter-Procedural Analysis via Modular Trace Refinement

We propose a generalisation of trace refinement for the verification of inter-procedural programs. Our method is a top-down modular, summary-based approach, and analyses inter-procedural programs by building function summaries on-demand and improving the summaries each time a function is analysed. Our method is sound, and complete relative to the existence of a modular Hoare proof for a non-recursive program. We have implemented a prototype analyser that demonstrates the main features of our approach and yields promising results

Program Verification with Separation Logic

International audienceSeparation Logic is a framework for the development of modular program analyses for sequential, inter-procedural and concurrent programs. The first part of the paper introduces Separation Logic first from a historical, then from a program verification perspective. Because program verification eventually boils down to deciding logical queries such as the validity of verification conditions, the second part is dedicated to a survey of decision procedures for Separation Logic, that stem from either SMT, proof theory or automata theory. Incidentally we address issues related to decidability and computational complexity of such problems, in order to expose certain sources of intractability

Improving the Delivery of Key Work Supports: Policy & Practice Opportunities at a Critical Moment

Examines the consequences of a lack of coordination and seamless service delivery across support programs. Outlines policy, procedural, and data utilization options and best practices to expedite receipt of benefits across programs, as well as challenges

The Necessity for Non-Challenge Visits

YesIn the discussions that have taken place over the past six years since the establishment by the Third Review Conference1 in 1991 of the Ad Hoc Group of Governmental Experts,known as VEREX, to identify and examine potential verification measures from a scientific and technical viewpoint, there has been an increasing debate about the role of non-challenge visits in a regime for a strengthened Biological and Toxin Weapons Convention (BTWC). The arguments as to why on-site investigations are an essential and central element to such a strengthened regime were addressed in the Briefing Paper issued2 in July 1997. In this Briefing Paper, the necessity for non-challenge visits is addressed drawing upon the previous VEREX, Ad Hoc Group (AHG), Chemical Weapons Convention (CWC) and United Nations Special Commission (UNSCOM) experience. The advantages and disadvantages of a regime containing non-challenge visits are considered and the conclusion is reached that the advantages far outweigh the disadvantages and that non-challenge visits are an important element which could contribute significantly to the effectiveness of a future legally binding instrument to strengthen the BTWC

Mutation testing on an object-oriented framework: An experience report

This is the preprint version of the article - Copyright @ 2011 ElsevierContext The increasing presence of Object-Oriented (OO) programs in industrial systems is progressively drawing the attention of mutation researchers toward this paradigm. However, while the number of research contributions in this topic is plentiful, the number of empirical results is still marginal and mostly provided by researchers rather than practitioners. Objective This article reports our experience using mutation testing to measure the effectiveness of an automated test data generator from a user perspective. Method In our study, we applied both traditional and class-level mutation operators to FaMa, an open source Java framework currently being used for research and commercial purposes. We also compared and contrasted our results with the data obtained from some motivating faults found in the literature and two real tools for the analysis of feature models, FaMa and SPLOT. Results Our results are summarized in a number of lessons learned supporting previous isolated results as well as new findings that hopefully will motivate further research in the field. Conclusion We conclude that mutation testing is an effective and affordable technique to measure the effectiveness of test mechanisms in OO systems. We found, however, several practical limitations in current tool support that should be addressed to facilitate the work of testers. We also missed specific techniques and tools to apply mutation testing at the system level.This work has been partially supported by the European Commission (FEDER) and Spanish Government under CICYT Project SETI (TIN2009-07366) and the Andalusian Government Projects ISABEL (TIC-2533) and THEOS (TIC-5906)