Zobrazeno 1 - 10
of 179
pro vyhledávání: '"COOK, BYRON"'
Autor:
Wilson, Amalee, Noetzli, Andres, Reynolds, Andrew, Cook, Byron, Tinelli, Cesare, Barrett, Clark
For many users of Satisfiability Modulo Theories (SMT) solvers, the solver's performance is the main bottleneck in their application. One promising approach for improving performance is to leverage the increasing availability of parallel and cloud co
Externí odkaz:
http://arxiv.org/abs/2306.05854
We present the open-source tool T2, the first public release from the TERMINATOR project. T2 has been extended over the past decade to support automatic temporal-logic proving techniques and to handle a general class of user-provided liveness and saf
Externí odkaz:
http://arxiv.org/abs/1512.08689
Autor:
BARBOSA, HANIEL, BARRETT, CLARK, COOK, BYRON, DUTERTRE, BRUNO, KREMER, GEREON, LACHNITT, HANNA, NIEMETZ, AINA, NÖTZLI, ANDRES, OZDEMIR, ALEX, PREINER, MATHIAS, REYNOLDS, ANDREW, TINELLI, CESARE, ZOHAR, YONI
Publikováno v:
Communications of the ACM; Oct2023, Vol. 66 Issue 10, p86-95, 10p, 1 Color Photograph, 1 Black and White Photograph, 2 Diagrams
We propose Splinter, a new technique for proving properties of heap-manipulating programs that marries (1) a new separation logic-based analysis for heap reasoning with (2) an interpolation-based technique for refining heap-shape invariants with data
Externí odkaz:
http://arxiv.org/abs/1501.04100
Autor:
Cook, Byron Lloyd
A linear analysis of a commercial aluminum lattice dome was performed with the loads prescribed by the American National Standards Institute. The pressure snow loads were transformed into a distributed load along the dome members. The analysis of the
Externí odkaz:
http://hdl.handle.net/10919/44143
http://scholar.lib.vt.edu/theses/available/etd-08042009-040245/
http://scholar.lib.vt.edu/theses/available/etd-08042009-040245/
Publikováno v:
Logical Methods in Computer Science, Volume 3, Issue 2 (April 24, 2007) lmcs:2218
We present a new approach for performing predicate abstraction based on symbolic decision procedures. Intuitively, a symbolic decision procedure for a theory takes a set of predicates in the theory and symbolically executes a decision procedure on al
Externí odkaz:
http://arxiv.org/abs/cs/0612003
Autor:
Backes, John, Berrueco, Ulises, Bray, Tyler, Brim, Daniel, Cook, Byron, Gacek, Andrew, Jhala, Ranjit, Luckow, Kasper, McLaughlin, Sean, Menon, Madhav, Peebles, Daniel, Pugalia, Ujjwal, Rungta, Neha, Schlesinger, Cole, Schodde, Adam, Tanuku, Anvesh, Varming, Carsten, Viswanathan, Deepa
Publikováno v:
Computer Aided Verification
The shift to cloud-based APIs has made application security critically depend on understanding and reasoning about policies that regulate access to cloud resources. We present stratified predicate abstraction, a new approach that summarizes complex s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmc_________::157498b95d72a9a303b7d701626b38cc
http://europepmc.org/articles/PMC7363185
http://europepmc.org/articles/PMC7363185
Publikováno v:
In Electronic Notes in Theoretical Computer Science 29 September 2011 276:171-190
Publikováno v:
Communications of the ACM. May2011, Vol. 54 Issue 5, p88-98. 11p. 1 Illustration, 11 Diagrams.