Search Results - "2011 IEEE 26th Annual Symposium on Logic in Computer Science"

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma by Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.

“…Dickson's Lemma is a simple yet powerful tool widely used in decidability proofs, especially when dealing with counters or related data structures in…”
Get full text

Linear Dependent Types and Relative Completeness by Dal Lago, Ugo, Gaboardi, M.

“…A system of linear dependent types for the lambda calculus with full higher-order recursion, called dℓPCF, is introduced and proved sound and relatively…”
Get full text

Concurrent Strategies by Rideau, S., Winskel, G.

“…A bi category of very general nondeterministic concurrent games and strategies is presented. The intention is to formalize distributed games in which both…”
Get full text

Automata with Group Actions by Bojanczyk, M., Klin, B., Lasota, S.

“…Our motivating question is a My hill-Nerode theorem for infinite alphabets. We consider several kinds of those: alphabets whose letters can be compared only…”
Get full text

Temporal Specifications with Accumulative Values by Boker, U., Chatterjee, K., Henzinger, T. A., Kupferman, O.

“…There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of…”
Get full text

The Dichotomy for Conservative Constraint Satisfaction Problems Revisited by Barto, L.

“…A central open question in the study of non-uniform constraint satisfaction problems (CSPs) is the dichotomy conjecture of Feder and Vardi stating that the CSP…”
Get full text

First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees by Birkedal, L., Mogelberg, R. E., Schwinghammer, J., Stovring, K.

“…We present the topos S of trees as a model of guarded recursion. We study the internal dependently-typed higher-order logic of S and show that S models two…”
Get full text

Ultrametric Semantics of Reactive Programs by Krishnaswami, N. R., Benton, N.

“…We describe a denotational model of higher-order functional reactive programming using ultra metric spaces and non expansive maps, which provide a natural…”
Get full text

Noncomputable Conditional Distributions by Ackerman, N. L., Freer, C. E., Roy, D. M.

“…We study the computability of conditional probability, a fundamental notion in probability theory and Bayesian statistics. In the elementary discrete setting,…”
Get full text

Semantics of Higher-Order Quantum Computation via Geometry of Interaction by Hasuo, I., Hoshino, N.

“…While much of the current study on quantum computation employs low-level formalisms such as quantum circuits, several high-level languages/calculi have been…”
Get full text

The Computational Meaning of Probabilistic Coherence Spaces by Ehrhard, T., Pagani, M., Tasson, C.

“…We study the probabilistic coherent spaces - a denotational semantics interpreting programs by power series with non negative real coefficients. We prove that…”
Get full text

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes by Brazdil, T., Brozek, V., Chatterjee, K., Forejt, V., Kucera, A.

“…We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and…”
Get full text

A Type System for Complexity Flow Analysis by Marion, J-Y

“…We propose a type system for an imperative programming language, which certifies program time bounds. This type system is based on secure flow information…”
Get full text

Forcing as a Program Transformation by Miquel, A.

“…This paper is a study of the forcing translation through the proofs as programs correspondence in classical logic, following the methodology introduced by…”
Get full text

Game Semantics for Good General References by Murawski, A. S., Tzevelekos, N.

“…We present a new fully abstract and effectively presentable denotational model for RefML, a paradigmatic higher-order programming language combining…”
Get full text

Decidability of Definability by Bodirsky, M., Pinsker, M., Tsankov, T.

“…For a fixed infinite structure Γ with finite signature τ, we study the following computational problem: input are quantifier-free first-order τ-formulas φ 0 ,…”
Get full text

Continuous Random Variables by Goubault-Larrecq, J., Varacca, D.

“…We introduce the domain of continuous random variables (CRV) over a domain, as an alternative to Jones and Plotkin's probabilistic power domain. While no known…”
Get full text

The Ultimate Undecidability Result for the Halpern-Shoham Logic by Marcinkowski, J., Michaliszyn, J.

“…The Halpern-Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to classify fragments of this beautiful logic with…”
Get full text

Regular Repair of Specifications by Benedikt, M., Puppis, G., Riveros, C.

“…What do you do if a computational object (e.g. program trace) fails a specification? An obvious approach is to perform repair: modify the object minimally to…”
Get full text

What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL by Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.

“…The introduction of Halpern and Shoham's modal logic of intervals (later on called HS) dates back to 1986. Despite its natural semantics, this logic is…”
Get full text