Skip to main content

Verification and Language Theory

Project description

Verification and language theory

Limitations to a programming language can help boost the production of more readable and maintainable software. A limited fragment associated with the semantic domain can introduce more efficient algorithms for verification and analysis beginning with the characterisation of the semantic domain. The EU-funded VERLAN project will review the semantic domains of fragments of programming languages under a formal language theory perspective. VERLAN will study the three mathematical frameworks to categorise formal languages and derive new algorithms for three fundamental problems in program verification – refactoring, equivalence checking, and learning. With experience in program verification and formal languages, the researcher will research at the Institute for Logic, Language, and Computation (ILLC).


Net EU contribution
€ 175 572,48
Spui 21
1012WX Amsterdam

See on map

West-Nederland Noord-Holland Groot-Amsterdam
Activity type
Higher or Secondary Education Establishments
Other funding
€ 0,00