default search action
Shachar Itzhaky
Person information
- affiliation: Technion, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Elad Kinsbruner, Shachar Itzhaky, Hila Peleg:
Constrictor: Immutability as a Design Concept (Artifact). Dagstuhl Artifacts Ser. 10(2): 9:1-9:4 (2024) - [j7]Cole Kurashige, Ruyi Ji, Aditya Giridharan, Mark Barbone, Daniel Noor, Shachar Itzhaky, Ranjit Jhala, Nadia Polikarpova:
CCLemma: E-Graph Guided Lemma Discovery for Inductive Equational Proofs. Proc. ACM Program. Lang. 8(ICFP): 818-844 (2024) - [c27]Elad Kinsbruner, Shachar Itzhaky, Hila Peleg:
Constrictor: Immutability as a Design Concept. ECOOP 2024: 22:1-22:29 - [c26]Shachar Itzhaky, Sharon Shoham, Yakir Vizel:
Hyperproperty Verification as CHC Satisfiability. ESOP (2) 2024: 212-241 - [i10]Elad Kinsbruner, Hila Peleg, Shachar Itzhaky:
Kotlin's Type System is (Also) Unsound. CoRR abs/2408.10804 (2024) - 2023
- [j6]Jonás Fiala
, Shachar Itzhaky
Leveraging Rust Types for Program Synthesis. Proc. ACM Program. Lang. 7(PLDI): 1414-1437 (2023) - [c25]Matan Peled
SMT Sampling via Model-Guided Approximation. FM 2023: 74-91 - [c24]Sean Hadar
Scalable Spreadsheet-Driven End-User Applications with Incremental Computation. Onward! 2023: 1-14 - [i9]Shachar Itzhaky, Sharon Shoham, Yakir Vizel:
Hyperproperty Verification as CHC Satisfiability. CoRR abs/2304.12588 (2023) - [i8]Eytan Singher, Shachar Itzhaky:
Colored E-Graph: Equality Reasoning with Conditions. CoRR abs/2305.19203 (2023) - 2022
- [j5]Oren Ish-Shalom, Shachar Itzhaky
Runtime Complexity Bounds Using Squeezers. ACM Trans. Program. Lang. Syst. 44(3): 17:1-17:36 (2022) - [c23]Michal Edelstein
AmiGo: Computational Design of Amigurumi Crochet Patterns. SCF 2022: 5:1-5:11 - [i7]Michal Edelstein
AmiGo: Computational Design of Amigurumi Crochet Patterns. CoRR abs/2211.01178 (2022) - [i6]Meni Orenbach, Bar Raveh, Alon Berkenstadt, Yan Michalevsky, Shachar Itzhaky, Mark Silberstein:
Securing Access to Untrusted Services From TEEs with GateKeeper. CoRR abs/2211.07185 (2022) - [i5]Matan Peled, Bat-Chen Rothenberg, Shachar Itzhaky:
SMT Sampling via Model-Guided Approximation. CoRR abs/2212.06472 (2022) - 2021
- [c22]Shachar Itzhaky, Hila Peleg, Nadia Polikarpova, Reuben N. S. Rowe
Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities - (Invited Paper). CAV (1) 2021: 110-134 - [c21]Eytan Singher
Theory Exploration Powered by Deductive Synthesis. CAV (2) 2021: 125-148 - [c20]Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Run-time Complexity Bounds Using Squeezers. ESOP 2021: 320-347 - [c19]David Trabish, Shachar Itzhaky, Noam Rinetzky:
Address-Aware Query Caching for Symbolic Execution. ICST 2021: 116-126 - [c18]Shachar Itzhaky, Hila Peleg, Nadia Polikarpova, Reuben N. S. Rowe
Cyclic program synthesis. PLDI 2021: 944-959 - [c17]David Trabish, Shachar Itzhaky, Noam Rinetzky:
A bounded symbolic-size model for symbolic execution. ESEC/SIGSOFT FSE 2021: 1190-1201 - [i4]Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction. CoRR abs/2106.00937 (2021) - 2020
- [j4]Hila Peleg, Shachar Itzhaky, Sharon Shoham, Eran Yahav:
Programming by predicates: a formal model for interactive synthesis. Acta Informatica 57(1-2): 165-193 (2020) - [j3]Nadia Polikarpova, Deian Stefan, Jean Yang, Shachar Itzhaky, Travis Hance, Armando Solar-Lezama
Liquid information flow control. Proc. ACM Program. Lang. 4(ICFP): 105:1-105:30 (2020) - [j2]Hila Peleg, Roi Gabay, Shachar Itzhaky, Eran Yahav:
Programming with a read-eval-synth loop. Proc. ACM Program. Lang. 4(OOPSLA): 159:1-159:30 (2020) - [c16]Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction. VMCAI 2020: 112-135 - [c15]Oren Ish-Shalom, Shachar Itzhaky, Roman Manevich, Noam Rinetzky:
Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test Generation. VMCAI 2020: 180-201 - [i3]Eytan Singher, Shachar Itzhaky:
Theory Exploration Powered By Deductive Synthesis. CoRR abs/2009.04826 (2020)
2010 – 2019
- 2019
- [c14]Timotej Kapus
Computing summaries of string loops in C for better testing and refactoring. PLDI 2019: 874-888 - 2018
- [c13]Hila Peleg, Shachar Itzhaky, Sharon Shoham:
Abstraction-Based Interaction Model for Synthesis. VMCAI 2018: 382-405 - 2017
- [j1]Aleksandr Karbyshev
Property-Directed Inference of Universal Invariants or Proving Their Absence. J. ACM 64(1): 7:1-7:33 (2017) - [c12]Shelly Grossman, Sara Cohen, Shachar Itzhaky, Noam Rinetzky, Mooly Sagiv:
Verifying Equivalence of Spark Programs. CAV (2) 2017: 282-300 - [c11]Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger
On the Automated Verification of Web Applications with Embedded SQL. ICDT 2017: 16:1-16:18 - 2016
- [c10]Matt McCutchen
Object spreadsheets: a new computational model for end-user development of data-centric web applications. Onward! 2016: 112-127 - [c9]Shachar Itzhaky, Rohit Singh, Armando Solar-Lezama
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations. OOPSLA 2016: 145-164 - [c8]Shoaib Kamil, Alvin Cheung
Verified lifting of stencil computations. PLDI 2016: 711-726 - [i2]Nadia Polikarpova, Jean Yang, Shachar Itzhaky, Armando Solar-Lezama:
Type-Driven Repair for Information Flow Security. CoRR abs/1607.03445 (2016) - [i1]Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger:
On the automated verification of web applications with embedded SQL. CoRR abs/1610.02101 (2016) - 2015
- [c7]Aleksandr Karbyshev
Property-Directed Inference of Universal Invariants or Proving Their Absence. CAV (1) 2015: 583-602 - 2014
- [b1]Shachar Itzhaky:
Automatic reasoning for pointer programs using decidable logics / Itzhaky Shachar. Tel Aviv University, Israel, 2014 - [c6]Shachar Itzhaky, Nikolaj S. Bjørner, Thomas W. Reps, Mooly Sagiv, Aditya V. Thakur:
Property-Directed Shape Analysis. CAV 2014: 35-51 - [c5]Thomas Ball, Nikolaj S. Bjørner, Aaron Gember, Shachar Itzhaky, Aleksandr Karbyshev
VeriCon: towards verifying controller programs in software-defined networks. PLDI 2014: 282-293 - [c4]Shachar Itzhaky, Anindya Banerjee
Modular reasoning about heap paths via effectively propositional formulas. POPL 2014: 385-396 - 2013
- [c3]Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv:
Effectively-Propositional Reasoning about Reachability in Linked Data Structures. CAV 2013: 756-772 - [c2]Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv:
Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning. LPAR 2013: 457-472 - 2010
- [c1]Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv:
A simple inductive synthesis methodology and its applications. OOPSLA 2010: 36-46
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 19:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: