Attributes | Values |
---|
rdf:type
| |
Description
| - 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.
- 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:PU78077!RIV10-MSM-26230___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GA102/07/0322), Z(MSM0021630528)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26230/08:PU78077
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - mathematical logic, arrays, decidability, decision procedure, formal verification, automata (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Logic for Programming, Artificial Intelligence and Reasoning
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Vojnar, Tomáš
- Habermehl, Peter
- Radu, Iosif
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
http://linked.open...n/vavai/riv/zamer
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |