Abstract. This paper presents a system, Loopy, for programming loop transformations. Manual loop transformation can be tedious and errorprone, while fully automated methods do not guarantee improvements. Loopy takes a middle path: a programmer specifies a loop transformation at a high level, which is then carried out automatically by Loopy, and formally verified to guard against specification a...

Just-in-time compilers for dynamic languages routinely generate code under assumptions that may be invalidated at run-time, this allows specialization of program to the common case in order avoid unnecessary overheads due uncommon cases. This form software speculation requires support deoptimization when some fail hold. paper presents a model just-in-time compiler with an intermediate represent...

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...

This article presents a type certifying compiler for a subset of Java and proves the type correctness of the bytecode it generates in the proof assistant Isabelle. The proof is performed by defining a type compiler that emits a type certificate and by showing a correspondence between bytecode and the certificate which entails welltyping. The basis for this work is an extensive formalization of ...

This article is concerned with the application of the program extraction technique to a new class of problems: the synthesis of decision procedures for the classical satisfiability problem that are correct by construction. To this end, we formalize a completeness proof for the DPLL proof system and extract a SAT solver from it. When applied to a propositional formula in conjunctive normal form ...