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

1991., International Workshop on the HOL Theorem Proving System and Its Applications最新文献

筛选
英文 中文
Window Inference In The HOL System HOL系统中的窗口推理
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596285
J. Grundy
{"title":"Window Inference In The HOL System","authors":"J. Grundy","doi":"10.1109/HOL.1991.596285","DOIUrl":"https://doi.org/10.1109/HOL.1991.596285","url":null,"abstract":"Window inference is a style of reasoning where the user may transform an expression by restricting attention to a subexpression and transforming it. By restricting attention to a subexpression the user not only gains the ability to manipulate pad of an expression without affecting the other parts, but also the ability to use contextual information in that manipulation. As well as providing automatic management of assumptions which are available in a given context, a window inference system can maintain sets of useful theorems and suppositions. The system can be tailored to preserve any reflexive, transitive relation between successive expressions.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127600680","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}
引用次数: 37
A Report On ICL HOL ICL HOL报告
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596294
R. Arthan
{"title":"A Report On ICL HOL","authors":"R. Arthan","doi":"10.1109/HOL.1991.596294","DOIUrl":"https://doi.org/10.1109/HOL.1991.596294","url":null,"abstract":"This paper reports on research and development work which has been going on in ICL Secure Systems concerned with re-engineering the HOL system to industrial high-assurance standards","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123463723","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
Reasoning About Petri Nets In HOL HOL中Petri网的推理
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596303
E. D. B. Lucena
{"title":"Reasoning About Petri Nets In HOL","authors":"E. D. B. Lucena","doi":"10.1109/HOL.1991.596303","DOIUrl":"https://doi.org/10.1109/HOL.1991.596303","url":null,"abstract":"We discuss some issues concerning the development of a proof system for reasoning about finite safe nets in HOL. Our system is similar to the one proposed b y Winskel and is basically composed by a HOL theory of labelled safe nets, a process term language and an assertion language based on the modal mu-calculus. We hope at the end of the project t o have implemented specialised rules and tactics t o provide a compositional way of carrying out proofs of properties about terms of the process language. proach for proving assertions about terms of our process language. The remainder of the paper is organised as follows. In the next section we present a summary of the basic theory of nets. We then describe the constructions on safe nets that we use to give semantics for the terms of the process language. In section 4, we present our formalisation of nets in HOL. Next, we introduce our process term language. Following that, we describe our assertion language and other aspects closely related. Finally, some concluding remarks are given. 2 Petri nets: basic concepts","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"13 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125823262","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
An HOL Theory For Logic States with Indeterminate Strengths 不确定强度逻辑态的HOL理论
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596277
J. Gambles, P. Windley
{"title":"An HOL Theory For Logic States with Indeterminate Strengths","authors":"J. Gambles, P. Windley","doi":"10.1109/HOL.1991.596277","DOIUrl":"https://doi.org/10.1109/HOL.1991.596277","url":null,"abstract":"A signal value representation including both unknown state and a degree of strength indeterminacy has been shown to provide greater modeling accuracy to the lattice theoretic approach. The lattice approach facilitates the development of higher-order logic functions that can be used to reason about VLSI circuits. Such signal value functions are required for the integration of verification environments, such as HOL, with modern CAD VLSI design tools.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122330717","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
Reasoning About Software 软件推理
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596271
R. Hale
{"title":"Reasoning About Software","authors":"R. Hale","doi":"10.1109/HOL.1991.596271","DOIUrl":"https://doi.org/10.1109/HOL.1991.596271","url":null,"abstract":"Although HOL has mostly been used for hardware verification, it is an equally appropriate tool for reasoning about software. Many kinds of programming language semantics (denotational, algebraic, operational, etc.) may be embedded in the HOL logic. Based on these semantics, one can construct tools to support program verification, e.g. using a standard programming logic. Furthermore, by modelling the compilation process in the HOL logac, one can verify that a program’s meaning is in fact preserved when it is compiled and run, thus bridging the gap between hardware and software. The general approach is illustrated for a simple sequential programming language, by describing ats syntax and semantics, its Hoare Logic, and its compilataon.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121098625","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
A Package For Inductive Relation Definitions In HOL HOL中归纳关系定义的一个包
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596299
T. Melham
{"title":"A Package For Inductive Relation Definitions In HOL","authors":"T. Melham","doi":"10.1109/HOL.1991.596299","DOIUrl":"https://doi.org/10.1109/HOL.1991.596299","url":null,"abstract":"This paper describes a set of theorem proving tools based on a new derived principle of definition in HOL, namely the introduction of relations inductively defined by a set of rules. Such inductive definitions abound an computer science. Example application areas include reasoning about structured operational semantics, type judgements, transition relations for process algebras, reduction relations, and compositional proof systems. The package described in this paper automates the derivation of certain inductive definitions involved in these applications and provides the basic tools needed for reasoning about the relations introduced by them.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115607794","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}
引用次数: 86
Mechanizing Security In HOL HOL的安全机械化
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596273
W. Harrison, K. Levitt
{"title":"Mechanizing Security In HOL","authors":"W. Harrison, K. Levitt","doi":"10.1109/HOL.1991.596273","DOIUrl":"https://doi.org/10.1109/HOL.1991.596273","url":null,"abstract":"Four definitions or “models” of security are described formally and with examples. The formalization into HOL of three of these models is demonstrated. The relative strengths of these definitions is discussed with respect to adequacy, mechanizability, and provability. Mechanizability refers to how susceptible the model is to formalization in a language like HOL or EHDM [2]. Provability refers to the difficulty of verifying that a particular system has a desired security property. The “non-interference” and “restrictiveness” models described in sections 3 and 4 are concise and elegant, but verifying that a system has either of these properties generally involves lengthy and complicated inductions [l].","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123549605","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}
引用次数: 0
Industrial Application Of Theorem Proving To System Level Design 定理证明在系统级设计中的工业应用
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596280
S. Bainbridge, A. Camilleri, R. Fleming
{"title":"Industrial Application Of Theorem Proving To System Level Design","authors":"S. Bainbridge, A. Camilleri, R. Fleming","doi":"10.1109/HOL.1991.596280","DOIUrl":"https://doi.org/10.1109/HOL.1991.596280","url":null,"abstract":"If formal proof is to be adopted as a practical par2 of the industrial design process, it is currently necessary to follow a suitably ‘light weight’ approach which can handle the complexity of commercial designs within the time scheduled for the design. This requires concentration on just those aspects of a design which are crucial to correct operation ye t are likely to cause design problems using traditional techniques. In this paper we study some of these aspects, namely ones connected with flow control and communication, and analyse how best to deal with them using formal proof.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133653151","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}
引用次数: 0
HOL Around The World HOL环游世界
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596266
Sara Kalvala
{"title":"HOL Around The World","authors":"Sara Kalvala","doi":"10.1109/HOL.1991.596266","DOIUrl":"https://doi.org/10.1109/HOL.1991.596266","url":null,"abstract":"This document describes briefly projects which use the HOL proof system, based on contributions from the user community. The entries are in somewhat haphazard order and classification; the intent is to provide 0 brief synopsis of applications and a directory for future contacts. This list is by no means comprehensive - it just contains the contributions I have received.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133785059","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
Defining Recursive Functions In HOL 定义HOL中的递归函数
1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI: 10.1109/HOL.1991.596300
W. Ploegaerts, L. Claesen, H. Man
{"title":"Defining Recursive Functions In HOL","authors":"W. Ploegaerts, L. Claesen, H. Man","doi":"10.1109/HOL.1991.596300","DOIUrl":"https://doi.org/10.1109/HOL.1991.596300","url":null,"abstract":"The limited support for defining recursive functions and generating induction schemes is a major shortcoming of the HOL system. In this paper, a theory of primitive recursive functions and a tool that minimizes the proof effort required for the definition of a wide class of primitive recursive functions are presented. Due to its jlezibility and degree of automation, this work offers a useful eztension of the HOL system.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131921514","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信