Finite-Degree Predicates and Two-Variable First-Order Logic [PDF]
We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate only.
Paperman, Charles
core +8 more sources
Systematic Predicate Abstraction Using Variable Roles [PDF]
Heuristics for discovering predicates for abstraction are an essential part of software model checkers. Picking the right predicates affects the runtime of a model checker, or determines if a model checker is able to solve a verification task at all. In this paper we present a method to systematically specify heuristics for generating program-specific ...
Demyanova, Yulia +2 more
openaire +3 more sources
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter [PDF]
We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is undecidable.
Rybakov, Mikhail, Shkatov, Dmitry
core +2 more sources
Predicate Transformers for Recursive Procedures with Local Variables [PDF]
Abstract. The weakest precondition semantics of recursive procedures with local variables are developed for an imperative language with demonic and angelic operators for unbounded nondeterminate choice. This does not require stacking of local variables.
Wim H. Hesselink
openaire +5 more sources
Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs [PDF]
Predicate abstraction is a key enabling technology for applying finitestate model checkers to programs written in mainstream languages. It has been used very successfully for debugging sequential system-level C code. Although model checking was originally designed for analyzing concurrent systems, there is little evidence of fruitful applications of ...
Alastair Donaldson +3 more
openaire +3 more sources
Control predicates are better than dummy variables for reasoning about program control [PDF]
When explicit control predicates rather than dummy variables are used, the Owicki-Gries method for proving safety properties of concurrent programs can be strengthened, making it easier to construct the required program annotations.
Leslie Lamport
openaire +3 more sources
Two-variable Logic with a Between Predicate [PDF]
We study an extension of FO^2[
Krebs, Andreas +3 more
openaire +3 more sources
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
We study the algorithmic properties of the quantified linear-time temporal logic QLTL in languages with restrictions on the number of individual variables as well as the number and arity of predicate letters. We prove that the satisfiability problem for QLTL in languages with two individual variables and one monadic predicate letter in Σ 11 -hard. Thus,
Rybakov, Mikhail, Shkatov, Dmitry
openaire +3 more sources
Identification of the Predicator Variables of Candidate Teacher Teaching Motivations
The purpose of this study was to determine whether the internal and external teaching motivations of 3rd and 4th year students of the Faculty of Education of Cumhuriyet University are predicted by the variables of gender, department, year level, conscious preference of department they are studying in, whether there is a teacher in their family, their ...
Ebru Bozpolat
openaire +3 more sources
Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs (Extended Technical Report) [PDF]
Predicate abstraction is a key enabling technology for applying finite-state model checkers to programs written in mainstream languages. It has been used very successfully for debugging sequential system-level C code. Although model checking was originally designed for analyzing concurrent systems, there is little evidence of fruitful applications of ...
Donaldson, AF +3 more
openaire +4 more sources

