2008 23rd Annual IEEE Symposium on Logic in Computer Science最新文献_第4页

Reachability Games and Game Semantics: Comparing Nondeterministic Programs 可达性游戏和游戏语义:比较不确定性程序

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-06-24 DOI: 10.1109/LICS.2008.24

A. Murawski

{"title":"Reachability Games and Game Semantics: Comparing Nondeterministic Programs","authors":"A. Murawski","doi":"10.1109/LICS.2008.24","DOIUrl":"https://doi.org/10.1109/LICS.2008.24","url":null,"abstract":"We investigate the notions of may- and must-approximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both using its game model. Notably, must-approximation is captured by a novel preorder on nondeterministic strategies, whose definition is formulated in terms of winning regions in a reachability game. The game is played on traces of one of the strategies and its objective is reaching a complete position without encountering any divergences. The concrete accounts of may- and must-approximation make it possible to derive tight complexity bounds for the corresponding decision problems in the finitary (finite datatypes) variant EIAf of Erratic Idealized Algol. In fact we give a complete classification of the complexity of may- and must-approximation for fragments of EIAf of bounded type order (for terms in beta-normal form). The complexity of the decidable cases ranges from PSPACE to 2-EXPTIME for may-approximation and from EXPSPACE to 3-EXPTIME for must-approximation. Our decidability results rely on a representation theorem for nondeterministic strategies which, for a given term, yields a single (finite or visibly pushdown) automaton capturing both traces and divergences of the corresponding strategy with two distinct sets of final states. The decision procedures producing optimal bounds incorporate numerous automata-theoretic techniques: complementation, determinization, computation of winning regions in reachability games over finite and pushdown graphs as well as product constructions. We see our work as a starting point of research that relates game semantics with other game-based theories.","PeriodicalId":298300,"journal":{"name":"2008 23rd Annual IEEE Symposium on Logic in Computer Science","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134089768","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

On the Expressiveness and Complexity of Randomization in Finite State Monitors 有限状态监控中随机化的表达性和复杂性

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-06-24 DOI: 10.1145/1552285.1552287

Rohit Chadha, A. Sistla, Mahesh Viswanathan

引用次数: 33

Types for Hereditary Permutators 遗传置换的类型

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-06-24 DOI: 10.1109/LICS.2008.18

M. Tatsuta

引用次数: 3

Structural Logical Relations 结构逻辑关系

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-06-24 DOI: 10.1109/LICS.2008.44

C. Schürmann, Jeffrey Sarnat

引用次数: 27

The Satisfiability Problem for Probabilistic CTL 概率CTL的可满足性问题

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-06-24 DOI: 10.1109/LICS.2008.21

T. Brázdil, Vojtěch Forejt, Jan Křetínský, A. Kucera

{"title":"The Satisfiability Problem for Probabilistic CTL","authors":"T. Brázdil, Vojtěch Forejt, Jan Křetínský, A. Kucera","doi":"10.1109/LICS.2008.21","DOIUrl":"https://doi.org/10.1109/LICS.2008.21","url":null,"abstract":"We study the satisfiability problem for qualitative PCTL (probabilistic computation tree logic), which is obtained from \"ordinary\" CTL by replacing the EX, AX, EU, and AU operators with their qualitative counterparts X > 0, X = 1, U > 0, and U = 1, respectively. As opposed to CTL, qualitative PCTL does not have a small model property, and there are even qualitative PCTL formulae which have only infinite- state models. Nevertheless, we show that the satisfiability problem for qualitative PCTL is EXPTIME-complete and we give an exponential-time algorithm which for a given formula phi computes a finite description of a model (if it exists), or answers \"not satisfiable\" (otherwise). We also consider the finite satisfiability problem and provide analogous results. That is, we show that the finite satisfiability problem for qualitative PCTL is EXPTIME-complete, and every finite satisfiable formula has a model of an exponential size which can effectively be constructed in exponential time. Finally, we give some results about the quantitative PCTL, where the numerical bounds in probability constraints can be arbitrary rationals between 0 and 1. We prove that the problem whether a given quantitative PCTL formula phi has a model of the branching degree at most k, where k > 2 is an arbitrary but fixed constant, is highly undecidable. We also show that every satisfiable formula phi has a model with branching degree at most phi + 2. However, this does not yet imply the undecidability of the satisfiability problem for quantitative PCTL, and we in fact conjecture the opposite.","PeriodicalId":298300,"journal":{"name":"2008 23rd Annual IEEE Symposium on Logic in Computer Science","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129193831","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}

引用次数: 41

Correctness of Multiplicative Additive Proof Structures is NL-Complete 乘法加性证明结构的正确性是nl完全的

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-06-24 DOI: 10.1109/LICS.2008.20

Paulin Jacobé de Naurois, Virgile Mogbil

引用次数: 6

Mechanizing the Metatheory of LF LF元理论的机械化

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-04-10 DOI: 10.1145/1877714.1877721

Christian Urban, J. Cheney, Stefan Berghofer

引用次数: 34

The Geometry of Interaction of Differential Interaction Nets 微分相互作用网的相互作用几何

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-04-09 DOI: 10.1109/LICS.2008.23

M. D. Falco

引用次数: 6

On the Axiomatizability of Impossible Futures: Preorder versus Equivalence 论不可能未来的公理化性:预购与等价

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-03-01 DOI: 10.1109/LICS.2008.13

Taolue Chen, W. Fokkink

引用次数: 13

Combining Generic Judgments with Recursive Definitions 将一般判断与递归定义相结合

2008 23rd Annual IEEE Symposium on Logic in Computer Science Pub Date : 2008-02-06 DOI: 10.1109/LICS.2008.33

Andrew Gacek, D. Miller, G. Nadathur

{"title":"Combining Generic Judgments with Recursive Definitions","authors":"Andrew Gacek, D. Miller, G. Nadathur","doi":"10.1109/LICS.2008.33","DOIUrl":"https://doi.org/10.1109/LICS.2008.33","url":null,"abstract":"Many semantical aspects of programming languages, such as their operational semantics and their type assignment calculi, are specified by describing appropriate proof systems. Recent research has identified two proof-theoretic features that allow direct, logic-based reasoning about such descriptions: the treatment of atomic judgments as fixed points (recursive definitions) and an encoding of binding constructs via generic judgments. However, the logics encompassing these two features have thus far treated them orthogonally: that is, they do not provide the ability to define object-logic properties that themselves depend on an intrinsic treatment of binding. We propose a new and simple integration of these features within an intuitionistic logic enhanced with induction over natural numbers and we show that the resulting logic is consistent. The pivotal benefit of the integration is that it allows recursive definitions to not just encode simple, traditional forms of atomic judgments but also to capture generic properties pertaining to such judgments. The usefulness of this logic is illustrated by showing how it can provide elegant treatments of object-logic contexts that appear in proofs involving typing calculi and of arbitrarily cascading substitutions that play a role in reducibility arguments.","PeriodicalId":298300,"journal":{"name":"2008 23rd Annual IEEE Symposium on Logic in Computer Science","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131312182","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}

引用次数: 58