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

A decision procedure for term algebras with queues 具有队列的项代数的决策过程

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

T. Rybina, A. Voronkov

引用次数: 52

From the church-turing thesis to the first-order algorithm theorem 从丘奇图灵论题到一阶算法定理

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

Saul A. Kripke

{"title":"From the church-turing thesis to the first-order algorithm theorem","authors":"Saul A. Kripke","doi":"10.1109/LICS.2000.855766","DOIUrl":"https://doi.org/10.1109/LICS.2000.855766","url":null,"abstract":"This paper was conceived in reaction to Soare's paper in the Bulletin of Symbolic Logic 1996. From Godel in the 30s, to Gandy, Soare, and many others today, the obvious fundamental importance of Turing's work both for logic and computer science has led to an overemphasis on his paper as the justification for the Church-Turing thesis. It is even said that Turing proved a theorem that every ?function computable by a human being in a routine way? is Turing computable. Though several have endorsed this claim, it is hard for me to see ho w it could really meet modern standards of rigor. Moreover, Gandy worried that Turing's analysis did not cover modern computers, which may use parallel processing. He proved a very complicated result (now much simplified by Byrne and Sieg) to deal with this. My paper argues that an alternative approach {once this subject has been properly analyzed and delimited} allows us to state a simple theorem that covers computations either by machines or by humans. A thesis believed by all contemporary logicians is needed for this theorem to cover all likely future cases. It should be obvious that the theorem covers all computations known hitherto.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"1 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":"124736403","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

Dominator trees and fast verification of proof nets 支配树和快速验证证明网

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

A. Murawski, C. Ong

引用次数: 33

Computational complexity of some problems involving congruences on algebras 代数上若干同余问题的计算复杂性

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

C. Bergman, G. Slutzki

引用次数: 4

Better is better than well: on efficient verification of infinite-state systems 好胜于好:关于无穷状态系统的有效验证

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

P. Abdulla, Aletta Nylén

{"title":"Better is better than well: on efficient verification of infinite-state systems","authors":"P. Abdulla, Aletta Nylén","doi":"10.1109/LICS.2000.855762","DOIUrl":"https://doi.org/10.1109/LICS.2000.855762","url":null,"abstract":"Many existing algorithms for model checking of infinite-state systems operate on constraints which are used to represent (potentially infinite) sets of states. A general powerful technique which can be employed for proving termination of these algorithms is that of well quasi-orderings. Several methodologies have been proposed for derivation of new well quasi-ordered constraint systems. However, many of these constraint systems suffer from a \"constraint explosion problem\", as the number of the generated constraints grows exponentially with the size of the problem. We demonstrate that a refinement of the theory of well quasi-orderings, called the theory of better quasi-orderings is more appropriate for symbolic model checking, since it allows inventing constraint systems which are both well quasi-ordered and compact. We apply our methodology to derive new constraint systems for verification of systems with unboundedly many clocks, broadcast protocols, lossy channel systems, and integral relational automata. The new constraint systems are exponentially more succinct than existing ones, and their well quasi-ordering cannot be shown by previous methods in the literature.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"61 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":"127096976","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}

引用次数: 61

Efficient and flexible matching of recursive types 有效和灵活的递归类型匹配

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

J. Palsberg, Tian Zhao

引用次数: 22

Satisfiability testing: recent developments and challenge problems 可满足性测试:最近的发展和挑战问题

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

B. Selman

引用次数: 8

A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering 具有Knuth-Bendix序的项代数的存在论判定程序

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

Konstantin Korovin, A. Voronkov

引用次数: 26