Zobrazeno 1 - 10
of 63
pro vyhledávání: '"DARULOVA, EVA"'
We introduce REST, a novel term rewriting technique for theorem proving that uses online termination checking and can be integrated with existing program verifiers. REST enables flexible but terminating term rewriting for theorem proving by: (1) expl
Externí odkaz:
http://arxiv.org/abs/2202.05872
Elementary function operations such as sin and exp cannot in general be computed exactly on today's digital computers, and thus have to be approximated. The standard approximations in library functions typically provide only a limited set of precisio
Externí odkaz:
http://arxiv.org/abs/2202.05472
Deductive verification has been successful in verifying interesting properties of real-world programs. One notable gap is the limited support for floating-point reasoning. This is unfortunate, as floating-point arithmetic is particularly unintuitive
Externí odkaz:
http://arxiv.org/abs/2101.08733
Proof engineering efforts using interactive theorem proving have yielded several impressive projects in software systems and mathematics. A key obstacle to such efforts is the requirement that the domain expert is also an expert in the low-level deta
Externí odkaz:
http://arxiv.org/abs/2101.00930
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
Autor:
Darulova, Eva, Volkova, Anastasia
Elementary function calls are a common feature in numerical programs. While their implementions in library functions are highly optimized, their computation is nonetheless very expensive compared to plain arithmetic. Full accuracy is, however, not al
Externí odkaz:
http://arxiv.org/abs/1811.10274
Autor:
Stanley-Marbell, Phillip, Alaghi, Armin, Carbin, Michael, Darulova, Eva, Dolecek, Lara, Gerstlauer, Andreas, Gillani, Ghayoor, Jevdjic, Djordje, Moreau, Thierry, Cacciotti, Mattia, Daglis, Alexandros, Jerger, Natalie Enright, Falsafi, Babak, Misailovic, Sasa, Sampson, Adrian, Zufferey, Damien
When a computational task tolerates a relaxation of its specification or when an algorithm tolerates the effects of noise in its execution, hardware, programming languages, and system software can trade deviations from correct behavior for lower reso
Externí odkaz:
http://arxiv.org/abs/1809.05859
Recent renewed interest in optimizing and analyzing floating-point programs has lead to a diverse array of new tools for numerical programs. These tools are often complementary, each focusing on a distinct aspect of numerical programming. Building re
Externí odkaz:
http://arxiv.org/abs/1805.02436
We present Flipper, a natural language interface for describing high-level task specifications for robots that are compiled into robot actions. Flipper starts with a formal core language for task planning that allows expressing rich temporal specific
Externí odkaz:
http://arxiv.org/abs/1803.02238
Autor:
Becker, Heiko, Zyuzin, Nikita, Monat, Raphael, Darulova, Eva, Myreen, Magnus O., Fox, Anthony
Being able to soundly estimate roundoff errors of finite-precision computations is important for many applications in embedded systems and scientific computing. Due to the discrepancy between continuous reals and discrete finite-precision values, aut
Externí odkaz:
http://arxiv.org/abs/1707.02115