Výsledky vyhľadávania - "2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science"

A Compositional Semantics for the Reversible p-Calculus Autor Cristescu, Ioana, Krivine, Jean, Varacca, Daniele

“…We introduce a labelled transition semantics for the reversible π-calculus. It is the first account of a compositional definition of a reversible calculus,…”
Získať plný text

Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL Autor Balbiani, Philippe, Herzig, Andreas, Troquard, Nicolas

“…We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propositional Assignments (DL-PA). The atomic programs of DL-PA are…”
Získať plný text

Regular Functions and Cost Register Automata Autor Alur, Rajeev, D'Antoni, Loris, Deshmukh, Jyotirmoy, Raghothaman, Mukund, Yifei Yuan

“…We propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and minimum), a…”
Získať plný text

Weighted Relational Models of Typed Lambda-Calculi Autor Laird, Jim, Manzonetto, Giulio, McCusker, Guy, Pagani, Michele

“…The category Rel of sets and relations yields one of the simplest denotational semantics of Linear Logic (LL). It is known that Rel is the biproduct completion…”
Získať plný text

Calculating the Fundamental Group of the Circle in Homotopy Type Theory Autor Licata, Daniel R., Shulman, Michael

“…Recent work on homotopy type theory exploits an exciting new correspondence between Martin-Lof's dependent type theory and the mathematical disciplines of…”
Získať plný text

One-Path Reachability Logic Autor Rosu, Grigore, Stefanescu, Andrei, Ciobâcá, Stefan, Moore, Brandon M.

“…This paper introduces (one-path) reachability logic, a language-independent proof system for program verification, which takes an operational semantics as…”
Získať plný text

Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes Autor Birkedal, Lars, Møgelberg, Rasmus Ejlers

“…Guarded recursive functions and types are useful for giving semantics to advanced programming languages and for higher-order programming with infinite data…”
Získať plný text

Presburger Vector Addition Systems Autor Leroux, Jérôme

“…The reachability problem for Vector Addition Systems (VAS) is a central problem of net theory. The problem is known to be decidable by inductive invariants…”
Získať plný text

Expressive Completeness for Metric Temporal Logic Autor Hunter, Paul, Ouaknine, Joel, Worrell, James

“…Metric Temporal Logic (MTL) is a generalisation of Linear Temporal Logic in which the Until and Since modalities are annotated with intervals that express…”
Získať plný text

From Frame Properties to Hypersequent Rules in Modal Logics Autor Lahav, Ori

“…We provide a general method for generating cutfree and/or analytic hypersequent Gentzen-type calculi for a variety of normal modal logics. The method applies…”
Získať plný text

Measurable Spaces and Their Effect Logic Autor Jacobs, Bart

“…So-called effect algebras and modules are basic mathematical structures that were first identified in mathematical physics, for the study of quantum logic and…”
Získať plný text

Type-Based Productivity of Stream Definitions in the Calculus of Constructions Autor Sacchini, Jorge Luis

“…Productivity of corecursive definitions is an essential property in proof assistants since it ensures logical consistency and decidability of type checking…”
Získať plný text

Turing Machines with Atoms Autor Bojanczyk, Mikołaj, Klin, Bartek, Lasota, Sławomir, Torunczyk, Szymon

“…We study Turing machines over sets with atoms, also known as nominal sets. Our main result is that deterministic machines are weaker than nondeterministic…”
Získať plný text

On the Boundary of Behavioral Strategies Autor Mogavero, Fabio, Murano, Aniello, Sauro, Luigi

“…In the setting of multi-agent games, considerable effort has been devoted to the definition of modal logics for strategic reasoning. In this area, a recent…”
Získať plný text

Quantitative Reasoning for Proving Lock-Freedom Autor Hoffmann, Jan, Marmar, Michael, Zhong Shao

“…This article describes a novel quantitative proof technique for the modular and local verification of lock-freedom. In contrast to proofs based on temporal…”
Získať plný text

Stone Duality for Markov Processes Autor Kozen, Dexter, Larsen, Kim G., Mardare, Radu, Panangaden, Prakash

“…We define Aumann algebras, an algebraic analog of probabilistic modal logic. An Aumann algebra consists of a Boolean algebra with operators modeling…”
Získať plný text

A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus Autor Facchini, Alessandro, Venema, Yde, Zanasi, Fabio

“…We provide a characterization theorem, in the style of van Benthem and Janin-Walukiewicz, for the alternation-free fragment of the modal μ-calculus. For this…”
Získať plný text

Topological Structure of Quantum Algorithms Autor Vicary, Jamie

“…We use a categorical topological semantics to examine the Deutsch-Jozsa, hidden subgroup and single-shot Grover algorithms. This reveals important structures…”
Získať plný text

The Complexity of Model Checking Multi-stack Systems Autor Bollig, Benedikt, Kuske, Dietrich, Mennicke, Roy

“…We consider the linear-time model checking problem for boolean concurrent programs with recursive procedure calls. While sequential recursive programs are…”
Získať plný text

Decidability of Weak Simulation on One-Counter Nets Autor Hofman, Piotr, Mayr, Richard, Totzke, Patrick

“…One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with only a weak test for…”
Získať plný text