Distributed Online Judge System for Interactive Theorem Provers
نویسندگان
چکیده
منابع مشابه
Dependency Graphs for Interactive Theorem Provers
We propose tools to visualize large proof developments as graphs of theorems and deenitions where edges denote the dependency between two theorems. In particular, we study means to limit the size of graphs. Experiments have been done with the Coq theorem prover DFH + 93] and the GraphViz EGKN] and daVinci FW98] graph visualization suites.
متن کاملExploiting Parallelism in Interactive Theorem Provers
This paper reports on the implementation and analysis of the MP reener, the rst parallel interactive theorem prover. The MP reener is a shared memory multi-processor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the reener. The MP reener is a collection of threads operating as sequential reeners running on separate processors. Concurrent tactics exploi...
متن کاملTaclets: A New Paradigm for Constructing Interactive Theorem Provers
Frameworks for interactive theorem proving give the user explicit control over the construction of proofs based on meta languages that contain dedicated control structures for describing proof construction. Such languages are not easy to master and thus contribute to the already long list of skills required by prospective users of interactive theorem provers. Most users, however, only need a co...
متن کاملDefining the Ethereum Virtual Machine for Interactive Theorem Provers
Smart contracts in Ethereum are executed by the Ethereum Virtual Machine (EVM). We defined EVM in Lem, a language that can be compiled for a few interactive theorem provers. We tested our definition against a standard test suite for Ethereum implementations. Using our definition, we proved some safety properties of Ethereum smart contracts in an interactive theorem prover Isabelle/HOL. To our k...
متن کاملEmbedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates that describe entering conditions, conditions for internal moves, and termination conditions. The data flow is based on the extraction of guarded commands. This definition principle can be applied to any imperative synch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPJ Web of Conferences
سال: 2014
ISSN: 2100-014X
DOI: 10.1051/epjconf/20146800016