Pages that link to "Item:Q1193587"
From MaRDI portal
The following pages link to Symbolic model checking: \(10^{20}\) states and beyond (Q1193587):
Displayed 50 items.
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Synthesizing efficient systems in probabilistic environments (Q300419) (← links)
- Command-based importance sampling for statistical model checking (Q313977) (← links)
- MR4UM: a framework for adding fault tolerance to UML state diagrams (Q391245) (← links)
- Solving parity games by a reduction to SAT (Q414902) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Model checking RAISE applicative specifications (Q470000) (← links)
- An introduction to mechanized reasoning (Q504394) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Component-wise incremental LTL model checking (Q510894) (← links)
- Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems (Q528185) (← links)
- A symbolic model for timed concurrent constraint programming (Q530859) (← links)
- IDD-based model validation of biochemical networks (Q548487) (← links)
- Bisimulation conversion and verification procedure for goal-based control systems (Q633304) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- Synthesis of obfuscation policies to ensure privacy and utility (Q682359) (← links)
- Specification and automatic verification of self-timed queues (Q685115) (← links)
- A formal semantics of extended hierarchical state transition matrices using CSP\# (Q736828) (← links)
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
- Distributed symbolic model checking for \(\mu\)-calculus (Q816198) (← links)
- Combining symmetry reduction and under-approximation for symbolic model checking (Q816210) (← links)
- Formal verification of a Java component using the RESOLVE framework (Q831953) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- State based control of timed discrete event systems using binary decision diagrams (Q864498) (← links)
- Agent planning programs (Q899440) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- Partitioned PLTL model-checking for refined transition systems (Q1023285) (← links)
- Hybrid systems: From verification to falsification by combining motion planning and discrete search (Q1039839) (← links)
- Model checking for hybrid logic (Q1047796) (← links)
- Symbolic model checking: \(10^{20}\) states and beyond (Q1193587) (← links)
- A theory of timed automata (Q1322162) (← links)
- Model checking for action-based logics (Q1326587) (← links)
- An exercise in the automatic verification of asynchronous designs (Q1329086) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- Fast and simple nested fixpoints (Q1350911) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- An improved algorithm for the evaluation of fixpoint expressions (Q1391536) (← links)
- Program schemata vs. automata for decidability of program logics (Q1392141) (← links)