About: A Logic of Singly Indexed Arrays

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Logic of Singly Indexed Arrays Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www-verimag.imag.fr/TR/TR-2008-9.ps
Description	This report is the full version of an LPAR'08 paper, in which we present a logic interpreted over integer arrays, which allows difference bound  comparisons between array elements situated within a constant sized window. We show that the satisfiability problem for the logic is undecidable for formulae  with a quantifier prefix $\{\exists,\forall\}^\forall^\exists^\forall^$. For formulae  with quantifier prefixes in the $\exists^\forall^$ fragment, decidability is established  by an automata-theoretic argument. For each formula in the $\exists^\forall^$ fragment, we  can build a~flat counter automaton with difference bound transition rules (FCADBM) whose traces <br>correspond to the models of the formula. The construction is modular, following the syntax of  the formula. Decidability of the $\exists^\forall^$ fragment of the logic is a consequence  of the fact that reachability of a control state is decidable for FCADBM. This report is the full version of an LPAR'08 paper, in which we present a logic interpreted over integer arrays, which allows difference bound  comparisons between array elements situated within a constant sized window. We show that the satisfiability problem for the logic is undecidable for formulae  with a quantifier prefix $\{\exists,\forall\}^\forall^\exists^\forall^$. For formulae  with quantifier prefixes in the $\exists^\forall^$ fragment, decidability is established  by an automata-theoretic argument. For each formula in the $\exists^\forall^$ fragment, we  can build a~flat counter automaton with difference bound transition rules (FCADBM) whose traces <br>correspond to the models of the formula. The construction is modular, following the syntax of  the formula. Decidability of the $\exists^\forall^$ fragment of the logic is a consequence  of the fact that reachability of a control state is decidable for FCADBM. (en)
Title	A Logic of Singly Indexed Arrays A Logic of Singly Indexed Arrays (en)
skos:prefLabel	A Logic of Singly Indexed Arrays A Logic of Singly Indexed Arrays (en)
skos:notation	RIV/00216305:26230/08:PU78078!RIV10-MSM-26230___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA102/07/0322), Z(MSM0021630528)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Vojnar, Tomáš
http://linked.open.../riv/druhVysledku	A(V) - Audiovizuální tvorba se vzdáleným přístupem
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	354227
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/08:PU78078
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	mathematical logic, arrays, decidability, decision procedure, formal verification, automata (en)
http://linked.open.../riv/klicoveSlovo	automata mathematical logic decidability arrays formal verification decision procedure
http://linked.open...i/riv/kodPristupu	V
http://linked.open...ontrolniKodProRIV	[F2B396D93EBC]
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Advanced Formal Approaches in the Design and Verification of Computer-Based Systems
http://linked.open...UplatneniVysledku	2008
http://linked.open...iv/tvurceVysledku	Vojnar, Tomáš Habermehl, Peter Radu, Iosif
http://linked.open...n/vavai/riv/zamer	Výzkum informačních technologií z hlediska bezpečnosti
http://localhost/t...ganizacniJednotka	26230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software