21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)

12-15 Aug. 2006

Filter Results

Displaying Results 1 - 25 of 52
  • 21st Annual IEEE Symposium on Logic in Computer Science - Cover

    Publication Year: 2006, Page(s): c1
    Request permission for reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • 21st Annual IEEE Symposium on Logic in Computer Science - Title

    Publication Year: 2006, Page(s):i - iii
    Request permission for reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • 21st Annual IEEE Symposium on Logic in Computer Science - Copyright

    Publication Year: 2006, Page(s): iv
    Request permission for reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • 21st Annual IEEE Symposium on Logic in Computer Science - TOC

    Publication Year: 2006, Page(s):v - viii
    Request permission for reuse | PDF file iconPDF (203 KB)
    Freely Available from IEEE
  • Foreward

    Publication Year: 2006, Page(s): ix
    Request permission for reuse | PDF file iconPDF (124 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2006, Page(s): x
    Request permission for reuse | PDF file iconPDF (116 KB)
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2006, Page(s): xi
    Request permission for reuse | PDF file iconPDF (80 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2006, Page(s): xii
    Request permission for reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • Formal Verification of Infinite State Systems Using Boolean Methods

    Publication Year: 2006, Page(s):3 - 4
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (81 KB) | HTML iconHTML

    The UCLID project seeks to develop formal verification tools for infinite-state systems having a degree of automation comparable to that of model checking tools for finite-state systems. The UCLID modeling language describes systems where the state variables are Booleans, integers, and functions mapping integers to integers or Booleans. The verifier supports several forms of verification for provi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-Variable Logic on Words with Data

    Publication Year: 2006, Page(s):7 - 16
    Cited by:  Papers (33)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (245 KB) | HTML iconHTML

    In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semistructured data, timed automata and extended temporal logics. It is shown that satisfiability for the two-variable first-order logic FO<sup>2</sup>(~,&lt;,+1) is decidable over finite and over infinite data wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LTL with the Freeze Quantifier and Register Automata

    Publication Year: 2006, Page(s):17 - 26
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Temporal logics, first-order logics, and automata over data words have recently attracted considerable attention. A data word is a word over a finite alphabet, together with a datum (an element of an infinite domain) at each position. Examples include timed words and XML documents. To refer to the data, temporal logics are extended with the freeze quantifier, first-order logics with predicates ove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed-Parameter Hierarchies inside PSPACE

    Publication Year: 2006, Page(s):27 - 36
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    Treewidth measures the "tree-likeness" of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this work, we study the impact of treewidth bounds on QBF, a canonical PSPACE-complete problem. This problem is known to be fixed-parameter tractable if both the treewidth and alternation depth are taken as parameters. We show here t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Boundedness Problem for Monadic Universal First-Order Logic

    Publication Year: 2006, Page(s):37 - 48
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula phi(X, x), positive in X, decide whether there is a uniform finite bound on the least fixed point recursion based on phi. Few fragments of FO are known to have a decidable boundedness problem; boundedness is known to be undecidable for many fragments. We here show that monadic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics

    Publication Year: 2006, Page(s):49 - 58
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    We introduce a mathematical structural operational semantics that yields a congruence result for bisimilarity and is suitable for investigating rule formats for name-passing systems. Indeed, we instantiate this general abstract model theory in a framework of nominal sets and extract from it a GSOS-like rule format for name-passing process calculi for which the associated notion of behavioural equi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus

    Publication Year: 2006, Page(s):59 - 68
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    We present an expressiveness study of linearity and persistence of processes. We choose the pi-calculus, one of the main representatives of process calculi, as a framework to conduct our study. We consider four fragments of the pi-calculus. Each one singles out a natural source of linearity/persistence also present in other frameworks such as concurrent constraint programming (CCP), linear CCP, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Saturated Semantics for Reactive Systems

    Publication Year: 2006, Page(s):69 - 80
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules (i.e., unlabelled transition rules) are often more natural. This leads to the question of how behavioural equivalences (bisimilarity, trace equivalence, etc.) defined for LTS can be transferred to unlabelled transition sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Model-Checking Trees Generated by Higher-Order Recursion Schemes

    Publication Year: 2006, Page(s):81 - 90
    Cited by:  Papers (44)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and whether homogeneously typed or not) is n-EXPTIME complete, for every nges0. It follows that the monadic second-order theories of these trees are decidable. There are three major ingredients. The first is a certain transfer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monadic Chain Logic Over Iterations and Applications to Pushdown Systems

    Publication Year: 2006, Page(s):91 - 100
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (218 KB) | HTML iconHTML

    Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems. It is shown that the monadic chain theory of the iteration of a structure A (in the sense of Shelah and Stupp) is decidable in case the first-order theory of the structure A is decidable. This result fails if Muchnik's c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Automata-Theoretic Approach for Model Checking Threads for LTL Propert

    Publication Year: 2006, Page(s):101 - 110
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    In this paper, we propose a new technique for the verification of concurrent multi-threaded programs. In general, the problem is known to be undecidable even for programs with just two threads. However, we exploit the observation that, in practice, a large fraction of concurrent programs can either be modeled as pushdown systems communicating solely using locks or can be reduced to such systems by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Typability for Rank-2 Intersection Types with Polymorphic Recursion

    Publication Year: 2006, Page(s):111 - 122
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context free language (CFL) graph problem, which may be of independent interest, and reduction from the boundedness problem for Turing machines. We also show a property of the type system which, in conjunction with the undecidabi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adapting Logics

    Publication Year: 2006, Page(s): 123
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (63 KB) | HTML iconHTML

    In this paper the author plans to survey some of the adaptations and variations of logic that have been introduced for various purposes. For obvious reasons, we concentrate mainly on purposes related to computer science and on adaptations that have played a role in the research. Along the way, the author discusses some open problems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing Digital Rights using Linear Logic

    Publication Year: 2006, Page(s):127 - 136
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (181 KB) | HTML iconHTML

    Digital music players protect songs by enforcing licenses that convey specific rights for individual songs or groups of songs. For licenses specified in industry, we show that deciding whether a license authorizes a sequence of actions is NP-complete, with a restricted version of the problem solvable efficiently using a reduction to maximum network flow. The authorization algorithm used in industr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variables as Resource in Hoare Logics

    Publication Year: 2006, Page(s):137 - 146
    Cited by:  Papers (15)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (225 KB) | HTML iconHTML

    Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a program's use of variables. We show that it admits translations of proofs in Hoare logic, thereby showing that nothing is lost, and also that it admits proofs of some programs outside the scope of Hoare logic. We include a t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Independence and Concurrent Separation Logic

    Publication Year: 2006, Page(s):147 - 156
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by concurrent separation logic that emphasizes the process-environment duality inherent in such rely-guarantee reasoning. Soundness of the rules of concurrent separation logic with respect to this definition of validity is shown... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic

    Publication Year: 2006, Page(s):157 - 168
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    We establish a match between two broad approaches to reasoning about programs: modal (dynamic logic) proofs on the one hand, and explicit higher-order reference to program semantics, on the other. We show that Pratt-Segerberg's first-order dynamic logic DL proves precisely program properties that are provable in second-order logic with set-existence restricted to a natural class of formulas, well-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.