scientific article; zbMATH DE number 1069483
From MaRDI portal
Publication:4356435
zbMATH Open0880.68084MaRDI QIDQ4356435FDOQ4356435
Authors: Doron Peled, Mihalis Yannakakis, Gerard J. Holzmann
Publication date: 1 October 1997
Title of this publication is not available (Why is that?)
Recommendations
- Multi-core nested depth-first search
- Depth-first search with P systems
- Depth-First Search Using $$O(n)$$ Bits
- Depth-First Search and Kuratowski Subgraphs
- Depth-first search in directed planar graphs, revisited
- Depth-First Search in Directed Planar Graphs, Revisited
- scientific article; zbMATH DE number 3949734
- Depth-first search is inherently sequential
- Improved multi-core nested depth-first search
Cited In (32)
- Depth First Search in the Semi-streaming Model
- Formal verification of an executable LTL model checker with partial order reduction
- Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
- Model checking \(\omega \)-regular properties with decoupled search
- Partial-Order Reduction
- Model checking with bounded context switching
- Survey on Directed Model Checking
- Refinement to imperative HOL
- Title not available (Why is that?)
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
- Symmetry and partial order reduction techniques in model checking Rebeca
- Taking Some Burden Off an Explicit CTL Model Checker
- The Maude LTL model checker
- Automated verification of parallel nested DFS
- Automated formal analysis and verification: an overview
- Multi-core nested depth-first search
- Depth-First Search Using $$O(n)$$ Bits
- Flash memory efficient LTL model checking
- Explicit-state model checking
- Automata-Theoretic Model Checking Revisited
- Linear temporal logic symbolic model checking
- Refinement to Imperative/HOL
- Matching in security-by-contract for mobile code
- Model Checking Software
- Parallel nested depth-first searches for LTL model checking
- Improved multi-core nested depth-first search
- Title not available (Why is that?)
- Depth-first iterative-deepening: An optimal admissible tree search
- A stack-slicing algorithm for multi-core model checking
- Component-wise incremental LTL model checking
- Relational depth-first-search with applications
- More efficient on-the-fly LTL verification with Tarjan's algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4356435)