Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Alex Ozdemir"'
Autor:
Sadjad Fouladi, Brennan Shacklett, Fait Poms, Arjun Arora, Alex Ozdemir, Deepti Raghavan, Pat Hanrahan, Kayvon Fatahalian, Keith Winstein
Publikováno v:
ACM Transactions on Graphics. 41:1-12
In this paper we explore the viability of path tracing massive scenes using a "supercomputer" constructed on-the-fly from thousands of small, serverless cloud computing nodes. We present R2E2 (Really Elastic Ray Engine) a scene decomposition-based pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fcbbb70ab734a87827e6121d2ef14b5
https://doi.org/10.1145/3528223.3530171
https://doi.org/10.1145/3528223.3530171
Publikováno v:
2022 IEEE Symposium on Security and Privacy (SP).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc606393965f0d7151ab2c602b2f83a3
https://doi.org/10.1109/sp46214.2022.9833782
https://doi.org/10.1109/sp46214.2022.9833782
Autor:
Haniel Barbosa, Clark Barrett, Martin Brain, Gereon Kremer, Hanna Lachnitt, Makai Mann, Abdalrhman Mohamed, Mudathir Mohamed, Aina Niemetz, Andres Nötzli, Alex Ozdemir, Mathias Preiner, Andrew Reynolds, Ying Sheng, Cesare Tinelli, Yoni Zohar
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030995232
cvc5 is the latest SMT solver in the cooperating validity checker series and builds on the successful code base of CVC4. This paper serves as a comprehensive system description of cvc5 ’s architectural design and highlights the major features and c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae0418867d7f4ddd7ebc064a0a8bfef9
https://doi.org/10.1007/978-3-030-99524-9_24
https://doi.org/10.1007/978-3-030-99524-9_24
Autor:
Haniel Barbosa, Andrew Reynolds, Gereon Kremer, Hanna Lachnitt, Aina Niemetz, Andres Nötzli, Alex Ozdemir, Mathias Preiner, Arjun Viswanathan, Scott Viteri, Yoni Zohar, Cesare Tinelli, Clark Barrett
Publikováno v:
Automated Reasoning ISBN: 9783031107689
Proof production for SMT solvers is paramount to ensure their correctness independently from implementations, which are often prohibitively difficult to verify. Historically, however, SMT proof production has struggled with performance and coverage i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60d0f76591123217016b58475f230c8b
https://doi.org/10.1007/978-3-031-10769-6_3
https://doi.org/10.1007/978-3-031-10769-6_3
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030242572
SAT
SAT
Many state-of-the-art Satisfiability Modulo Theories (SMT) solvers for the theory of fixed-size bit-vectors employ an approach called bit-blasting, where a given formula is translated into a Boolean satisfiability (SAT) problem and delegated to a SAT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e21e2409e3e06ed1eedb5d3a604047c
https://doi.org/10.1007/978-3-030-24258-9_21
https://doi.org/10.1007/978-3-030-24258-9_21
Autor:
Ricson Cheng, Reyna Hulett, Jincheng Wang, Ran Libeskind-Hadas, Alex Ozdemir, Michael Sheely, Daniel Bork, Jean Sung
Publikováno v:
Algorithms for Computational Biology ISBN: 9783319581620
AlCoB
AlCoB
Phylogenetic tree reconciliation is widely used in the fields of molecular evolution, cophylogenetics, parasitology, and biogeography for studying the evolutionary histories of pairs of entities. Reconciliation is often performed using maximum parsim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ba1ad09c55abddb9b80c9145c86445a
https://doi.org/10.1007/978-3-319-58163-7_9
https://doi.org/10.1007/978-3-319-58163-7_9