Shachar Itzhaky

Orcid: 0000-0002-7276-7644

Affiliations:
  • Technion, Haifa, Israel


According to our database1, Shachar Itzhaky authored at least 39 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
CCLemma: E-Graph Guided Lemma Discovery for Inductive Equational Proofs.
Proc. ACM Program. Lang., 2024

Constrictor: Immutability as a Design Concept (Artifact).
Dagstuhl Artifacts Ser., 2024

Kotlin's Type System is (Also) Unsound.
CoRR, 2024

Hyperproperty Verification as CHC Satisfiability.
Proceedings of the Programming Languages and Systems, 2024

Constrictor: Immutability as a Design Concept.
Proceedings of the 38th European Conference on Object-Oriented Programming, 2024

2023
Leveraging Rust Types for Program Synthesis.
Proc. ACM Program. Lang., 2023

Colored E-Graph: Equality Reasoning with Conditions.
CoRR, 2023

Scalable Spreadsheet-Driven End-User Applications with Incremental Computation.
Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, 2023

SMT Sampling via Model-Guided Approximation.
Proceedings of the Formal Methods - 25th International Symposium, 2023

2022
Runtime Complexity Bounds Using Squeezers.
ACM Trans. Program. Lang. Syst., 2022

Securing Access to Untrusted Services From TEEs with GateKeeper.
CoRR, 2022

AmiGo: Computational Design of Amigurumi Crochet Patterns.
Proceedings of the SCF '22: Proceedings of the 7th Annual ACM Symposium on Computational Fabrication, 2022

2021
A bounded symbolic-size model for symbolic execution.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

Cyclic program synthesis.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Address-Aware Query Caching for Symbolic Execution.
Proceedings of the 14th IEEE Conference on Software Testing, Verification and Validation, 2021

Run-time Complexity Bounds Using Squeezers.
Proceedings of the Programming Languages and Systems, 2021

Theory Exploration Powered by Deductive Synthesis.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities - (Invited Paper).
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Liquid information flow control.
Proc. ACM Program. Lang., 2020

Programming with a read-eval-synth loop.
Proc. ACM Program. Lang., 2020

Programming by predicates: a formal model for interactive synthesis.
Acta Informatica, 2020

Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test Generation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

2019
Computing summaries of string loops in C for better testing and refactoring.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
Abstraction-Based Interaction Model for Synthesis.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

2017
Property-Directed Inference of Universal Invariants or Proving Their Absence.
J. ACM, 2017

On the Automated Verification of Web Applications with Embedded SQL.
Proceedings of the 20th International Conference on Database Theory, 2017

Verifying Equivalence of Spark Programs.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Type-Driven Repair for Information Flow Security.
CoRR, 2016

Verified lifting of stencil computations.
Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2016

Object spreadsheets: a new computational model for end-user development of data-centric web applications.
Proceedings of the 2016 ACM International Symposium on New Ideas, 2016

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations.
Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, 2016

2014
Automatic reasoning for pointer programs using decidable logics / Itzhaky Shachar
PhD thesis, 2014

Modular reasoning about heap paths via effectively propositional formulas.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

VeriCon: towards verifying controller programs in software-defined networks.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

Property-Directed Shape Analysis.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Effectively-Propositional Reasoning about Reachability in Linked Data Structures.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2010
A simple inductive synthesis methodology and its applications.
Proceedings of the 25th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2010


  Loading...