Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Nandi, Chandrakana"'
Autor:
Smith, Gus Henry, Sisco, Zachary D., Techaumnuaiwit, Thanawat, Xia, Jingtao, Canumalla, Vishal, Cheung, Andrew, Tatlock, Zachary, Nandi, Chandrakana, Balkind, Jonathan
EDA toolchains are notoriously unpredictable, incomplete, and error-prone; the generally-accepted remedy has been to re-imagine EDA tasks as compilation problems. However, any compiler framework we apply must be prepared to handle the wide range of E
Externí odkaz:
http://arxiv.org/abs/2404.00786
Autor:
Cao, David, Kunkel, Rose, Nandi, Chandrakana, Willsey, Max, Tatlock, Zachary, Polikarpova, Nadia
Library learning compresses a given corpus of programs by extracting common structure from the corpus into reusable library functions. Prior work on library learning suffers from two limitations that prevent it from scaling to larger, more complex in
Externí odkaz:
http://arxiv.org/abs/2212.04596
Autor:
Nandi, Chandrakana, Willsey, Max, Zhu, Amy, Wang, Yisu Remy, Saiki, Brett, Anderson, Adam, Schulz, Adriana, Grossman, Dan, Tatlock, Zachary
Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify expressions or prove equivalences. Developing rewrite rules can be difficult: rules may be subtly incorrect, profitable rules are easy to miss, and rulesets must be r
Externí odkaz:
http://arxiv.org/abs/2108.10436
Autor:
Zhao, Haisen, Willsey, Max, Zhu, Amy, Nandi, Chandrakana, Tatlock, Zachary, Solomon, Justin, Schulz, Adriana
Past work on optimizing fabrication plans given a carpentry design can provide Pareto-optimal plans trading off between material waste, fabrication time, precision, and other considerations. However, when developing fabrication plans, experts rarely
Externí odkaz:
http://arxiv.org/abs/2107.14745
Autor:
Zhao, Haisen, Willsey, Max, Zhu, Amy, Nandi, Chandrakana, Tatlock, Zachary, Solomon, Justin, Schulz, Adriana
Past work on optimizing fabrication plans given a carpentry design can provide Pareto-optimal plans trading off between material waste, fabrication time, precision, and other considerations. However, when developing fabrication plans, experts rarely
Externí odkaz:
http://arxiv.org/abs/2107.12265
Autor:
Willsey, Max, Nandi, Chandrakana, Wang, Yisu Remy, Flatt, Oliver, Tatlock, Zachary, Panchekha, Pavel
Publikováno v:
POPL 2021
An e-graph efficiently represents a congruence relation over many expressions. Although they were originally developed in the late 1970s for use in automated theorem provers, a more recent technique known as equality saturation repurposes e-graphs to
Externí odkaz:
http://arxiv.org/abs/2004.03082
Autor:
Nandi, Chandrakana, Willsey, Max, Anderson, Adam, Wilcox, James R., Darulova, Eva, Grossman, Dan, Tatlock, Zachary
Publikováno v:
PLDI 2020
Recent program synthesis techniques help users customize CAD models(e.g., for 3D printing) by decompiling low-level triangle meshes to Constructive Solid Geometry (CSG) expressions. Without loops or functions, editing CSG can require many coordinated
Externí odkaz:
http://arxiv.org/abs/1909.12252
This paper introduces a new technique for dynamic verification of component-based real-time systems based on statistical inference. Verifying such systems requires checking two types of properties: functional and real-time. For functional properties,
Externí odkaz:
http://arxiv.org/abs/1501.02336
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.