Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

A Theory for Control-Flow Graph Exploration: Label: en
SAT Based Verification of Network Data Planes: Label: en
Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs: Label: en
MoTraS: A Tool for Modal Transition Systems and Their Extensions: Label: en
VCS: A Verifier for Component-Based Systems: Label: en
NLTOOLBOX: A Library for Reachability Computation of Nonlinear Dynamical Systems: Label: en
CCMC: A Conditional CSL Model Checker for Continuous-Time Markov Chains: Label: en
Solving Parity Games on the GPU: Label: en
LTL Model Checking with Neco: Label: en
Rabinizer 2: Small Deterministic Automata for LTL ∖ GU: Label: en
Manipulating LTL Formulas Using Spot 1.0: Label: en
Robustness Analysis of String Transducers: Label: en
Pushdown Systems with Stack Manipulation: Label: en
An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications: Label: en
Merge and Conquer: State Merging in Parametric Timed Automata: Label: en
Linear Ranking for Linear Lasso Programs: Label: en
Termination and Cost Analysis of Loops with Concurrent Interleavings: Label: en
Control Flow Refinement and Symbolic Computation of Average Case Bound: Label: en
Precise Cost Analysis via Local Reasoning: Label: en
Expected Termination Time in BPA Games: Label: en
An Expressive Framework for Verifying Deadlock Freedom: Label: en
Analysis of Message Passing Programs Using SMT-Solvers: Label: en
Interpolation Properties and SAT-Based Model Checking: Label: en
Integrating Policy Iterations in Abstract Interpreters: Label: en
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata: Label: en
Compact Symbolic Execution: Label: en
Synthesizing Masking Fault-Tolerant Systems from Deontic Specifications: Label: en
A Framework for Ranking Vacuity Results: Label: en
Weighted Safety: Label: en
Looking at Mean-Payoff and Total-Payoff through Windows: Label: en
Kleene Algebras and Semimodules for Energy Problems: Label: en
Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games: Label: en
An Automatic Technique for Checking the Simulation of Timed Systems: Label: en
Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points: Label: en
Improved Upper and Lower Bounds for Büchi Disambiguation: Label: en
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment: Label: en
Automated Verification and Strategy Synthesis for Probabilistic Systems: Label: en
Acceleration for Petri Nets: Label: en
The Reach-Avoid Problem for Constant-Rate Multi-mode Systems: Label: en
Attacking the V: On the Resiliency of Adaptive-Horizon MPC: Label: en
Synthesis of Optimal Resilient Control Strategies: Label: en
Finding Polynomial Loop Invariants for Probabilistic Programs: Label: en
Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes: Label: en
A Language-Theoretic View on Network Protocols: Label: en
Exploiting Partial Knowledge for Efficient Model Analysis: Label: en
Synthesizing Invariants by Solving Solvable Loops: Label: en
Lifting CDCL to Template-Based Abstract Domains for Program Verification: Label: en
Liquid Types for Array Invariant Synthesis: Label: en
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks: Label: en
Concurrent Program Verification with Invariant-Guided Underapproximation: Label: en