发布求助
文献互助 智能选刊 最新文献

CoRR最新文献

筛选
英文 中文
Sharing a Library between Proof Assistants: Reaching out to the HOL Family 校对助理共享图书馆:向HOL大家庭伸出援手
CoRR Pub Date : 2018-07-03 DOI: 10.4204/EPTCS.274.5
F. Thiré
{"title":"Sharing a Library between Proof Assistants: Reaching out to the HOL Family","authors":"F. Thiré","doi":"10.4204/EPTCS.274.5","DOIUrl":"https://doi.org/10.4204/EPTCS.274.5","url":null,"abstract":"We observe today a large diversity of proof systems. This diversity has the negative consequence that a lot of theorems are proved many times. Unlike programming languages, it is difficult for these systems to co-operate because they do not implement the same logic. Logical frameworks are a class of theorem provers that overcome this issue by their capacity of implementing various logics. In this work, we study the STTforall logic, an extension of Simple Type Theory that has been encoded in the logical framework Dedukti. We present a translation from this logic to OpenTheory, a proof system and interoperability tool between provers of the HOL family. We have used this translation to export an arithmetic library containing Fermat's little theorem to OpenTheory and to two other proof systems that are Coq and Matita.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"19 1","pages":"57-71"},"PeriodicalIF":0.0,"publicationDate":"2018-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88338599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Formalisation in Constructive Type Theory of Barendregt's Variable Convention for Generic Structures with Binders Barendregt带有粘合剂的泛型结构变量约定的构造型理论形式化
CoRR Pub Date : 2018-07-03 DOI: 10.4204/EPTCS.274.2
Ernesto Copello, Nora Szasz, Álvaro Tasistro
{"title":"Formalisation in Constructive Type Theory of Barendregt's Variable Convention for Generic Structures with Binders","authors":"Ernesto Copello, Nora Szasz, Álvaro Tasistro","doi":"10.4204/EPTCS.274.2","DOIUrl":"https://doi.org/10.4204/EPTCS.274.2","url":null,"abstract":"We introduce a universe of regular datatypes with variable binding information, for which we define generic formation and elimination (i.e. induction /recursion) operators. We then define a generic alpha-equivalence relation over the types of the universe based on name-swapping, and derive iteration and induction principles which work modulo alpha-conversion capturing Barendregt's Variable Convention. We instantiate the resulting framework so as to obtain the Lambda Calculus and System F, for which we derive substitution operations and substitution lemmas for alpha-conversion and substitution composition. The whole work is carried out in Constructive Type Theory and machine-checked by the system Agda.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"3 1","pages":"11-26"},"PeriodicalIF":0.0,"publicationDate":"2018-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82462683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Formalization in Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using Multiple Substitution 用多重代换的Lambda微积分标准化定理在构造型理论中的形式化
CoRR Pub Date : 2018-07-03 DOI: 10.4204/EPTCS.274.3
Martín Copes, Nora Szasz, Álvaro Tasistro
{"title":"Formalization in Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using Multiple Substitution","authors":"Martín Copes, Nora Szasz, Álvaro Tasistro","doi":"10.4204/EPTCS.274.3","DOIUrl":"https://doi.org/10.4204/EPTCS.274.3","url":null,"abstract":"We present a full formalization in Martin-L\"of's Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using first-order syntax with one sort of names for both free and bound variables and Stoughton's multiple substitution. Our formalization is based on a proof by Ryo Kashima, in which a notion of beta-reducibility with a standard sequence is captured by an inductive relation. The proof uses only structural induction over the syntax and the relations defined, which is possible due to the specific formulation of substitution that we employ. The whole development has been machine-checked using the system Agda.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"14 1","pages":"27-41"},"PeriodicalIF":0.0,"publicationDate":"2018-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85261694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Abstract Representation of Binders in OCaml using the Bindlib Library 使用Bindlib库的OCaml中binder的抽象表示
CoRR Pub Date : 2018-07-03 DOI: 10.4204/EPTCS.274.4
Rodolphe Lepigre, Christophe Raffalli
{"title":"Abstract Representation of Binders in OCaml using the Bindlib Library","authors":"Rodolphe Lepigre, Christophe Raffalli","doi":"10.4204/EPTCS.274.4","DOIUrl":"https://doi.org/10.4204/EPTCS.274.4","url":null,"abstract":"The Bindlib library for OCaml provides a set of tools for the manipulation of data structures with variable binding. It is very well suited for the representation of abstract syntax trees, and has already been used for the implementation of half a dozen languages and proof assistants (including a new version of the logical framework Dedukti). Bindlib is optimised for fast substitution, and it supports variable renaming. Since the representation of binders is based on higher-order abstract syntax, variable capture cannot arise during substitution. As a consequence, variable names are not updated at substitution time. They can however be explicitly recomputed to avoid \"visual capture\" (i.e., distinct variables with the same apparent name) when a data structure is displayed.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"347 1","pages":"42-56"},"PeriodicalIF":0.0,"publicationDate":"2018-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82974926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
An Atemporal Model of Physical Complexity 物理复杂性的非时间模型
CoRR Pub Date : 2018-07-02 DOI: 10.4204/EPTCS.273.4
Richard Whyman
{"title":"An Atemporal Model of Physical Complexity","authors":"Richard Whyman","doi":"10.4204/EPTCS.273.4","DOIUrl":"https://doi.org/10.4204/EPTCS.273.4","url":null,"abstract":"We present the finite first-order theory (FFOT) machine, which provides an atemporal description of computation. We then develop a concept of complexity for the FFOT machine, and prove that the class of problems decidable by a FFOT machine with polynomial resources is NP intersect co-NP.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"23 1","pages":"39-51"},"PeriodicalIF":0.0,"publicationDate":"2018-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80072332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
System Design in the Era of IoT - Meeting the Autonomy Challenge 物联网时代的系统设计——迎接自主性挑战
CoRR Pub Date : 2018-06-25 DOI: 10.4204/EPTCS.272.1
J. Sifakis
{"title":"System Design in the Era of IoT - Meeting the Autonomy Challenge","authors":"J. Sifakis","doi":"10.4204/EPTCS.272.1","DOIUrl":"https://doi.org/10.4204/EPTCS.272.1","url":null,"abstract":"The advent of IoT is a great opportunity to reinvigorate Computing by focusing on autonomous system design. This certainly raises technology questions but, more importantly, it requires building new foundation that will systematically integrate the innovative results needed to face increasing environment and mission complexity. \u0000A key idea is to compensate the lack of human intervention by adaptive control. This is instrumental for system resilience: it allows both coping with uncertainty and managing mixed criticality services. Our proposal for knowledge-based design seeks a compromise: preserving rigorousness despite the fact that essential properties cannot be guaranteed at design time. It makes knowledge generation and application a primary concern and aims to fully and seamlessly incorporate the adaptive control paradigm in system architecture.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"2 1","pages":"1-22"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81466780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Formal Verification of Usage Control Models: A Case Study of UseCON Using TLA+ 使用控制模型的形式化验证:以使用TLA+的UseCON为例
CoRR Pub Date : 2018-06-25 DOI: 10.4204/EPTCS.272.5
Antonios Gouglidis, Christos Grompanopoulos, Anastasia Mavridou
{"title":"Formal Verification of Usage Control Models: A Case Study of UseCON Using TLA+","authors":"Antonios Gouglidis, Christos Grompanopoulos, Anastasia Mavridou","doi":"10.4204/EPTCS.272.5","DOIUrl":"https://doi.org/10.4204/EPTCS.272.5","url":null,"abstract":"Usage control models provide an integration of access control, digital rights, and trust management. To achieve this integration, usage control models support additional concepts such as attribute mutability and continuity of decision. However, these concepts may introduce an additional level of complexity to the underlying model, rendering its definition a cumbersome and prone to errors process. Applying a formal verification technique allows for a rigorous analysis of the interactions amongst the components, and thus for formal guarantees in respect of the correctness of a model. In this paper, we elaborate on a case study, where we express the high-level functional model of the UseCON usage control model in the TLA+ formal specification language, and verify its correctness for <=12 uses in both of its supporting authorisation models.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"23 1","pages":"52-64"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82828955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Process Network Models for Embedded System Design Based on the Real-Time BIP Execution Engine 基于实时BIP执行引擎的嵌入式系统设计过程网络模型
CoRR Pub Date : 2018-06-25 DOI: 10.4204/EPTCS.272.7
F. Gioulekas, P. Poplavko, P. Katsaros, P. Palomo
{"title":"Process Network Models for Embedded System Design Based on the Real-Time BIP Execution Engine","authors":"F. Gioulekas, P. Poplavko, P. Katsaros, P. Palomo","doi":"10.4204/EPTCS.272.7","DOIUrl":"https://doi.org/10.4204/EPTCS.272.7","url":null,"abstract":"Existing model-based processes for embedded real-time systems support the analysis of various non-functional properties, most notably schedulability, through model checking, simulation or other means. The analysis results are then used for modifying the system's design, so that the expected properties are satisfied. A rigorous model-based design flow differs in that it aims at a system implementation derived from high-level models by applying a sequence of semantics-preserving transformations. Properties established at any design step are preserved throughout the subsequent steps including the executable implementation. We introduce such a design flow using a process network model of computation for application design at a high level, which combines streaming and reactive control processing with task parallelism. The schedulability of the so-called FPPNs (Fixed Priority Process Networks) is well-studied and various solutions have been presented. This article focuses on the design flow's steps for deriving executable implementations on the BIP (Behavior - Interaction - Priority) runtime environment. FPPNs are designed using the TASTE toolset, a convenient architecture description interface. In this way, the developers do not program explicitly low-level real-time OS services and the schedulability properties are guaranteed throughout the design steps by construction. The approach has been validated on the design of a real spacecraft on-board application that has been scheduled for execution on an industrial multicore platform.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"8 1","pages":"79-92"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82308835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Verification of Shared-Reading Synchronisers 共享读取同步器的验证
CoRR Pub Date : 2018-06-25 DOI: 10.4204/EPTCS.272.9
A. Amighi, M. Huisman, S. Blom
{"title":"Verification of Shared-Reading Synchronisers","authors":"A. Amighi, M. Huisman, S. Blom","doi":"10.4204/EPTCS.272.9","DOIUrl":"https://doi.org/10.4204/EPTCS.272.9","url":null,"abstract":"Synchronisation classes are an important building block for shared memory concurrent programs. Thus to reason about such programs, it is important to be able to verify the implementation of these synchronisation classes, considering atomic operations as the synchronisation primitives on which the implementations are built. For synchronisation classes controlling exclusive access to a shared resource, such as locks, a technique has been proposed to reason about their behaviour. This paper proposes a technique to verify implementations of both exclusive access and shared-reading synchronisers. We use permission-based Separation Logic to describe the behaviour of the main atomic operations, and the basis for our technique is formed by a specification for class AtomicInteger, which is commonly used to implement synchronisation classes in java.util.concurrent. To demonstrate the applicability of our approach, we mechanically verify the implementation of various synchronisation classes like Semaphore, CountDownLatch and Lock.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"19 1","pages":"107-120"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91153176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Towards Large-scale Functional Verification of Universal Quantum Circuits 迈向通用量子电路的大规模功能验证
CoRR Pub Date : 2018-05-17 DOI: 10.4204/EPTCS.287.1
M. Amy
{"title":"Towards Large-scale Functional Verification of Universal Quantum Circuits","authors":"M. Amy","doi":"10.4204/EPTCS.287.1","DOIUrl":"https://doi.org/10.4204/EPTCS.287.1","url":null,"abstract":"We introduce a framework for the formal specification and verification of quantum circuits based on the Feynman path integral. Our formalism, built around exponential sums of polynomial functions, provides a structured and natural way of specifying quantum operations, particularly for quantum implementations of classical functions. Verification of circuits over all levels of the Clifford hierarchy with respect to either a specification or reference circuit is enabled by a novel rewrite system for exponential sums with free variables. Our algorithm is further shown to give a polynomial-time decision procedure for checking the equivalence of Clifford group circuits. We evaluate our methods by performing automated verification of optimized Clifford+T circuits with up to 100 qubits and thousands of T gates, as well as the functional verification of quantum algorithms using hundreds of qubits. Our experiments culminate in the automated verification of the Hidden Shift algorithm for a class of Boolean functions in a fraction of the time it has taken recent algorithms to simulate.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"115 7 1","pages":"1-21"},"PeriodicalIF":0.0,"publicationDate":"2018-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90317629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 79
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信