On module-based abstraction and repair of behavioral programs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The number of states a program has tends to grow exponentially in the size of the code. This phenomenon, known as state explosion, hinders the verification and repair of large programs. A key technique for coping with state explosion is using abstractions, where one substitutes a program's state graph with smaller over-approximations thereof. We show how module-based abstraction-refinement strategies can be applied to the verification of programs written in the recently proposed framework of Behavioral Programming. Further, we demonstrate how - by using a sought-after repair as a means of refining existing abstractions - these techniques can improve the scalability of existing program repair algorithms. Our findings are supported by a proof-of-concept tool.

Original languageAmerican English
Title of host publicationLogic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR 2013, Proceedings
Pages518-535
Number of pages18
DOIs
StatePublished - 2013
Externally publishedYes
Event19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2013 - Stellenbosch, South Africa
Duration: 14 Dec 201319 Dec 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8312 LNCS

Conference

Conference19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2013
Country/TerritorySouth Africa
CityStellenbosch
Period14/12/1319/12/13

Keywords

  • Abstraction-refinement
  • Behavioral programming
  • Program repair

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On module-based abstraction and repair of behavioral programs'. Together they form a unique fingerprint.

Cite this