In this paper, we consider the semantic design and verified compilation of a C-like programming language for concurrent shared-memory computation on x86 multiprocessors. The design of such a language is made surprisingly subtle by several factors: the relaxed-memory behavior of the hardware, the effects of compiler optimization on concurrent code, the need to support high-performance concurrent...

Secure multi-party computation (MPC) enables a set of mutually distrusting parties to cooperatively compute, using a cryptographic protocol, a function over their private data. This paper presents WYS, a new domain-specific language (DSL) implementation for writing MPCs. WYS is a Verified, Domain-Specific Integrated Language Extension (VDSILE), a new kind of embedded DSL hosted in F, a fullfeat...

Results from lattice theory have successfully been applied by several researchers, e.g. [1, 7, 9, 10], to reduce the complexity of verification of distributed computations. The set of all reachable states of a distributed computation forms a lattice under a certain partial order relation. A property is said to exhibit meet-closure if the set of reachable states satisfying it is closed under the...

The paper focuses onintroducing a decentralized e-voting scheme that uses blockchain to achieve security and anonymity. A network based on Ethereum was applied, provide distributed database the Peer-to-Peer architecture. During implementation, smart contractswere used. Thanks this, it is possible code terms of contract required perform transaction. proof-of-conceptimplementation blind signature...

Efficient approaches to computationally intensive image processing tasks are currently highly sought after. In this chapter we show how a blackboard paradigm, originally developed for collaborative problem solving, can be used as an efficient and effective vehicle for distributed computation. Through the design of dedicated intelligent agents, typical image processing algorithms can be applied ...

In this report, we present a sequential minimal optimization routine for the principle of relevant information. The optimization problem is broken down into smaller subproblems that can be solved sequentially. Conditions under which this approach is feasible are verified and an algorithm is proposed. Although the algorithm has computation complexity can be O(n), the memory complexity is linear ...