Σχολή Επιστημών και Τεχνολογίας της Πληροφορίας
Μόνιμο URI για αυτήν την κοινότηταhttps://pyxida.aueb.gr/handle/123456789/2
Η Σχολή Επιστημών και Τεχνολογίας της Πληροφορίας περιλαμβάνει τα Τμήματα: - Τμήμα Πληροφορικής - Τμήμα Στατιστικής
Περιήγηση
Πλοήγηση Σχολή Επιστημών και Τεχνολογίας της Πληροφορίας ανά Συγγραφέα "Aliprantis, Efstathios"
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Α Β Γ Δ Ε Ζ Η Θ Ι Κ Λ Μ Ν Ξ Ο Π Ρ Σ Τ Υ Φ Χ Ψ Ω
Τώρα δείχνει 1 - 1 από 1
- Αποτελέσματα ανά σελίδα
- Επιλογές ταξινόμησης
Τεκμήριο Blockchain-based algorithmic problem solving competitions(2021) Aliprantis, Efstathios; Αλιπράντης, Ευστάθιος; Athens University of Economics and Business, Department of Informatics; Voulgaris, Spyridon; Markakis, Evangelos; Φουστούκου, ΕυγενίαThis thesis presents a blockchain-based platform where algorithmic problems can be posedas competitions, potentially, with a financial reward. A competition is won by the firstindividual to submit an algorithm that is both correct and bounded on time and spacecomplexity, in accordance with the specification of the corresponding problem. Submittedalgorithms must be accompanied by a formal proof of correctness which is mechanicallyvalidated by the platform. The platform is based on blockchain technology, specificallyEthereum, which ensures transparency on solution validation and allows for the automaticpayment of competition rewards.A complete system design is proposed and experimentally evaluated. The system consists ofa web-based front end and a blockain-based backend. The blockain-based backend conductscompetitions transparently and validates submitted algorithms and proofs mechanically. Theproposed system design is evaluated by an experimental proof-of-concept implementation.Furthermore, a theoretical setup is established in order to develop the methods and toolsrequired to make the platform a reality. This theoretical setup includes a method for theformal specification of computational problems where problem specifications are formattedas special problem-definition algorithms. A method for proving algorithm correctnessagainst such problem specifications is proposed based on formal program verification. Anew programming language with a fully working compiler is developed for the representationof algorithms. A proof composer for proofs of algorithm correctness is developed based ona custom configuration of Hoare logic.