20 citations · 43 across the 10 of their papers we have counts for
11 papers
Dynamic Robustness Verification Against Weak Memory (Extended Version)
Roy Margalit, Michalis Kokologiannakis, Shachar Itzhaky +1
Dynamic race detection is a highly effective runtime verification technique for identifying data races by instrumenting and monitoring concurrent program runs. However, standard dy…
Kotlin's Type System is (Also) Unsound
Elad Kinsbruner, Hila Peleg, Shachar Itzhaky
Soundness of a type system is a fundemental property that guarantees that no operation that is not supported by a value will be performed on that value at run time. A type checker…
Colored E-Graph: Equality Reasoning with Conditions
Eytan Singher, Shachar Itzhaky
E-graphs are a prominent data structure that has been increasing in popularity in recent years due to their expanding range of applications in various formal reasoning tasks. Often…
Hyperproperty Verification as CHC Satisfiability
Shachar Itzhaky, Sharon Shoham, Yakir Vizel
Hyperproperties govern the behavior of a system or systems across multiple executions, and are being recognized as an important extension of regular temporal properties. So far, su…
SMT Sampling via Model-Guided Approximation
Matan Peled, Bat-Chen Rothenberg, Shachar Itzhaky
We investigate the domain of satisfiable formulas in satisfiability modulo theories (SMT), in particular, automatic generation of a multitude of satisfying assignments to such form…
Securing Access to Untrusted Services From TEEs with GateKeeper
Meni Orenbach, Bar Raveh, Alon Berkenstadt +3
Applications running in Trusted Execution Environments (TEEs) commonly use untrusted external services such as host File System. Adversaries may maliciously alter the normal servic…
AmiGo: Computational Design of Amigurumi Crochet Patterns
Michal Edelstein, Hila Peleg, Shachar Itzhaky +1
We propose an approach for generating crochet instructions (patterns) from an input 3D model. We focus on Amigurumi, which are knitted stuffed toys. Given a closed triangle mesh, a…
Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction
Oren Ish Shalom, Shachar Itzhaky, Noam Rinetzky +1
Automatic verification of array manipulating programs is a challenging problem because it often amounts to the inference of in ductive quantified loop invariants which, in some cas…
Theory Exploration Powered By Deductive Synthesis
Eytan Singher, Shachar Itzhaky
Recent years have seen tremendous growth in the amount of verified software. Proofs for complex properties can now be achieved using higher-order theories and calculi. Complex prop…
On the automated verification of web applications with embedded SQL
Shachar Itzhaky, Tomer Kotek, Noam Rinetzky +4
A large number of web applications is based on a relational database together with a program, typically a script, that enables the user to interact with the database through embedd…
Liquid Information Flow Control
Nadia Polikarpova, Deian Stefan, Jean Yang +3
We present Lifty, a domain-specific language for data-centric applications that manipulate sensitive data. A Lifty programmer annotates the sources of sensitive data with declarati…