All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

120 382 (0,273s)

Result

Partial Order Reduction for State/Event LTL

of state/event LTL properties. The core of the partial order reduction is a novel notion of stuttering equivalence which we call state/event stuttering equivalence for partial order reduction. State

IN - Informatika

  • 2008
  • A
Result

Partial Order Reduction for State/Event LTL

The main contribution of the paper is a partial order reduction technique for verification of state/event LTL properties. The core of the partial order reduction is a novel notion of sttuttering equivalence which we call

IN - Informatika

  • 2009
  • D
Result

Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata

interaction. State/event LTL (Chaki et al. 2004, 2005) incorporates both states and events for partial order reduction. State/event LTL properties are, in general, not preserved...

IN - Informatika

  • 2011
  • Jx
  • Link
Result

CoIn Tool Set

. The properties to be checked are specified using temporal logic, namely a variant of State/Event LTL.

IN - Informatika

  • 2009
  • R
Result

On Decidability of LTL+Past Model Checking for Process Rewrite Systems

The Decidability Borderline for Model Checking of LTL+Past and Process Rewrite Systems is determined.

IN - Informatika

  • 2007
  • O
Result

Distribution of Explicit-State LTL Model-Checking

We give a brief summary of recent achievements in research related to the distribution of explicit-state LTL model-checking.

IN - Informatika

  • 2003
  • Jx
Result

On Decidability of LTL+Past Model Checking for Process Rewrite Systems

The Decidability Borderline for Model Checking of LTL+Past and Weakly--Extended Process Rewrite Systems is determined.

IN - Informatika

  • 2009
  • D
Result

DIVINE: Explicit-State LTL Model Checker

DIVINE is an LLVM-based LTL model checker that follows the standard automata-based approach to explicit-state model checking. It aims at verification of unmodified parallel C & C++ programs without inputs. To achieve this DIVINE...

IN - Informatika

  • 2016
  • D
  • Link
Result

Improved State Space Reductions for LTL Model Checking of C & C++ Programs

In this paper, we present substantial improvements in efficiency of explicit-state LTL model checking of C &; C++ programs, building on~cite{BBR12b}, including improvements to state representation and to state ...

IN - Informatika

  • 2013
  • D
  • Link
Result

The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL

It is known that LTL formulae without the `next' operator are invariant under to general LTL formulae with given nesting depths of the `next' and `until' operators. This allows us to prove the semantical strictness of three natural ...

JC - Počítačový hardware a software

  • 2002
  • D
  • 1 - 10 out of 120 382