#	Pagina
attuale pagina	/open-h2020/projects/212129/index.html

Opendata, web and dolomites

AV-SMP SIGNED

Algorithmic Verification of String Manipulating Programs

Total Cost €

EC-Contrib. €

Partnership

Views

AV-SMP project word cloud

Explore the words cloud of the AV-SMP project. It provides you a very rough idea of what is the project "AV-SMP" about.

modern manipulations attacks respect combination esp mistakes decidability speed security popularity verifying complexity permit yield site perform algorithms potentially cross technologies heavy web scripting javascript tool automatic serious termination xss malicious theoretical correctness variables central safety verification written client string semi solving python area performance meet tools transform virtually analysing detection integers breakthroughs fundamental powerful types constraint expressive strings substantially contributions guarantee proof vulnerabilities basic programming designing easily programs data grading breach tend domains good languages course

Project "AV-SMP" data sheet

The following table provides information about the project.

Coordinator	TECHNISCHE UNIVERSITAET KAISERSLAUTERN Organization address address: GOTTLIEB DAIMLER STRASSE city: KAISERSLAUTERN postcode: 67663 website: www.uni-kl.de contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.
Coordinator Country	Germany [DE]
Total cost	1˙496˙687 €
EC max contribution	1˙496˙687 € (100%)
Programme	1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
Code Call	ERC-2017-STG
Funding Scheme	ERC-STG
Starting year	2017
Duration (year-month-day)	from 2017-11-01 to 2022-10-31

Partnership

Take a look of project's partnership.

#	participants	country	role	EC contrib. [€]
1	TECHNISCHE UNIVERSITAET KAISERSLAUTERN TECHNISCHE UNIVERSITAET KAISERSLAUTERN Organization address address: GOTTLIEB DAIMLER STRASSE city: KAISERSLAUTERN postcode: 67663 website: www.uni-kl.de contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.	DE (KAISERSLAUTERN)	coordinator	1˙332˙075.00
2	THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD Organization address address: WELLINGTON SQUARE UNIVERSITY OFFICES city: OXFORD postcode: OX1 2JD website: www.ox.ac.uk contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.	UK (OXFORD)	participant	164˙612.00

Map

Project objective

String is among the most fundamental and commonly used data types in virtually all modern programming languages, especially with the rapidly growing popularity of scripting languages (e.g. JavaScript and Python). Programs written in such languages tend to perform heavy string manipulations, which are complex to reason about and could easily lead to programming mistakes. In some cases, such mistakes could have serious consequences, e.g., in the case of client-side web applications, cross-site scripting (XSS) attacks that could lead to a security breach by a malicious user.

The central objective of the proposed project is to develop novel verification algorithms for analysing the correctness (esp. with respect to safety and termination properties) of programs with string variables, and transform them into robust verification tools. To meet this key objective, we will make fundamental breakthroughs on both theoretical and tool implementation challenges. On the theoretical side, we address two important problems: (1) design expressive constraint languages over strings (in combination with other data types like integers) that permit decidability with good complexity, and (2) design generic semi-algorithms for verifying string programs that have strong theoretical performance guarantee. On the implementation side, we will address the challenging problem of designing novel implementation methods that can substantially speed up the basic string analysis procedures in practice. Finally, as a proof of concept, we will apply our technologies to two key application domains: (1) automatic detection of XSS vulnerabilities in web applications, and (2) automatic grading systems for a programming course.

The project will not only make fundamental theoretical contributions — potentially solving long-standing open problems in the area — but also yield powerful methods that can be used in various applications.

Publications

List of publications.
year	authors and title	journal	last update
2018	LukÃ¡Å¡ HolÃk, Petr JankÅ¯, Anthony W. Lin, Philipp RÃ¼mmer, TomÃ¡Å¡ Vojnar String constraints with concatenation and transducers solved efficiently published pages: 1-32, ISSN: 2475-1421, DOI:	Proceedings of the ACM on Programming Languages 2/POPL	2019-10-07
2019	Taolue Chen, Matthew Hague, Anthony W. Lin, Philipp RÃ¼mmer, Zhilin Wu Decision procedures for path feasibility of string-manipulating programs with complex operations published pages: 1-30, ISSN: 2475-1421, DOI: 10.1145/3290362	Proceedings of the ACM on Programming Languages 3/POPL	2019-10-07
2018	Taolue Chen, Yan Chen, Matthew Hague, Anthony W. Lin, Zhilin Wu What is decidable about string constraints with the ReplaceAll function published pages: 1-29, ISSN: 2475-1421, DOI:	Proceedings of the ACM on Programming Languages 2/POPL	2019-10-07

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "AV-SMP" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "AV-SMP" are provided by the European Opendata Portal: CORDIS opendata.