On module-based abstraction and repair of behavioral programs

Guy Katz

doi:10.1007/978-3-642-45221-5_35

On module-based abstraction and repair of behavioral programs

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR 2013, Proceedings
Pages	518-535
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-45221-5_35
State	Published - 2013
Externally published	Yes
Event	19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2013 - Stellenbosch, South Africa Duration: 14 Dec 2013 → 19 Dec 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8312 LNCS

Conference

Conference	19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2013
Country/Territory	South Africa
City	Stellenbosch
Period	14/12/13 → 19/12/13

Keywords

Abstraction-refinement
Behavioral programming
Program repair

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-45221-5_35

Cite this

Katz, G. (2013). On module-based abstraction and repair of behavioral programs. In Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR 2013, Proceedings (pp. 518-535). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8312 LNCS). https://doi.org/10.1007/978-3-642-45221-5_35

@inproceedings{26a13427e5f54d2bb4298fb1c35711be,

title = "On module-based abstraction and repair of behavioral programs",

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.",

keywords = "Abstraction-refinement, Behavioral programming, Program repair",

author = "Guy Katz",

year = "2013",

doi = "10.1007/978-3-642-45221-5_35",

language = "الإنجليزيّة",

isbn = "9783642452208",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "518--535",

booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR 2013, Proceedings",

note = "19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2013 ; Conference date: 14-12-2013 Through 19-12-2013",

}

Katz, G 2013, On module-based abstraction and repair of behavioral programs. in Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8312 LNCS, pp. 518-535, 19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2013, Stellenbosch, South Africa, 14/12/13. https://doi.org/10.1007/978-3-642-45221-5_35

On module-based abstraction and repair of behavioral programs. / Katz, Guy.
Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR 2013, Proceedings. 2013. p. 518-535 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8312 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On module-based abstraction and repair of behavioral programs

AU - Katz, Guy

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Abstraction-refinement

KW - Behavioral programming

KW - Program repair

UR - http://www.scopus.com/inward/record.url?scp=84893902545&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-45221-5_35

DO - 10.1007/978-3-642-45221-5_35

M3 - منشور من مؤتمر

SN - 9783642452208

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 518

EP - 535

BT - Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR 2013, Proceedings

T2 - 19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2013

Y2 - 14 December 2013 through 19 December 2013

ER -

Katz G. On module-based abstraction and repair of behavioral programs. In Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR 2013, Proceedings. 2013. p. 518-535. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-45221-5_35

On module-based abstraction and repair of behavioral programs

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this