Search

We introduce Bug-Injector, a system that automatically creates benchmarks for customized evaluation of static analysis tools. We share a benchmark generated using Bug-Injector and illustrate its efficacy by using it to evaluate the recall of two leading open-source static analysis tools: Clang Static Analyzer and Infer. Bug-Injector works by inserting bugs based on bug templates into real-world host programs. It runs tests on the host program to collect dynamic traces, searches the traces for a point where the state satisfies the preconditions for some bug template, then modifies the host program to inject a bug based on that template. Injected bugs are used as test cases in a static analysis tool evaluation benchmark. Every test case is accompanied by a program input that exercises the injected bug. We have identified a broad range of requirements and desiderata for bug benchmarks; our approach generates on-demand test benchmarks that meet these requirements. It also allows us to create customized benchmarks suitable for evaluating tools for a specific use case (e.g., a given codebase and set of bug types). Our experimental evaluation demonstrates the suitability of our generated benchmark for evaluating static bug-detection tools and for comparing the performance of different tools.

In systems with hard real-time constraints, it is necessary to compute upper bounds on the worst-case execution time (WCET) of programs; the closer the bound to the real WCET, the better. This is especially the case of synchronous reactive control loops with a fixed clock; the WCET of the loop body must not exceed the clock period. We compute the WCET (or at least a close upper bound thereof) as the solution of an optimization modulo theory problem that takes into account the semantics of the program, in contrast to other methods that compute the longest path whether or not it is feasible according to these semantics. Optimization modulo theory extends satisfiability modulo theory (SMT) to maximization problems. Immediate encodings of WCET problems into SMT yield formulas intractable for all current production-grade solvers; this is inherent to the DPLL(T) approach to SMT implemented in these solvers. By conjoining some appropriate "cuts" to these formulas, we considerably reduce the computation time of the SMT-solver. We experimented our approach on a variety of control programs, using the OTAWA analyzer both as baseline and as underlying microarchitectural analysis for our analysis, and show notable improvement on the WCET bound on a variety of benchmarks and control programs., Comment: ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2014, Edimbourg : United Kingdom (2014)

interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and sparse representations of paths and sets of paths avoid this pitfall. We improve previously proposed techniques for guided static analysis and the generation of disjunctive invariants by combining them with techniques for succinct representations of paths and symbolic representations for transitions based on static single assignment. Because of the non-monotonicity of the results of abstract interpretation with widening operators, it is difficult to conclude that some abstraction is more precise than another based on theoretical local precision results. We thus conducted extensive comparisons between our new techniques and previous ones, on a variety of open-source packages., Comment: Static analysis symposium (SAS), Deauville : France (2012)

We describe the design and the implementation of PAGAI, a new static analyzer working over the LLVM compiler infrastructure, which computes inductive invariants on the numerical variables of the analyzed program. PAGAI implements various state-of-the-art algorithms combining abstract interpretation and decision procedures (SMT-solving), focusing on distinction of paths inside the control flow graph while avoiding systematic exponential enumerations. It is parametric in the abstract domain in use, the iteration algorithm, and the decision procedure. We compared the time and precision of various combinations of analysis algorithms and abstract domains, with extensive experiments both on personal benchmarks and widely available GNU programs., Comment: Tools for Automatic Program AnalysiS (TAPAS 2012), Deauville : France (2012)

Contient une table des matières, Avec mode texte

Contient une table des matières, Avec mode texte

Etching for trade card of Maison Ancel-Chapron selling corsets. The etching depicts a woman sitting down with cherubs in front of her holding a corset. The business was located on Rue des Pyramides.

Contient une table des matières, Avec mode texte

RésuméQuelle place pour la fonction information-documentation dans les grandes entreprises françaises ? Pour la troisième fois en une quinzaine d’années, le cabinet Histen-Riller a enquêté pour connaître les besoins, attentes et perceptions des grands organismes en la matière. Et les résultats ne sont pas univoques. Heureusement !, Change: gradual and brutalWhat is the place the place of information professionals in large French companies? The Histen Riller consulting firm undertook a survey to identify the specific needs, expectations and perceptions of large companies. Fortunately the results are not unequivocal!, ZusammenfassungWelchen Platz belegt die Funktion IuD in großen französischen Unternehmen? Die Unternehmensberatung Histen-Riller hat die Bedürfnisse, Erwartungen und Wahrnehmungen der großen Einrichtungen zu dem Thema erfragt. Und die Ergebnisse sind nicht eindeutig. Zum Glück!, Resumen¿Cuál es el lugar de la función de la ID en las grandes empresas francesas? El gabinete Histen-Riller ha realizado una encuesta para conocer las necesidades, aspiraciones y percepciones de los grandes organismos. Y los resultados no son unívocos.