The HOL system is being increasingly used for a variety of theorem-proving and verification tasks, and by specialists an a variety of domains. A hindrance in making it more accessible is the austere, prompt-based interface to the logic. Many users find the methods for conducting proofs too restrictive. This paper describes a set of tools designed at Cambridge for improving interaction with the HOL proof environment. These tools, though useful at all levels, aim primarily at supporting the experienced user: they provide the same degree of transparency which allows close control of the proof environment-an aspect exploited by many users-while providing an easier intera.ction.
{"title":"Developing An Interface For HOL","authors":"Sara Kalvala","doi":"10.1109/HOL.1991.596296","DOIUrl":"https://doi.org/10.1109/HOL.1991.596296","url":null,"abstract":"The HOL system is being increasingly used for a variety of theorem-proving and verification tasks, and by specialists an a variety of domains. A hindrance in making it more accessible is the austere, prompt-based interface to the logic. Many users find the methods for conducting proofs too restrictive. This paper describes a set of tools designed at Cambridge for improving interaction with the HOL proof environment. These tools, though useful at all levels, aim primarily at supporting the experienced user: they provide the same degree of transparency which allows close control of the proof environment-an aspect exploited by many users-while providing an easier intera.ction.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"106 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":"116331752","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}
This tutorial paper outlines ways in which the HOL theorem prover can be used for protocol verification. I shall first motivate the use of formal methods for protocols and then give a non-technical outline of how HOL can be used to specify and verify protocols.
{"title":"On The Use Of The HOL System For Protocol Verification","authors":"R. Cardell-Oliver","doi":"10.1109/HOL.1991.596272","DOIUrl":"https://doi.org/10.1109/HOL.1991.596272","url":null,"abstract":"This tutorial paper outlines ways in which the HOL theorem prover can be used for protocol verification. I shall first motivate the use of formal methods for protocols and then give a non-technical outline of how HOL can be used to specify and verify protocols.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"34 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":"114514157","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}
This paper describes extensions to the interpreter model for verifying a system of (independently verified) components. We propose using a process algebra to specify and reason about the requirements of composed systems. An example is presented to demonstrate how the system synchronization requirements can be specified using CCS. Preliminary work to embed a simple finite sequence variation of CCS within HOL is also presented.
{"title":"Verification Of Composed Hardware Systems Using CCS","authors":"E. T. Schubert","doi":"10.1109/HOL.1991.596276","DOIUrl":"https://doi.org/10.1109/HOL.1991.596276","url":null,"abstract":"This paper describes extensions to the interpreter model for verifying a system of (independently verified) components. We propose using a process algebra to specify and reason about the requirements of composed systems. An example is presented to demonstrate how the system synchronization requirements can be specified using CCS. Preliminary work to embed a simple finite sequence variation of CCS within HOL is also presented.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"15 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":"133150537","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}
{"title":"Introduction To The Hol System","authors":"M. Gordon","doi":"10.1109/HOL.1991.596265","DOIUrl":"https://doi.org/10.1109/HOL.1991.596265","url":null,"abstract":"","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"15 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":"115329800","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}
The HOL system is a powerful tool for proving higherorder formulae. However, proofs have to be performed interactively and only little automation using tactics is possible. Even though interaction is desirable to guide major and creative backward proof steps of complex proofs, a deluge of simple sub-goals may evolve which all have to be proven manually in order to accomplish the proof. Although these sub-goals are often simple formulae, their proof has not yet been automated in HOL. In this paper it is shown how it is possible to automate these tasks by integrating a first-order automated theorem proving tool, called FAUST, into HOL. It is based on an efficient variant of the well-known sequent calculus. In order to maintain the high confdence in HOL-generated proofs, FAUST is able to generate HOL tactics which may be used to post-justifr the theorem derived by FAUST in HOL. The underlying calculus of FAUST, the tactic generation, as well as experimental results are presented.
{"title":"Integrating A First-order Automatic prover In The HOL Environment","authors":"Ramayya Kumar, T. Kropf, K. Schneider","doi":"10.1109/HOL.1991.596284","DOIUrl":"https://doi.org/10.1109/HOL.1991.596284","url":null,"abstract":"The HOL system is a powerful tool for proving higherorder formulae. However, proofs have to be performed interactively and only little automation using tactics is possible. Even though interaction is desirable to guide major and creative backward proof steps of complex proofs, a deluge of simple sub-goals may evolve which all have to be proven manually in order to accomplish the proof. Although these sub-goals are often simple formulae, their proof has not yet been automated in HOL. In this paper it is shown how it is possible to automate these tasks by integrating a first-order automated theorem proving tool, called FAUST, into HOL. It is based on an efficient variant of the well-known sequent calculus. In order to maintain the high confdence in HOL-generated proofs, FAUST is able to generate HOL tactics which may be used to post-justifr the theorem derived by FAUST in HOL. The underlying calculus of FAUST, the tactic generation, as well as experimental results are presented.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"36 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":"116039129","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}
This paper describes a simple graph theory expressed in higher order logic and the applications of it in railway signalling. A theory of network based on the graph theory is developed to model the stalic aspects of railway track networks. Tools are being developed to produce formal specification of track networks and to generate control tables for specifying the interlocking required between routes.
{"title":"A Simple Graph Theory And Its Application In Railway Signaling","authors":"W. Wong","doi":"10.1109/HOL.1991.596304","DOIUrl":"https://doi.org/10.1109/HOL.1991.596304","url":null,"abstract":"This paper describes a simple graph theory expressed in higher order logic and the applications of it in railway signalling. A theory of network based on the graph theory is developed to model the stalic aspects of railway track networks. Tools are being developed to produce formal specification of track networks and to generate control tables for specifying the interlocking required between routes.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"1 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":"131167801","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}
Theorem-based design uses logical inference rather than simulation to determine or verify the proper- ties of design implementations. The initial effort to make such an approach practical is large when com- pared to conventional simulation. However, the cost of this effort is typically incurred only once. The hardware descriptions are parameterized so that the verification results are applicable to an entire set of designs rather than just one instantiation. To illustrate these ideas, the logical structure used to verify arithmetic hardware in HOL is outlined. In particular, the role of data abstrac- tion, recursion, and induction is shown.
{"title":"Verifying Arithmetic Hardware In Higher-order Logic","authors":"Shiu-Kai Chin","doi":"10.1109/HOL.1991.596268","DOIUrl":"https://doi.org/10.1109/HOL.1991.596268","url":null,"abstract":"Theorem-based design uses logical inference rather than simulation to determine or verify the proper- ties of design implementations. The initial effort to make such an approach practical is large when com- pared to conventional simulation. However, the cost of this effort is typically incurred only once. The hardware descriptions are parameterized so that the verification results are applicable to an entire set of designs rather than just one instantiation. To illustrate these ideas, the logical structure used to verify arithmetic hardware in HOL is outlined. In particular, the role of data abstrac- tion, recursion, and induction is shown.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128115211","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}
In [6] a real-time process algebra was discussed, a model for the algebra was developed, and the axiomatization was shown to be sound and complete for reasoning about equality and containment of processes for this model. In this work we show how to implement this theory in HOL and to develop a procedure for proving the equality of finite processes.
{"title":"Implementing A Real-time Process Algebra In HOL","authors":"R. Gerber, E. Gunter, Insup Lee","doi":"10.1109/HOL.1991.596281","DOIUrl":"https://doi.org/10.1109/HOL.1991.596281","url":null,"abstract":"In [6] a real-time process algebra was discussed, a model for the algebra was developed, and the axiomatization was shown to be sound and complete for reasoning about equality and containment of processes for this model. In this work we show how to implement this theory in HOL and to develop a procedure for proving the equality of finite processes.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130205522","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}
A n attempt to mechanise reasoning about concurrent algorithms is described. The HOY, theorem prover is used i o formalise the semantics of the Temporal Logic of Actions (TLA) . Using this formalisation, the proof rules of T L A are proved as theorems in the HOL system. Two examples show how TLA-reasoning about algorithms can then be carried out using the HOL syst em.
本文描述了对并发算法进行机械化推理的尝试。HOY定理证明器用于形式化动作时间逻辑(TLA)的语义。利用这种形式化，在HOL系统中以定理的形式证明了T - L - A的证明规则。两个例子展示了如何使用HOL系统对算法进行tla推理。
{"title":"Mechanizing The Temporal Logic Of Actions In HOL","authors":"J. von Wright","doi":"10.1109/hol.1991.596282","DOIUrl":"https://doi.org/10.1109/hol.1991.596282","url":null,"abstract":"A n attempt to mechanise reasoning about concurrent algorithms is described. The HOY, theorem prover is used i o formalise the semantics of the Temporal Logic of Actions (TLA) . Using this formalisation, the proof rules of T L A are proved as theorems in the HOL system. Two examples show how TLA-reasoning about algorithms can then be carried out using the HOL syst em.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"26 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134162301","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：