scientific article; zbMATH DE number 910719
From MaRDI portal
Publication:4885877
zbMATH Open0847.68063MaRDI QIDQ4885877FDOQ4885877
Author name not available (Why is that?)
Publication date: 28 July 1996
Title of this publication is not available (Why is that?)
Cited In (52)
- Uncertainty in runtime verification: a survey
- Minimal refinements of specifications in modal and temporal logics
- Minimal refinements of specifications in modal and temporal logics
- Extracting unsatisfiable cores for LTL via temporal resolution
- On ACTL formulas having linear counterexamples
- Software model checking
- Space-reduction strategies for model checking dynamic software
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Model checking using net unfoldings
- Using assumptions to distribute CTL model checking
- Model Checking Value-Passing Modal Specifications
- Partial order reduction for state/event LTL with application to component-interaction automata
- Title not available (Why is that?)
- Evaluation of cyber security and modelling of risk propagation with Petri nets
- Actor-based slicing techniques for efficient reduction of Rebeca models
- A novel analysis space for pointer analysis and its application for bug finding
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
- Title not available (Why is that?)
- The Maude LTL model checker
- An abstraction-refinement methodology for reasoning about network games
- Symbolic execution of Reo circuits using constraint automata
- A state/event-based model-checking approach for the analysis of abstract system properties
- Modeling for Verification
- Verification: Theory and Practice
- Title not available (Why is that?)
- Active learning for extended finite state machines
- Formal verification of mobile robot protocols
- Invariant-driven specifications in Maude
- Modeling Concurrent systems specified in a Temporal Concurrent Constraint language-I
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
- Synthesising correct concurrent runtime monitors
- Application of static analyses for state-space reduction to the microcontroller binary code
- Flash memory efficient LTL model checking
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
- Variable and clause elimination for LTL satisfiability checking
- Model checking action system refinements
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Automatic verification of reduction techniques in higher order logic
- Model checking RAISE applicative specifications
- Model checking Russian cards
- Quantifier elimination by dependency sequents
- SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata
- Verification by augmented abstraction: The automata-theoretic view
- On equilibria in quantitative games with reachability/safety objectives
- Title not available (Why is that?)
- Verification by augmented finitary abstraction
- Compositional verification of asynchronous concurrent systems using CADP
- A computer scientist looks at game theory.
- Symbolic model checking for channel-based component connectors
- On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
- Title not available (Why is that?)
- Wu's characteristic set method for SystemVerilog assertions verification
Uses Software
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 Q4885877)
