Proceedings 16th Annual IEEE Symposium on Logic in Computer Science最新文献_第2页

A symbolic labelled transition system for coinductive subtyping of F/sub /spl mu//spl les// types F/sub /spl mu//spl les//型共归纳亚型的符号标记过渡系统

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932508

A. Jeffrey, DePaul

引用次数: 4

On definability of order in logic with choice 论有选择逻辑中顺序的可定义性

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932493

T. Huuskonen, Tapani Hyttinen

引用次数: 0

Safety and liveness in branching time 安全活在枝桠年华

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932512

P. Manolios, Richard J. Trefler

{"title":"Safety and liveness in branching time","authors":"P. Manolios, Richard J. Trefler","doi":"10.1109/LICS.2001.932512","DOIUrl":"https://doi.org/10.1109/LICS.2001.932512","url":null,"abstract":"Extends B. Alpern & F.B. Schneider's linear time characterization of safety and liveness properties to branching time, where properties are sets of trees. We define two closure operators that give rise to the following four extremal types of properties: universally safe, existentially safe, universally live and existentially live. The distinction between universal and existential properties captures the difference between the CTL (computation tree logic) path quantifiers /spl forall/ (for all paths) and /spl exist/ (there is a path). We show that every branching time property is the intersection of an existentially safe property and an existentially live property, a universally safe property and a universally live property, and an existentially safe property and a universally live property. We also examine how our closure operators behave on linear-time properties. We then focus on sets of finitely branching trees and show that our closure operators agree on linear-time safety properties. Furthermore, if a set of trees is given implicitly as a Rabin tree automaton /spl Bscr/, we show that it is possible to compute the Rabin automata corresponding to the closures of the language of /spl Bscr/. This allows us to effectively compute /spl Bscr//sub safe/ and /spl Bscr//sub live/ such that the language of /spl Bscr/ is the intersection of the languages of /spl Bscr//sub safe/ and /spl Bscr//sub live/. As above, /spl Bscr//sub safe/ and /spl Bscr//sub live/ can be chosen so that their languages are existentially safe and existentially live, universally safe and universally live, or existentially safe and universally live.","PeriodicalId":366313,"journal":{"name":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126031902","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}

引用次数: 28

Probabilistic polynomial-time process calculus and security protocol analysis 概率多项式时间过程演算与安全协议分析

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932477

John C. Mitchell, A. Ramanathan, A. Scedrov, Vanessa Teague

引用次数: 20

Perturbed Turing machines and hybrid systems 扰动图灵机和混合系统

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932503

E. Asarin, A. Bouajjani

引用次数: 55

The hierarchy inside closed monadic /spl Sigma//sub 1/ collapses on the infinite binary tree 闭一元/spl Sigma//sub 1/内的层次结构在无限二叉树上崩溃

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932492

A. Arnold, G. Lenzi, J. Marcinkowski

引用次数: 1

Normalization by evaluation for typed lambda calculus with coproducts 带余积的类型化λ演算的归一化求值

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932506

Thorsten Altenkirch, P. Dybjer, M. Hofmann, P. Scott

引用次数: 96

Intuitionistic linear logic and partial correctness 直觉线性逻辑和部分正确性

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932502

D. Kozen, J. Tiuryn

引用次数: 4

Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems 统一字问题多项式时间可决性的相关语义和证明理论概念

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932485

H. Ganzinger

引用次数: 43

Deterministic generators and games for LTL fragments LTL片段的确定性生成器和游戏

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932505

R. Alur, S. L. Torre

{"title":"Deterministic generators and games for LTL fragments","authors":"R. Alur, S. L. Torre","doi":"10.1109/LICS.2001.932505","DOIUrl":"https://doi.org/10.1109/LICS.2001.932505","url":null,"abstract":"Deciding infinite two-player games on finite graphs with the winning condition specified by a linear temporal logic (LTL) formula is known to be 2EXPTIME-complete. In this paper, we identify LTL fragments of lower complexity. Solving LTL games typically involves a doubly-exponential translation from LTL formulas to deterministic /spl omega/-automata. First, we show that the longest distance (length of the longest simple path) of the generator is also an important parameter, by giving an O(d log n)-space procedure to solve a Buchi game on a graph with n vertices and longest distance d. Then, for the LTL fragment with only eventualities and conjunctions, we provide a translation to deterministic generators of exponential size and linear longest distance, show both of these bounds to be optimal and prove the corresponding games to be PSPACE-complete. Introducing \"next\" modalities in this fragment, we provide a translation to deterministic generators that is still of exponential size but also with exponential longest distance, show both bounds to be optimal and prove the corresponding games to be EXPTIME-complete. For the fragment resulting by further adding disjunctions, we provide a translation to deterministic generators of doubly-exponential size and exponential longest distance, show both bounds to be optimal and prove the corresponding games to be EXPSPACE. Finally, we show tightness of the double-exponential bound on the size as well as the longest distance for deterministic generators for LTL, even in the absence of \"next\" and \"until\" modalities.","PeriodicalId":366313,"journal":{"name":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124251797","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}

引用次数: 151