Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Dodds, Mike"'
Autor:
Pernsteiner, Stuart, Diatchki, Iavor S., Dockins, Robert, Dodds, Mike, Hendrix, Joe, Ravich, Tristan, Redmond, Patrick, Scott, Ryan, Tomb, Aaron
We present Crux, a cross-language verification tool for Rust and C/LLVM. Crux targets bounded, intricate pieces of code that are difficult for humans to get right: for example, cryptographic modules and serializer / deserializer pairs. Crux builds on
Externí odkaz:
http://arxiv.org/abs/2410.18280
Autor:
Scott, Ryan G., Boston, Brett, Davis, Benjamin, Diatchki, Iavor, Dodds, Mike, Hendrix, Joe, Matichuk, Daniel, Quick, Kevin, Ravitch, Tristan, Robert, Valentin, Selfridge, Benjamin, Stefănescu, Andrei, Wagner, Daniel, Winwood, Simon
When attempting to understand the behavior of an executable, a binary analyst can make use of many different techniques. These include program slicing, dynamic instrumentation, binary-level rewriting, symbolic execution, and formal verification, all
Externí odkaz:
http://arxiv.org/abs/2407.06375
A valid compiler optimisation transforms a block in a program without introducing new observable behaviours to the program as a whole. Deciding which optimisations are valid can be difficult, and depends closely on the semantic model of the programmi
Externí odkaz:
http://arxiv.org/abs/1802.05918
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data structure's seque
Externí odkaz:
http://arxiv.org/abs/1701.05463
In separation logic program analyses, tractability is generally achieved by restricting invariants to a finite abstract domain. As this domain cannot vary, loss of information can cause failure even when verification is possible in the underlying log
Externí odkaz:
http://arxiv.org/abs/1504.08309
Autor:
Dodds, Mike, Chow, Vincent, Markus, Richard, Pérez-Ruixo, Juan José, Shen, Danny, Gibbs, Megan *
Publikováno v:
In Journal of Pharmaceutical Sciences November 2013 102(11):3908-3914
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.
Publikováno v:
SAE Transactions, 1999 Jan 01. 108, 787-793.
Externí odkaz:
https://www.jstor.org/stable/44729474
Autor:
Losa, Giuliano, Dodds, Mike
The Stellar Consensus Protocol (SCP) is a quorum-based BFT consensus protocol. However, instead of using threshold-based quorums, SCP is permissionless and its quorum system emerges from participants’ self-declared trust relationships. In this pape
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a35494ca6673814487c04987a680c93