Pub Date : 2016-12-05DOI: 10.1007/978-3-642-38592-6_6
Ornela Dardha, D. Gorla, Daniele Varacca
{"title":"Semantic Subtyping for Objects and Classes","authors":"Ornela Dardha, D. Gorla, Daniele Varacca","doi":"10.1007/978-3-642-38592-6_6","DOIUrl":"https://doi.org/10.1007/978-3-642-38592-6_6","url":null,"abstract":"","PeriodicalId":80982,"journal":{"name":"Computer/law journal","volume":"23 1","pages":"66-82"},"PeriodicalIF":0.0,"publicationDate":"2016-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79370810","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}
Pub Date : 2015-07-06DOI: 10.1007/978-3-319-20424-6_20
Yu Liu, P. McBrien
{"title":"Transactional and Incremental Type Inference from Data Updates","authors":"Yu Liu, P. McBrien","doi":"10.1007/978-3-319-20424-6_20","DOIUrl":"https://doi.org/10.1007/978-3-319-20424-6_20","url":null,"abstract":"","PeriodicalId":80982,"journal":{"name":"Computer/law journal","volume":"24 1","pages":"206-219"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83265122","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}
E. D. Giacomo, W. Didimo, G. Liotta, H. Meijer, S. Wismath
A simultaneous geometric embedding SGE of two planar graphs G 1 and G 2 with the same vertex set is a pair of straight-line planar drawings Γ1 of G 1 and Γ2 of G 2 such that each vertex is drawn at the same point in Γ1 and Γ2. Many papers have been devoted to the study of which pairs of graphs admit a SGE, and both positive and negative results have been proved. We extend the study of SGE, by introducing and characterizing a new class of planar graphs that makes it possible to immediately extend several positive results that rely on the property of strictly monotone paths. Moreover, we introduce a relaxation of the SGE setting where Γ1 and Γ2 are required to be quasi planar i.e., they can have crossings provided that there are no three mutually crossing edges. This relaxation allows for the simultaneous embedding of pairs of planar graphs that are not simultaneously embeddable in the classical SGE setting and opens up to several new interesting research questions.
{"title":"Planar and Quasi-Planar Simultaneous Geometric Embedding","authors":"E. D. Giacomo, W. Didimo, G. Liotta, H. Meijer, S. Wismath","doi":"10.1093/comjnl/bxv048","DOIUrl":"https://doi.org/10.1093/comjnl/bxv048","url":null,"abstract":"A simultaneous geometric embedding SGE of two planar graphs G 1 and G 2 with the same vertex set is a pair of straight-line planar drawings Γ1 of G 1 and Γ2 of G 2 such that each vertex is drawn at the same point in Γ1 and Γ2. Many papers have been devoted to the study of which pairs of graphs admit a SGE, and both positive and negative results have been proved. We extend the study of SGE, by introducing and characterizing a new class of planar graphs that makes it possible to immediately extend several positive results that rely on the property of strictly monotone paths. Moreover, we introduce a relaxation of the SGE setting where Γ1 and Γ2 are required to be quasi planar i.e., they can have crossings provided that there are no three mutually crossing edges. This relaxation allows for the simultaneous embedding of pairs of planar graphs that are not simultaneously embeddable in the classical SGE setting and opens up to several new interesting research questions.","PeriodicalId":80982,"journal":{"name":"Computer/law journal","volume":"56 1","pages":"52-63"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80316918","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 first attempt at building design tools that amalgamate theorem proving and engineering methods. To gain acceptance such a tool must focus on the engineering task and proof steps must be hidden. From these ideas a prototype system based on the HOL proof assistant has been designed. The key features of this system are threefold. First, we use window reasoning for modelling the design process; Second, we have defined a set of application specific derived inference rules that implement common design tasks; Third, we have extended the design representation in logic with annotations to support efficient algorithmic reasoning.
{"title":"An Engineering Approach to Formal Digital System Design","authors":"M. Larsson","doi":"10.1093/comjnl/38.2.101","DOIUrl":"https://doi.org/10.1093/comjnl/38.2.101","url":null,"abstract":"This paper describes a first attempt at building design tools that amalgamate theorem proving and engineering methods. To gain acceptance such a tool must focus on the engineering task and proof steps must be hidden. From these ideas a prototype system based on the HOL proof assistant has been designed. The key features of this system are threefold. First, we use window reasoning for modelling the design process; Second, we have defined a set of application specific derived inference rules that implement common design tasks; Third, we have extended the design representation in logic with annotations to support efficient algorithmic reasoning.","PeriodicalId":80982,"journal":{"name":"Computer/law journal","volume":"9 1","pages":"300-315"},"PeriodicalIF":0.0,"publicationDate":"1994-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77730756","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 an earlier project of VanInwegen and Gunter, the dynamic semantics of the Core of Standard ML (SML) was encoded in the HOL theorem-prover. We extend this by adding the dynamic Module system. We then develop a possible dynamic semantics for a Module system with higher order functors and projections and discuss how we use these to prove that evaluation in the proposed system is a conservative extension, in an appropiate sense, of evaluation in the SML Module system.
{"title":"Studying the ML Module System in HOL","authors":"E. Gunter, S. Maharaj","doi":"10.1093/comjnl/38.2.142","DOIUrl":"https://doi.org/10.1093/comjnl/38.2.142","url":null,"abstract":"In an earlier project of VanInwegen and Gunter, the dynamic semantics of the Core of Standard ML (SML) was encoded in the HOL theorem-prover. We extend this by adding the dynamic Module system. We then develop a possible dynamic semantics for a Module system with higher order functors and projections and discuss how we use these to prove that evaluation in the proposed system is a conservative extension, in an appropiate sense, of evaluation in the SML Module system.","PeriodicalId":80982,"journal":{"name":"Computer/law journal","volume":"61 1","pages":"346-361"},"PeriodicalIF":0.0,"publicationDate":"1994-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88140625","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 LCF system provides a logic of fixed point theory and is useful to reason about nontermination, recursive definitions and infinite-valued types such as lazy lists. Because of continual presence of bottom elements, it is clumsy for reasoning about finite-valued types and strict functions. The HOL system provides set theory and supports reasoning about finite-valued types and total functions well. In this paper a number of examples are used to demonstrate that an extension of HOL with domain theory combines the benefits of both systems. The examples illustrate reasoning about infinite values and nonterminating functions and show how domain and set theoretic reasoning can be mixed to advantage. An example presents a proof of correctness of a recursive unification algorithm using well-founded induction.
{"title":"LCF Examples in HOL","authors":"Sten Agerholm","doi":"10.1093/comjnl/38.2.121","DOIUrl":"https://doi.org/10.1093/comjnl/38.2.121","url":null,"abstract":"The LCF system provides a logic of fixed point theory and is useful to reason about nontermination, recursive definitions and infinite-valued types such as lazy lists. Because of continual presence of bottom elements, it is clumsy for reasoning about finite-valued types and strict functions. The HOL system provides set theory and supports reasoning about finite-valued types and total functions well. In this paper a number of examples are used to demonstrate that an extension of HOL with domain theory combines the benefits of both systems. The examples illustrate reasoning about infinite values and nonterminating functions and show how domain and set theoretic reasoning can be mixed to advantage. An example presents a proof of correctness of a recursive unification algorithm using well-founded induction.","PeriodicalId":80982,"journal":{"name":"Computer/law journal","volume":"27 1","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"1994-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77959084","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}
Ferri Abolhassan, R. Drefenstedt, J. Keller, W. Paul, D. Scheerer
We sketch the physical design of a prototype of a PRAM architecture based on Ranade’s Fluent Machine. We describe a specially developed processor chip with several instruction streams and a fast butterfly connection network. For the realization of the network we consider alternatively optoelectronic and electric transmission. We also discuss some basic software issues.
{"title":"On the Physical Design of PRAMs","authors":"Ferri Abolhassan, R. Drefenstedt, J. Keller, W. Paul, D. Scheerer","doi":"10.1093/comjnl/36.8.756","DOIUrl":"https://doi.org/10.1093/comjnl/36.8.756","url":null,"abstract":"We sketch the physical design of a prototype of a PRAM architecture based on Ranade’s Fluent Machine. We describe a specially developed processor chip with several instruction streams and a fast butterfly connection network. For the realization of the network we consider alternatively optoelectronic and electric transmission. We also discuss some basic software issues.","PeriodicalId":80982,"journal":{"name":"Computer/law journal","volume":"41 1","pages":"1-19"},"PeriodicalIF":0.0,"publicationDate":"1992-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82323208","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 this paper we study the problem of determining whether two points lie in the same connected component of a semi-algebraic set S. Although we are mostly concerned with sets S ⊑ R n , our algorithm can also decide if points in an arbitrary set S ⊑ R n can be joined by a semi-algebraic path, for any real closed field R. Our algorithm computes a one-dimensional semi-algebraic subset ℜ(S) of S (actually of an embedding of S in a space (hat R^n ) for a certain real extension field (hat R) of the given field R. ℜ(S) is called the roadmap of S. Our construction uses the original roadmap algorithm described in [Can88a], [Can88b] which worked only for compact, regularly stratified sets.
本文研究了确定两个点是否在半代数集合S的同一连通分量中的问题，尽管我们主要关注的是集合S * * R n，但我们的算法也可以确定任意集合S * * R n中的点是否可以由半代数路径连接。对于任何实闭域r，我们的算法计算S的一维半代数子集(实际上是S在给定域r的某个实扩展域(hat R)的空间中嵌入(hat R^n )的子集)。我们的构造使用了[Can88a]， [Can88b]中描述的原始路线图算法，该算法只适用于紧化，规则分层集。
{"title":"Computing Roadmaps of General Semi-Algebraic Sets","authors":"J. Canny","doi":"10.1093/comjnl/36.5.504","DOIUrl":"https://doi.org/10.1093/comjnl/36.5.504","url":null,"abstract":"In this paper we study the problem of determining whether two points lie in the same connected component of a semi-algebraic set S. Although we are mostly concerned with sets S ⊑ R n , our algorithm can also decide if points in an arbitrary set S ⊑ R n can be joined by a semi-algebraic path, for any real closed field R. Our algorithm computes a one-dimensional semi-algebraic subset ℜ(S) of S (actually of an embedding of S in a space (hat R^n ) for a certain real extension field (hat R) of the given field R. ℜ(S) is called the roadmap of S. Our construction uses the original roadmap algorithm described in [Can88a], [Can88b] which worked only for compact, regularly stratified sets.","PeriodicalId":80982,"journal":{"name":"Computer/law journal","volume":"1 1","pages":"94-107"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73978814","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}
Program synthesis in Martin-Lof’s Theory of Types is a theorem proving activity. We demonstrate how the rich structure of the theory may be exploited in the automation of this activity. Basic properties of data type constructors are shown to exhibit a general structure in the way in which they are expressed and derived. A proof procedure for negation is developed based upon these properties. As a consequence our proof procedure may be extended uniformly to incorporate new data types.
{"title":"On Exploiting the Structure of Martin-Löf's Theory of Types","authors":"Andrew Ireland","doi":"10.1093/comjnl/36.4.387","DOIUrl":"https://doi.org/10.1093/comjnl/36.4.387","url":null,"abstract":"Program synthesis in Martin-Lof’s Theory of Types is a theorem proving activity. We demonstrate how the rich structure of the theory may be exploited in the automation of this activity. Basic properties of data type constructors are shown to exhibit a general structure in the way in which they are expressed and derived. A proof procedure for negation is developed based upon these properties. As a consequence our proof procedure may be extended uniformly to incorporate new data types.","PeriodicalId":80982,"journal":{"name":"Computer/law journal","volume":"81 1","pages":"126-136"},"PeriodicalIF":0.0,"publicationDate":"1991-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73009606","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
扫码关注我们
求助内容：
应助结果提醒方式：