Skip to content
<title>Channels - Reachability under Contextual Locking :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Reachability under Contextual Locking
Search for more channels:
Similar Items: Reachability under Contextual Locking
Channel Options
View Record
Explore related channels
Quick Look
Reachability Switching Games
Quick Look
Reachability Analysis of Innermost Rewriting
Quick Look
All-Path Reachability Logic
Quick Look
O-Minimal Hybrid Reachability Games
Quick Look
Reachability Analysis of Communicating Pushdown Systems
Quick Look
Reachability and liveness in parametric timed automata
Quick Look
Vector Addition System Reversible Reachability Problem
Quick Look
Reachability Problem for Weak Multi-Pushdown Automata
Quick Look
Bounded Reachability Problems are Decidable in FIFO Machines
Quick Look
On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
Quick Look
On Reachability for Unidirectional Channel Systems Extended with Regular Tests
Quick Look
Reachability for infinite time Turing machines with long tapes
Quick Look
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games
Quick Look
Stubborn Set Reduction for Two-Player Reachability Games
Quick Look
The Complexity of Reachability in Affine Vector Addition Systems with States
Quick Look
Contextual Bandits with Stage-wise Constraints
Quick Look
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Quick Look
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
Quick Look
Petri Net Reachability Graphs: Decidability Status of First Order Properties
Quick Look
Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
Quick Look
Contextual equivalence for higher-order pi-calculus revisited
Quick Look
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
Quick Look
Bayesian Inference of Contextual Bandit Policies via Empirical Likelihood
Quick Look
Simulating reachability using first-order logic with applications to verification of linked data structures
Load more items
View Record
Prev
Explore related channels
Next
