Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Pavel Panchekha"'
Autor:
Ian Briggs, Pavel Panchekha
Publikováno v:
Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04db48019d2661afe882c7f00990d267
https://doi.org/10.1145/3519939.3523452
https://doi.org/10.1145/3519939.3523452
Garbage-collected language runtimes carefully tune heap limits to reduce garbage collection time and memory usage. However, there's a trade-off: a lower heap limit reduces memory use but increases garbage collection time. Classic methods for setting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9503302562a05db44d2abac457c44cf8
http://arxiv.org/abs/2204.10455
http://arxiv.org/abs/2204.10455
Autor:
Ganesh Gopalakrishnan, Ignacio Laguna, Ang Li, Pavel Panchekha, Cindy Rubio-Gonzalez, Zachary Tatlock
Publikováno v:
2021 IEEE/ACM 5th International Workshop on Software Correctness for HPC Applications (Correctness).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96e7b326685878a35942fe6a8db3df65
https://doi.org/10.1109/correctness54621.2021.00007
https://doi.org/10.1109/correctness54621.2021.00007
Publikováno v:
ARITH
Precision tuning and rewriting can improve both the accuracy and speed of floating point expressions, yet these techniques are typically applied separately. This paper explores how finer-grained interleaving of precision tuning and rewriting can help
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::002cb0c7d09061e14774b77ea358e198
https://doi.org/10.1109/arith51176.2021.00013
https://doi.org/10.1109/arith51176.2021.00013
Publikováno v:
Proceedings of the ACM on Programming Languages. 3:1-26
Automated verification can ensure that a web page satisfies accessibility, usability, and design properties regardless of the end user's device, preferences, and assistive technologies. However, state-of-the-art verification tools for layout properti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28063608daeb1ccdc11eba7ecb6cf274
https://doi.org/10.1145/3360577
https://doi.org/10.1145/3360577
Publikováno v:
SC
Automated techniques for rigorous floating-point round-off error analysis are a prerequisite to placing important activities in HPC such as precision allocation, verification, and code optimization on a formal footing. Yet existing techniques cannot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e4b2600bd8b803e11a52edcd469de5c
https://doi.org/10.1109/sc41405.2020.00055
https://doi.org/10.1109/sc41405.2020.00055
Autor:
Aditya Bhaskara, Ganesh Gopalakrishnan, Vinu Joseph, Mu Zhang, Nithin Chalapathi, Pavel Panchekha
Publikováno v:
CORRECTNESS@SC
Neural networks deployed on edge devices must be efficient both in terms of their model size and the amount of data movement they cause when classifying inputs. These efficiencies are typically achieved through model compression: pruning a fully trai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f3d55f30af84211f0cd82d69b5de241
https://doi.org/10.1109/correctness51934.2020.00006
https://doi.org/10.1109/correctness51934.2020.00006
Autor:
Pavel Panchekha, Zachary Tatlock
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030636173
VSTTE
VSTTE
The last few years have seen an explosion of work on tools that address numerical error in scientific, mathematical, and engineering software. The resulting tools can provide essential guidance to expert non-experts: scientists, mathematicians, and e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::354d2f7ed522f22099fcc003fc3a08ed
https://doi.org/10.1007/978-3-030-63618-0_13
https://doi.org/10.1007/978-3-030-63618-0_13
Autor:
Chandrakana Nandi, Pavel Panchekha, Oliver Flatt, Yisu Remy Wang, Zachary Tatlock, Max Willsey
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb9a5bfb90497b08c2b6f3003808d915
Autor:
Chandrakana Nandi, Taylor Blau, Pavel Panchekha, James R. Wilcox, Zachary Tatlock, Dan Grossman
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-31
Desktop-manufacturing techniques like 3D printing are increasingly popular because they reduce the cost and complexity of producing customized objects on demand. Unfortunately, the vibrant communities of early adopters, often referred to as "makers,"
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8b8a17119a0802f8c4c0b58bcbf0a5d
https://doi.org/10.1145/3236794
https://doi.org/10.1145/3236794