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

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science最新文献

筛选
英文 中文
Order-incompleteness and finite lambda models 序不完备和有限模型
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561459
P. Selinger
{"title":"Order-incompleteness and finite lambda models","authors":"P. Selinger","doi":"10.1109/LICS.1996.561459","DOIUrl":"https://doi.org/10.1109/LICS.1996.561459","url":null,"abstract":"Many familiar models of the type-free lambda calculus are constructed by order theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory of /spl beta/- or /spl beta//spl eta/-conversion, the partial order is trivial on term denotations. Equivalently, the open and closed term algebras of the type-free lambda calculus cannot be non-trivially partially ordered. Our second result is a syntactical characterization, in terms of so-called generalized Mal'cev operators, of those lambda theories which cannot be induced by any non-trivially partially ordered model. We also consider a notion of finite models for the type-free lambda calculus. We introduce partial syntactical lambda models, which are derived from Plotkin's syntactical models of reduction, and we investigate how these models can be used as practical tools for giving finitary proofs of term inequalities. We give a 3-element model as an example.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116853739","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
General decidability theorems for infinite-state systems 无限状态系统的一般可决性定理
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561359
P. Abdulla, Kārlis Čerāns, B. Jonsson, Yih-Kuen Tsay
{"title":"General decidability theorems for infinite-state systems","authors":"P. Abdulla, Kārlis Čerāns, B. Jonsson, Yih-Kuen Tsay","doi":"10.1109/LICS.1996.561359","DOIUrl":"https://doi.org/10.1109/LICS.1996.561359","url":null,"abstract":"Over the last few years there has been an increasing research effort directed towards the automatic verification of infinite state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems), which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a well-ordered and well-founded preorder such that the transition relation is \"monotonic\" (is a simulation) with respect to the preorder. We show that the following properties are decidable for well-structured systems: reachability; eventuality; and simulation. We also describe how these general principles subsume several decidability results from the literature about timed automata, relational automata, Petri nets, and lossy channel systems.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114952762","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}
引用次数: 481
Integration in Real PCF 集成在Real PCF
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561453
A. Edalat, M. Escardó
{"title":"Integration in Real PCF","authors":"A. Edalat, M. Escardó","doi":"10.1109/LICS.1996.561453","DOIUrl":"https://doi.org/10.1109/LICS.1996.561453","url":null,"abstract":"Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it is possible to compute an arbitrarily small rational interval containing the real number in a sufficiently large number of steps. Based on a domain-theoretic approach to integration, we show how to define integration in Real PCF. We propose two approaches to integration in Real PCF. One consists in adding integration as primitive. The other consists in adding a primitive for maximization of functions and then recursively defining integration from maximization. In both cases we have an adequacy theorem for the corresponding extension of Real PCF. Moreover based on previous work on Real PCF definability, we show that Real PCF extended with the maximization operator is universal, which implies that it is also fully abstract.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116805840","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}
引用次数: 43
Complexity analysis based on ordered resolution 基于有序解析的复杂性分析
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561462
D. Basin, H. Ganzinger
{"title":"Complexity analysis based on ordered resolution","authors":"D. Basin, H. Ganzinger","doi":"10.1109/LICS.1996.561462","DOIUrl":"https://doi.org/10.1109/LICS.1996.561462","url":null,"abstract":"We define order locality to be a property of clauses relative to a term ordering. This property is a kind of generalization of the subformula property for proofs where terms arising in proofs are bounded, under the given ordering, by terms appearing in the goal clause. We show that when a clause set is order local, then the complexity of its ground entailment problem is a function of its structure (e.g., full versus Horn clauses), and the ordering used. We prove that, in many cases, order locality is equivalent to a clause set being saturated under ordered resolution. This provides a means of using standard resolution theorem provers for testing order locality and transforming non-local clause sets into local ones. We have used the Saturate system to automatically establish complexity bounds for a number of nontrivial entailment problems relative to complexity classes which include polynomial and exponential time and co-NP.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134355025","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}
引用次数: 44
Reduction-free normalisation for a polymorphic system 多态系统的无约化归一化
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561309
Thorsten Altenkirch, M. Hofmann, T. Streicher
{"title":"Reduction-free normalisation for a polymorphic system","authors":"Thorsten Altenkirch, M. Hofmann, T. Streicher","doi":"10.1109/LICS.1996.561309","DOIUrl":"https://doi.org/10.1109/LICS.1996.561309","url":null,"abstract":"We give a semantical proof that every term of a combinator version of system F has a normal form. As the argument is entirely formalisable in an impredicative constructive type theory a reduction-free normalisation algorithm can be extracted from this. The proof is presented as the construction of a model of the calculus inside a category of presheaves. Its definition is given entirely in terms of the internal language.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123445013","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}
引用次数: 31
On the expressive power of variable-confined logics 论变量受限逻辑的表达能力
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561446
Phokion G. Kolaitis, Moshe Y. Vardi
{"title":"On the expressive power of variable-confined logics","authors":"Phokion G. Kolaitis, Moshe Y. Vardi","doi":"10.1109/LICS.1996.561446","DOIUrl":"https://doi.org/10.1109/LICS.1996.561446","url":null,"abstract":"In this paper we study the comparative expressive power of variable-confined logics, that is, logics with a fixed finite number of variables. This is motivated by the fact that the number of variables is considered a logical resource in descriptive complexity theory. We consider the expressive power of the logics FO/sup k/ (first-order logic with k variables), LFP/sup k/ (LFP with k variables, appropriately defined), and /spl Lscr//sub /spl infin/w//sup k/ (infinitary logic with k variables) over classes of finite structures. While the definitions of FO/sup k/ and /spl Lscr//sub /spl infin/w//sup k/ are quite clear, it turns out that ramifying LFP is a more delicate matter. We define LFP/sup k/ in terms of systems of least fixpoints, i.e., instead of taking the least fixpoint of a single positive first-order formula, we consider simultaneous least fixpoints of a vector of positive first-order formulas. As evidence that LFP/sup k/, k/spl ges/1, is the right ramification of LFP we offer two main results. The first is a new proof of a theorem by A. Dawar et al. (1995) to the effect that equivalence classes of finite structures with respect to the logic /spl Lscr//sub /spl infin/w//sup k/ are expressible in FO/sup k/. The second result, novel and technically difficult, is a characterization for each k/spl ges/1 of the collapse of /spl Lscr//sub /spl infin/w//sup k/ to FO/sup k/ in terms of boundedness of LFP/sup k/. More precisely, we establish the following stronger version of McColm's second conjecture: /spl Lscr//sub /spl infin/w//sup k/=FO/sup k/ on a class C of finite structures if and only if LFP/sup k/ is uniformly bounded on C.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125445250","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}
引用次数: 21
An algebraic theory of process efficiency 过程效率的代数理论
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561304
V. Natarajan, R. Cleaveland
{"title":"An algebraic theory of process efficiency","authors":"V. Natarajan, R. Cleaveland","doi":"10.1109/LICS.1996.561304","DOIUrl":"https://doi.org/10.1109/LICS.1996.561304","url":null,"abstract":"This paper presents a testing-based semantic theory for reasoning about the efficiency of concurrent systems as measured in terms of the amount of their internal activity. The semantic preorders are given an algebraic characterization, and their optimality is established by means of a full abstractness result. They are also shown to subsume existing bisimulation-based efficiency preorders. An example is provided to illustrate the utility of this approach.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121829089","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}
引用次数: 33
DATALOG SIRUPs uniform boundedness is undecidable DATALOG siup的均匀有界性是不可确定的
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561299
J. Marcinkowski
{"title":"DATALOG SIRUPs uniform boundedness is undecidable","authors":"J. Marcinkowski","doi":"10.1109/LICS.1996.561299","DOIUrl":"https://doi.org/10.1109/LICS.1996.561299","url":null,"abstract":"DATALOG is the paradigmatic database query language. If it is possible to eliminate recursion from a DATALOG program then it is uniformly bounded. Since uniformly bounded programs can be executed in parallel constant time, the possibility of automated boundedness detection is an important issue, and has been studied in many papers. In this paper we solve one of the most famous open problems in the theory of deductive databases (see e.g. P.C. Kanellakis, Elements of Relational Database Theory in Handbook of Theoretical Computer Science) showing that uniform boundedness is undecidable for single rule programs (called also sirups).","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114759611","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}
引用次数: 12
Model-checking of correctness conditions for concurrent objects 并发对象正确性条件的模型检查
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561322
R. Alur, K. McMillan, D. Peled
{"title":"Model-checking of correctness conditions for concurrent objects","authors":"R. Alur, K. McMillan, D. Peled","doi":"10.1109/LICS.1996.561322","DOIUrl":"https://doi.org/10.1109/LICS.1996.561322","url":null,"abstract":"The notions of serializability, linearizability and sequential consistency are used in the specification of concurrent systems. We show that the model checking problem for each of these properties can be cast in terms of the containment of one regular language in another regular language shuffled using a semi-commutative alphabet. The three model checking problems are shown to be, respectively, in PSPACE, in EXPSPACE, and undecidable.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133891929","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}
引用次数: 133
The theory of hybrid automata 混合自动机理论
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561342
T. Henzinger
{"title":"The theory of hybrid automata","authors":"T. Henzinger","doi":"10.1109/LICS.1996.561342","DOIUrl":"https://doi.org/10.1109/LICS.1996.561342","url":null,"abstract":"We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128524306","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}
引用次数: 2454
首页 上一页 下一页 尾页
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学术官方微信