The following pages link to (Q3336675):
Displaying 50 items.
- Bounded situation calculus action theories (Q286407) (← links)
- Ordered multi-stack visibly pushdown automata (Q344793) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Formal modeling and verification for MVB (Q364392) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- A complete proof system for propositional projection temporal logic (Q391223) (← links)
- Verification of multi-linked heaps (Q439948) (← links)
- Synthesis of Reactive(1) designs (Q439954) (← links)
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning (Q457250) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Refinement modal logic (Q476194) (← links)
- Quantifier elimination by dependency sequents (Q479823) (← links)
- Bounded semantics (Q483292) (← links)
- The modeling library of eavesdropping methods in quantum cryptography protocols by model checking (Q518056) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- An accessible verification environment for UML models of services (Q617979) (← links)
- Generating counterexamples for quantitative safety specifications in probabilistic B (Q652160) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- About the expressive power of CTL combinators (Q672975) (← links)
- Assume-guarantee synthesis for digital contract signing (Q736809) (← links)
- A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103) (← links)
- Program repair without regret (Q746769) (← links)
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538) (← links)
- Results on the propositional \(\mu\)-calculus (Q801893) (← links)
- Global and local views of state fairness (Q804304) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- Translating Java for multiple model checkers: The Bandera back-end (Q816196) (← links)
- Combining symmetry reduction and under-approximation for symbolic model checking (Q816210) (← links)
- Interpretability of first-order linear temporal logics in fork algebras (Q817582) (← links)
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers (Q821566) (← links)
- Not all bugs are created equal, but robust reachability can tell the difference (Q832220) (← links)
- Algebraic simulations (Q844884) (← links)
- Question-guided stubborn set methods for state properties (Q862861) (← links)
- On the semantics of strategy logic (Q894440) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- A complete axiom system for propositional projection temporal logic with cylinder computation model (Q896162) (← links)
- Augmenting ATL with strategy contexts (Q897650) (← links)
- Verification of distributed systems with the axiomatic system of MSVL (Q903507) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
- Arity hierarchy for temporal logics (Q944387) (← links)
- On model checking multiple hybrid views (Q947781) (← links)
- Verification of scope-dependent hierarchical state machines (Q948087) (← links)
- Relating fair testing and accordance for service replaceability (Q974133) (← links)
- Test generation from P systems using model checking (Q987969) (← links)
- Automatic symmetry detection for Promela (Q1040774) (← links)
- A multiprocess network logic with temporal and spatial modalities (Q1058846) (← links)
