CORTST-PROGRAMS

Testing and Correcting Programs with Applications to Codes

Coordinatore	BAR ILAN UNIVERSITY    more  Organization address address: BAR ILAN UNIVERSITY CAMPUS city: RAMAT GAN postcode: 52900 contact info Titolo: Ms. Nome: Estelle Cognome: Waise Email: send email Telefono: 97235317439 Fax: 97236353277
Nazionalità Coordinatore	Israel [IL]
Totale costo	100˙000 €
EC contributo	100˙000 €
Programma	FP7-PEOPLE Specific programme "People" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013)
Code Call	FP7-PEOPLE-2009-RG
Funding Scheme	MC-IRG
Anno di inizio	2011
Periodo (anno-mese-giorno)	2011-05-01   -   2015-09-21

 Partecipanti

#	participant	country	role	EC contrib. [€]
1	BAR ILAN UNIVERSITY  Organization address address: BAR ILAN UNIVERSITY CAMPUS city: RAMAT GAN postcode: 52900 contact info Titolo: Ms. Nome: Estelle Cognome: Waise Email: send email Telefono: 97235317439 Fax: 97236353277	IL (RAMAT GAN)	coordinator	100˙000.00

Mappa

 Word cloud

Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.

 Obiettivo del progetto (Objective)

'One of the main challenges of software engineering is verifying the correctness of software. In this proposal we focus on correctness of the code per input rather than full program verification. This methodology associates with every function to be computed a new piece of code called a checker, which given any possibly buggy program for the function and an input, “checks” whether the program on this input computes the function correctly. We further aim on correcting buggy programs using self-testers and self-correctors. A self-corrector that is given a potentially buggy program which is guaranteed to compute the function correctly on a random input, “corrects” the program on any given input. A self-tester tests whether a program is correct on a random input. The focus of the achievements in the field has been the design of efficient checkers (and self correcters/self testers) for *specific* efficiently computable functions exploiting either their algebraic or combinatorial properties. In recent works we have demonstrated relation between highly symmetric error correcting codes and testing and correcting. Moreover we managed to design checkers for functions characterized by their complexity. In light of the this new body of work we suggest to revisit the checking and correcting methodology, emphasizing a general error correcting approach and complexity theoretic approach, rather than a function specific approach.'

Introduzione (Teaser)

EU-funded scientists are offering new insights into superfast testing and correcting of functions.