Publication

Parallel symbolic execution for automated real-world software testing

Publications associées (65)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Fast black-box testing of system recovery code

George Candea, Radu Banabic

Fault injection-a key technique for testing the robustness of software systems-ends up rarely being used in practice, because it is labor-intensive and one needs to choose between performing random injections (which leads to poor coverage and low represent ...

2012

Hycon2 Benchmark: Power Network System

Giancarlo Ferrari Trecate

As a benchmark exercise for testing software and methods developed in Hycon2 for decen- tralized and distributed control, we address the problem of designing the Automatic Genera- tion Control (AGC) layer in power network systems. In particular, we present ...

2012

In Vitro Activities of the New Antitubercular Agents PA-824 and BTZ043 against Nocardia brasiliensis

Stewart Cole

The in vitro activity of PA-824 and BTZ043 against 30 Nocardia brasiliensis isolates was tested. The MIC50 and MIC90 values for PA-824 were both > 64 mu g/ml. The same values for BTZ043 were 0.125 and 0.250 mu g/ml. Given the MIC values for benzothiazinone ...

2012

Energy-Efficient Continuous Activity Recognition on Mobile Phones: An Activity-Adaptive Approach

Karl Aberer, Zhixian Yan, Dipanjan Chakraborty

Power consumption on mobile phones is a painful obstacle towards adoption of continuous sensing driven applications, e.g., continuously inferring individual’s locomotive activities (such as ‘sit’, ‘stand’ or ‘walk’) using the embedded accelerometer sensor. ...

Ieee2012

Exterminating Bugs via Collective Information Recycling

George Candea

End-user software is executed billions of times daily, but the corresponding execution details (“by-products”) are discarded. We hypothesize that, if suitably captured and aggregated, these by-products could substantially speed up the process of testing pr ...

2011

Efficient Testing of Recovery Code Using Fault Injection

George Candea, Paul Dan Marinescu

A critical part of developing a reliable software system is testing its recovery code. This code is traditionally difficult to test in the lab, and, in the field, it rarely gets to run; yet, when it does run, it must execute flawlessly in order to recover ...

2011

Debugging by lastChange

Claude Petitpierre, Salman Mirghasemi

Developers often seek the origins of wrong values they see in their debugger. Their search must be backwards in time: the code causing the wrong value executed before the wrong value appeared. Searching with breakpoint- or log- based debuggers demands pers ...

2011

Rate distortion analysis in a disparity compensated scheme

Pascal Frossard, Thomas Maugey

This paper addresses the problem of rate distortion analysis in the context of multi-view image coding, where images are predicted via disparity compensation based on depth map. We first present an an- alytical model for the variance of the residual error ...

2011

Automated Software Testing as a Service (TaaS)

George Candea, Cristian Zamfir, Stefan Bucur

This paper makes the case for TaaS - automated software testing as a cloud-based service. We present three kinds of TaaS: (1) a public certification service, akin to Underwriters Labs, that independently assesses the reliability, safety, and security of so ...

2010

Extensible Transactional Memory Testbed

Vincent Gramoli, Pascal Felber

Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradigm operated a complexity shift from the application programming to the TM prog ...

2010