Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)最新文献_第2页

On first-order topological queries 关于一阶拓扑查询

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855783

Martin Grohe, L. Segoufin

引用次数: 19

Approximating labeled Markov processes 近似标记马尔可夫过程

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855759

Josée Desharnais, Vineet Gupta, R. Jagadeesan, P. Panangaden

引用次数: 87

A modality for recursion 递归的一种形式

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855774

Hiroshi Nakano

引用次数: 153

Probabilistic game semantics 概率博弈语义

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855770

V. Danos, Russell Harmer

引用次数: 117

Precongruence formats for decorated trace preorders 装饰痕迹预购的预同余格式

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855760

B. Bloom, W. Fokkink, R. V. Glabbeek

引用次数: 9

More past glories [temporal logic] 更多过去的荣耀[时间逻辑]

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855772

Mark Reynolds

引用次数: 2

Approximate pattern matching is expressible in transitive closure logic 近似模式匹配在传递闭包逻辑中是可表达的

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855764

Kjell Lemström, L. Hella

{"title":"Approximate pattern matching is expressible in transitive closure logic","authors":"Kjell Lemström, L. Hella","doi":"10.1109/LICS.2000.855764","DOIUrl":"https://doi.org/10.1109/LICS.2000.855764","url":null,"abstract":"A sartorial query language facilitates the formulation of queries to a (string) database. One step towards an implementation of such a query language can be taken by defining a logical formalism expressing a known solution for the particular problem at hand. The simplicity of the logic is a desired property because the simpler the logic that the query language is based on, the more efficiently it can be implemented. We introduce a logical formalism for expressing approximate pattern matching. The formalism uses properties of the dynamic programming approach; a minimizing path of a dynamic programming table is expressed by using a formula in an extension of first-order logic (FO). We consider the well-known problems of k mismatches and k differences. Assuming first that k is given as a part of the input, those problems are expressed by using deterministic transitive closure logic (FO(DTC)) and transitive closure logic (FO(TC)), respectively. We believe that in the general case the k differences is not expressible in FO(DTC), and show that solving this question in the affirmative is at least as hard as separating LOGSPACE from NLOGSPACE. We show, however, that if k is fixed, the k differences problem can be expressed by an FO(DTC)formula.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116951904","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

A static calculus of dependencies for the /spl lambda/-cube /spl lambda/-cube的静态依赖计算

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855775

F. Prost

引用次数: 7

Complete axioms for categorical fixed-point operators 范畴不动点算子的完全公理

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855753

A. Simpson, G. Plotkin

引用次数: 141

Assigning types to processes 为流程分配类型

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855782

N. Yoshida, M. Hennessy

{"title":"Assigning types to processes","authors":"N. Yoshida, M. Hennessy","doi":"10.1109/LICS.2000.855782","DOIUrl":"https://doi.org/10.1109/LICS.2000.855782","url":null,"abstract":"In wide area distributed systems it is now common for higher-order code to be transferred from one domain to another; the receiving host may initialise parameters and then execute the code in its local environment. We propose a fine-grained typing system for a higher-order /spl pi/-calculus which can be used to control the effect of such migrating code on local environments. Processes may be assigned different types depending on their intended use. This is in contrast to most of the previous work on typing processes where all processes are typed by a unique constant type, indicating essentially that they are well-typed relative to a particular environment. Our process type takes a form of an interface limiting the resources to which it has access, and the types at which they may be used. Allowing resource names to appear both in process types and process terms, as interaction ports, complicates the typing system considerably. For the development of a coherent typing system, we use a kinding technique, similar to that used by the subtyping of the system F, and order-theoretic properties of our subtyping relation. Various examples illustrate the use of our fine-grained typing system for distributed systems. As a specific application we define a new typed behavioural equivalence for the higher-order /spl pi/-calculus. The expressiveness of our types enables us to state and prove interesting identities between typed processes.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115877554","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}

引用次数: 69