Results 11 to 20 of about 30,415 (268)
The Topology of Statistical Verifiability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2], statistics [6, 7] and
Konstantin Genin, Kevin T. Kelly
doaj +3 more sources
Innovations in Systems and Software Engineering, 2021 A recent case study from AWS by Chong et al. proposes an effective methodology for Bounded Model Checking in industry. In this paper, we report on a follow up case study that explores the methodology from the perspective of three research questions: (a) can proof artifacts be used across verification tools; (b) are there bugs in verified code; and (c ...
Siddharth Priya +5 more
openaire +2 more sources
Journal of The Royal Society Interface, 2022 The formalization of biological systems using computational modelling approaches as an alternative to mathematical-based methods has recently received much interest because computational models provide a deeper mechanistic understanding of biological systems.
Savas Konur +2 more
openaire +3 more sources
Verified Verifiers for Verifying Elections [PDF]
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019 The security and trustworthiness of elections is critical to democracy; alas, securing elections is notoriously hard. Powerful cryptographic techniques for verifying the integrity of electronic voting have been developed and are in increasingly common use. The claimed security guarantees of most of these techniques have been formally proved.
Haines, Thomas Edmund +2 more
openaire +2 more sources
What proof do we prefer? Variants of verifiability in voting [PDF]
, 2006 In this paper, we discuss one particular feature of Internet voting, verifiability, against the background of scientific literature and experiments in the Netherlands. In order to conceptually clarify what verifiability is about, we distinguish classical
Pieters, W.
core +8 more sources
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klein, Gerwin, Nipkow, Tobias
openaire +2 more sources
Verifying Controlled Components [PDF]
, 2004 Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express interactive and controller behaviour). This approach is driven by the desire to exploit existing tool support for both CSP and B, and by the need for compositional proof techniques.
Schneider, Steve A., Treharne, Helen
openaire +3 more sources
Privacy-Preserving Verifiability: A Case for an Electronic Exam Protocol [PDF]
, 2017 We introduce the notion of privacy-preserving verifiability for security protocols. It holds when a protocol admits a verifiability test that does not reveal, to the verifier that runs it, more pieces of information about the protocol’s execution than ...
Giustolisi, Rosario +2 more
core +1 more source
网络与信息安全学报, 2016 In view of the problem that users’ informations are leaked and tampered possiblely exists at service terminal in existing outsourcing cloud computing protocols,a secure efficient and verifiable outsourcing protocol about determinant computing in the ...
Rui SUN, You-Liang TIAN
doaj +3 more sources
Advancing Federated Learning through Verifiable Computations and Homomorphic Encryption
Entropy, 2023 Federated learning, as one of the three main technical routes for privacy computing, has been widely studied and applied in both academia and industry.
Bingxue Zhang +4 more
doaj +1 more source