Despite increasingly emerging applications, a primary concern for blockchain to be fully practical is the inefficiency of data query. Direct queries on take much time by searching every block, while indirect database greatly degrade authenticity query results. To conquer problem, we propose Verifiable Query Layer (VQL) that can deployed in cloud provide both efficient and verifiable services sy...

This report documents the program and the outcomes of Dagstuhl Seminar 17071 “ComputerAssisted Engineering for Robotics and Autonomous Systems”. This seminar brought together researchers from three distinct communities – Robotics, Model-driven Software Engineering, and Formal Methods – to discuss the path towards creating safe and verifiable autonomous systems. Seminar February 12–17, 2017 – ht...

Formal verification of the security of software systems is gradually moving from the traditional focus on idealized models, to the more ambitious goal of producing verified implementations. This trend is also present in recent work targeting the verification of cryptographic software, but the reach of existing tools has so far been limited to cryptographic primitives, such as RSA-OAEP encryptio...

Server-Aided Verification (SAV) is a method that can be employed to speed up the process of verifying signatures by letting the verifier outsource part of its computation load to a third party. Achieving fast and reliable verification under the presence of an untrusted server is an attractive goal in cloud computing and internet of things scenarios. In this paper, we describe a simple framework...

The modelling and analysis of multi-component discrete event systems is a challenging research area. Over 30 years, modelling and simulation research of discrete event system specification (DEVS) has been developed with (1) dense-time, (2) the I/O concept, and (3) hierarchical model construction. Nevertheless, DEVS model verification research began relatively recently considering the whole DEVS...

We present hidden verification as a means to make the power of computational logic available to users of computer algebra systems while shielding them from its complexity. We have implemented in PVS a library of facts about elementary and transcendental functions, and automatic procedures to attempt proofs of continuity, convergence and differentiability for functions in this class. These are c...

This report is a case-study of the synergy between sequential synthesis and verification. Described is an efficient implementation of a sequential synthesis that uses simple induction to detect and merge sequentially-equivalent registers and nodes in a sequential circuit with a given initial state. Since retiming is not performed, state-encoding, scan chains, and test vectors are essentially pr...

We use laboratory experiments to study communication games with partially verifiable information.In these games, based on Glazer and Rubinstein (2004, 2006), an informed sender sends a two-dimensional message receiver, but only one dimension of the can be verified. investigate effect evidence verification control using three treatments: where messages are unverifiable, receiver chooses which ve...