Runtime Complexity Bounds Using Squeezers

Autor: Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham

Publikováno v: ACM Transactions on Programming Languages and Systems. 44:1-36

Determining upper bounds on the time complexity of a program is a fundamental problem with a variety of applications, such as performance debugging, resource certification, and compile-time optimizations. Automated techniques for cost analysis excel

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8a7d6a4a0a048842a56fcdcecb1f5bb3
https://doi.org/10.1145/3527632

Programming with a read-eval-synth loop

Autor: Shachar Itzhaky, Eran Yahav, Hila Peleg, Roi Gabay

Publikováno v: Proceedings of the ACM on Programming Languages. 4:1-30

A frequent programming pattern for small tasks, especially expressions, is to repeatedly evaluate the program on an input as its editing progresses. The Read-Eval-Print Loop (REPL) interaction model has been a successful model for this programming pa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::272a3466fd36bb43c7743589ff6daf3e
https://doi.org/10.1145/3428227

A bounded symbolic-size model for symbolic execution

Autor: Shachar Itzhaky, Noam Rinetzky, David Trabish

Publikováno v: ESEC/SIGSOFT FSE

Symbolic execution is a powerful program analysis technique which allows executing programs with symbolic inputs. Modern symbolic execution tools use a concrete modeling of object sizes, that does not allow symbolic-size allocations. This leads to co

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a3e3a80c0eaeb39496766104c92a9225
https://doi.org/10.1145/3468264.3468596

Programming by predicates: a formal model for interactive synthesis

Autor: Sharon Shoham, Hila Peleg, Shachar Itzhaky, Eran Yahav

Publikováno v: Acta Informatica. 57:165-193

Program synthesis is the problem of computing from a specification a program that implements it. New and popular variations on the synthesis problem accept specifications in formats that are easier for the human synthesis user to provide: input–out

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::71ee0021d0cbf2a8c0f17bc505bd1faf
https://doi.org/10.1007/s00236-019-00340-y

Run-time Complexity Bounds Using Squeezers

Autor: Noam Rinetzky, Shachar Itzhaky, Sharon Shoham, Oren Ish-Shalom

Publikováno v: Programming Languages and Systems-30th European Symposium on Programming, ESOP 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings
Programming Languages and Systems ISBN: 9783030720186
ESOP
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Programming Languages and Systems

Determining upper bounds on the time complexity of a program is a fundamental problem with a variety of applications, such as performance debugging, resource certification, and compile-time optimizations. Automated techniques for cost analysis excel

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90d5f43c5054529e15cfda80c62c068d