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

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.最新文献

筛选
英文 中文
Formal verification at Intel 英特尔的正式验证
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210044
J. Harrison
{"title":"Formal verification at Intel","authors":"J. Harrison","doi":"10.1109/LICS.2003.1210044","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210044","url":null,"abstract":"As designs become more complex, formal verification techniques are becoming increasingly important in the hardware industry. Many different methods are used, ranging from propositional tautology checking up to use of interactive higher-order theorem provers. Our own work is mainly concerned with the formal verification of floating-point mathematical functions. As this paper illustrates, such applications require a rather general mathematical framework and the ability to automate special-purpose proof algorithms in a reliable way. Our work uses the public-domain interactive theorem prover HOL Light, and we claim that this and similar 'LCF-style' theorem provers are a good choice for such applications.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144612","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
Query evaluation on compressed trees 压缩树的查询求值
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210058
Markus Frick, Martin Grohe, Christoph E. Koch
{"title":"Query evaluation on compressed trees","authors":"Markus Frick, Martin Grohe, Christoph E. Koch","doi":"10.1109/LICS.2003.1210058","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210058","url":null,"abstract":"This paper studies the problem of evaluating unary (or node-selecting) queries on unranked trees compressed in a natural structure-preserving way, by the sharing of common subtrees. The motivation to study unary queries on unranked trees comes from the database field, where querying XML (Extensible Markup Language) documents, which can be considered as unranked labeled trees, is an important task. We give algorithms and complexity results for the evaluation of XPath and monadic datalog queries. Furthermore, we propose a new automata-theoretic formalism for querying trees and give algorithms for evaluating queries defined by such automata.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123484251","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}
引用次数: 86
An NP decision procedure for protocol insecurity with XOR 带异或的协议不安全性的NP决策过程
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210066
Yannick Chevalier, Ralf Küsters, M. Rusinowitch, Mathieu Turuani
{"title":"An NP decision procedure for protocol insecurity with XOR","authors":"Yannick Chevalier, Ralf Küsters, M. Rusinowitch, Mathieu Turuani","doi":"10.1109/LICS.2003.1210066","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210066","url":null,"abstract":"We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-called oracle rules, i.e., deduction rules that satisfy certain conditions. As an instance of this general framework, we ascertain that protocol insecurity is in NP for an intruder that can exploit the properties of the XOR operator. This operator is frequently used in cryptographic protocols but cannot be handled in most protocol models. An immediate consequence of our proof is that checking whether a message can be derived by an intruder (using XOR) is in P. We also apply our framework to an intruder that exploits properties of certain encryption modes such as cipher block chaining (CBC).","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129465696","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}
引用次数: 199
Intruder deductions, constraint solving and insecurity decision in presence of exclusive or 排除或存在下的入侵者演绎、约束求解和不安全决策
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210067
Hubert Comon-Lundh, Vitaly Shmatikov
{"title":"Intruder deductions, constraint solving and insecurity decision in presence of exclusive or","authors":"Hubert Comon-Lundh, Vitaly Shmatikov","doi":"10.1109/LICS.2003.1210067","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210067","url":null,"abstract":"We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties such as xor, we extend the conventional Dolev-Yao model by permitting the intruder to exploit these properties. We show that the ground reachability problem in NP for the extended intruder theories in the cases of xor and Abelian groups. This result follows from a normal proof theorem. Then, we show how to lift this result in the xor case: we consider a symbolic constraint system expressing the reachability (e.g., secrecy) problem for a finite number of sessions. We prove that such a constraint system is decidable, relying in particular on an extension of combination algorithms for unification procedures. As a corollary, this enables automatic symbolic verification of cryptographic protocols employing xor for a fixed number of sessions.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126754791","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}
引用次数: 193
Structural subtyping of non-recursive types is decidable 非递归类型的结构子类型是可确定的
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210049
Viktor Kunčak, M. Rinard
{"title":"Structural subtyping of non-recursive types is decidable","authors":"Viktor Kunčak, M. Rinard","doi":"10.1109/LICS.2003.1210049","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210049","url":null,"abstract":"We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of decidable theories. Let /spl Sigma/ be a language consisting of function symbol and let /spl Cscr/; (with a finite or infinite domain C) be an L-structure where L is a language consisting of relation symbols. We introduce the notion of /spl Sigma/-term-power of the structure /spl Cscr/; denoted /spl Pscr/;/sub /spl Sigma//(/spl Cscr/;). The domain of /spl Pscr/;/sub /spl Sigma//(/spl Cscr/;) is the set of /spl Sigma/-terms over the set C. /spl Pscr/;/sub /spl Sigma//(/spl Cscr/;) has one term algebra operation for each f /spl isin/ /spl Sigma/, and one relation for each r /spl isin/ L defined by lifting operations of /spl Cscr/; to terms over C. We extend quantifier for term algebras and apply the Feferman-Vaught technique for quantifier elimination in products to obtain the following result. Let K be a family of L-structures and K/sub P/ the family of their /spl Sigma/-term-powers. Then the validity of any closed formula F on K/sub P/ can be effectively reduced to the validity of some closed formula q(F) on K. Our result implies the decidability of the first-order theory of structural subtyping of non-recursive types with covariant constructors, and the construction generalizes to contravariant constructors as well.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126096980","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}
引用次数: 37
Micro-macro stack systems: a new frontier of elementary decidability for sequential systems 微宏叠加系统:序贯系统初等可判定性的新前沿
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210078
Nir Piterman, Moshe Y. Vardi
{"title":"Micro-macro stack systems: a new frontier of elementary decidability for sequential systems","authors":"Nir Piterman, Moshe Y. Vardi","doi":"10.1109/LICS.2003.1210078","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210078","url":null,"abstract":"We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack graphs are the configuration graphs of stack automata whose states are partitioned into micro and macro states. Nodes of the graph are configurations of the stack automaton where the state is a macro state. Edges of the graph correspond to the sequence of micro steps that the automaton makes between macro states. We prove that this class strictly contains the class of prefix-recognizable graphs. We give a direct automata-theoretic algorithm for model checking /spl mu/-calculus formulas over micro-macro stack graphs.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117120488","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}
引用次数: 4
Successor-invariance in the finite 有限情况下的后继不变性
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210054
Benjamin Rossman
{"title":"Successor-invariance in the finite","authors":"Benjamin Rossman","doi":"10.1109/LICS.2003.1210054","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210054","url":null,"abstract":"A first-order sentence /spl theta/ of vocabulary /spl sigma/ /spl cup/ {S} is successor-invariant in the finite if for every finite /spl sigma/-structure M and successor relations S/sub 1/ and S/sub 2/ on M, (M, S/sub 1/) /spl vDash/ /spl theta/ /spl hArr/ (M, S/sub 2/) /spl vDash/ /spl theta/. In this paper I give an example of a non-first-order definable class of finite structures, which is, however, defined by a successor-invariant first-order sentence. This strengthens a corresponding result for order-invariant in the finite, due to Y. Gurevich.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130124141","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}
引用次数: 10
On program equivalence in languages with ground-type references 具有基类型引用的语言中的程序等价性
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210050
A. Murawski
{"title":"On program equivalence in languages with ground-type references","authors":"A. Murawski","doi":"10.1109/LICS.2003.1210050","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210050","url":null,"abstract":"Using game semantics we prove that program equivalence is undecidable in finitary Idealized Algol with active expressions as well as in its call-by-value counterpart. It is also shown that strategies corresponding to Idealized Algol terms of respectively second, third and higher orders define exactly regular, context-free and recursively enumerable languages.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129503080","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}
引用次数: 34
Orienting equalities with the Knuth-Bendix order 用Knuth-Bendix顺序定向等式
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210047
Konstantin Korovin, A. Voronkov
{"title":"Orienting equalities with the Knuth-Bendix order","authors":"Konstantin Korovin, A. Voronkov","doi":"10.1109/LICS.2003.1210047","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210047","url":null,"abstract":"Orientability of systems of equalities is the following problem: given a system of equalities s/sub 1/ /spl sime/ t/sub 1/, . . . , s/sub n/ /spl sime/ t/sub n/, does there exist a simplification ordering > which orients the system, that is for every i /spl isin/ {1, ..., n}, either s/sub i/ > t/sub i/ or t/sub i/ > s/sub i/. This problem can be used in rewriting for finding a canonical rewrite system for a system of equalities and in theorem proving for adjusting simplification orderings during completion. We prove that (rather surprisingly) the problem can be solved in polynomial time when we restrict ourselves to the Knuth-Bendix orderings.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127916029","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
Proof nets for unit-free multiplicative-additive linear logic (extended abstract) 无单位乘加线性逻辑的证明网(扩展抽象)
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210039
Dominic J. D. Hughes, R. J. V. Glabbeek
{"title":"Proof nets for unit-free multiplicative-additive linear logic (extended abstract)","authors":"Dominic J. D. Hughes, R. J. V. Glabbeek","doi":"10.1109/LICS.2003.1210039","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210039","url":null,"abstract":"A cornerstone of the theory of proof nets for unit-freemultiplicative linear logic (MLL) is the abstract representation of cut-freeproofs modulo inessential commutations of rules. The only knownextension to additives, based on monomial weights, fails topreserve this key feature: a host of cut-free monomial proof nets cancorrespond to the same cut-free proof. Thus the problem offinding a satisfactory notion of proof net for unit-freemultiplicative-additive linear logic (MALL) has remained open since theincep-tion of linear logic in 1986. We present a new definition of MALLproof net which remains faithful to the cornerstone of the MLLtheory.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131996891","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}
引用次数: 10
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信