Avraham Shinnar

Avraham Shinnar

Auto-generated profile, based on publicly available information

Avraham Shinnar

IBM Research, Yorktown Heights, NY, USA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 September 2022 in Empirical Software Engineering
Verified
Journal Article
Closed access
PDF file
JTJason Tsay
Jason Tsay
ABAlan Braz
Alan Braz
MHMartin Hirzel
Martin Hirzel
ASAvraham Shinnar
Avraham Shinnar
TMTodd Mummert
Todd Mummert

9 May 2017
Verified
Conference Paper
Open access
PDF file
JAJoshua S. Auerbach
Joshua S. Auerbach
MHMartin Hirzel
Martin Hirzel
LMLouis Mandel
Louis Mandel
ASAvraham Shinnar
Avraham Shinnar
JSJérôme Siméon
Jérôme Siméon
Algebras based on combinators, i.e., variable-free, have been proposed as a better representation for query compilation and optimization. A key benefit of combinators is that they avoid the need to handle variable shadowing or accidental capture during rewrites. This simplifies both the optimizer specification and its correctness analysis, but the environment from the source language has to be reified as records, which can lead to more complex query plans. This paper proposes NRAe, an extension of a combinators-based nested relational algebra (NRA) with built-in support for environments. We show that it can naturally encode an equivalent NRA with lambda terms and that all optimizations on NRA carry over to NRAe. This extension provides an elegant way to represent views in query plans, and can radically simplify compilation and optimization for source languages with rich environment manipulations. We have specified a query compiler using the Coq proof assistant with NRAe at its heart. Most of the compiler, including the query optimizer, is accompanied by a (machine-checked) correctness proof. The implementation is automatically extracted from the specification, resulting in a query compiler with a verified core.

29 April 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
VBVéronique Benzaken
Véronique Benzaken
ÉCÉvelyne Contejean
Évelyne Contejean
MHMohammed Houssem Hachmaoui
Mohammed Houssem Hachmaoui
CKChantal Keller
Chantal Keller
LMLouis Mandel
Louis Mandel
JSJérôme Siméon
Jérôme Siméon
SQL is by far the most widely used and implemented query language. Yet, on some key features, such as correlated queries and NULL value semantics, many implementations diverge or contain bugs. We leverage recent advances in the formalization of SQL and query compilers to develop DBCert, the first mechanically verified compiler from SQL queries written in a canonical form to imperative code. Building DBCert required several new contributions which are described in this paper. First, we specify and mechanize a complete translation from SQL to the Nested Relational Algebra which can be used for query optimization. Second, we define Imp, a small imperative language sufficient to express SQL and which can target several execution languages including JavaScript. Finally, we develop a mechanized translation from the nested relational algebra to Imp, using the nested relational calculus as an intermediate step.

24 May 2019 in arXiv
Verified
Preprint
Open access
PDF file
MHMartin Hirzel
Martin Hirzel
KKKiran Kate
Kiran Kate
ASAvraham Shinnar
Avraham Shinnar
SRSubhrajit Roy
Subhrajit Roy
PRParikshit Ram
Parikshit Ram
Machine-learning automation tools, ranging from humble grid-search to hyperopt, auto-sklearn, and TPOT, help explore large search spaces of possible pipelines. Unfortunately, each of these tools has a different syntax for specifying its search space, leading to lack of portability, missed relevant points, and spurious points that are inconsistent with error checks and documentation of the searchable base components. This paper proposes using types (such as enum, float, or dictionary) both for checking the correctness of, and for automatically searching over, hyperparameters and pipeline configurations. Using types for both of these purposes guarantees consistency. We present Lale, an embedded language that resembles scikit learn but provides better automation, correctness checks, and portability. Lale extends the reach of existing automation tools across data modalities (tables, text, images, time-series) and programming languages (Python, Java, R). Thus, data scientists can leverage automation while remaining in control of their work.

5 July 2026
Verified
Conference Paper
Open access
TAToufique Ahmed
Toufique Ahmed
JGJatin Ganhotra
Jatin Ganhotra
ASAvraham Shinnar
Avraham Shinnar
MHMartin Hirzel
Martin Hirzel