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 #51 to #100.

Knowledge Transfer and Information Leakage in Protocols: Label: en
Dealing with Priorities and Locks for Concurrent Programs: Label: en
Gradient-Based Variable Ordering of Decision Diagrams for Systems with Structural Units: Label: en
Compositional Safety Refutation Techniques: Label: en
The Density of Linear-Time Properties: Label: en
Tests and Refutation: Label: en
Fixing the State Budget: Approximation of Regular Languages with Small DFAs: Label: en
May-Happen-in-Parallel Analysis with Returned Futures: Label: en
Probabilistic Contracts for Component-Based Design: Label: en
Recursive Timed Automata: Label: en
Symbolic Unfolding of Parametric Stopwatch Petri Nets: Label: en
Auxiliary Constructs for Proving Liveness in Compassion Discrete Systems: Label: en
Automatic Generation of History-Based Access Control from Information Flow Specification: Label: en
LTL Can Be More Succinct: Label: en
Reachability as Derivability, Finite Countermodels and Verification: Label: en
Efficient On-the-Fly Emptiness Check for Timed Büchi Automata: Label: en
An Approach for Class Testing from Class Contracts: Label: en
Non-monotonic Refinement of Control Abstraction for Concurrent Programs: Label: en
A Specification Logic for Exceptions and Beyond: Label: en
Lattice-Valued Binary Decision Diagrams: Label: en
A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Network: Label: en
What’s Decidable about Sequences?: Label: en
Compositional Algorithms for LTL Synthesis: Label: en
On Scenario Synchronization: Label: en
The Complexity of Codiagnosability for Discrete Event and Timed Systems: Label: en
Composing Reachability Analyses of Hybrid Systems for Safety and Stability: Label: en
Methods for Knowledge Based Controlling of Distributed Systems: Label: en
Using Redundant Constraints for Refinement: Label: en
Promptness in ω-Regular Automata: Label: en
Synthesis: Words and Traces: Label: en
Probabilistic Automata on Infinite Words: Decidability and Undecidability Results: Label: en
Higher-Order Approximations for Verification of Stochastic Hybrid Systems: Label: en
A Probabilistic Kleene Theorem: Label: en
Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games: Label: en
ALLQBF Solving by Computational Learning: Label: en
Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers: Label: en
Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements: Label: en
Pareto Curves for Probabilistic Model Checking: Label: en
Variable Probabilistic Abstraction Refinement: Label: en
An Experiment on Parallel Model Checking of a CTL Fragment: Label: en
Improved Multi-Core Nested Depth-First Search: Label: en
Parallel Assertions for Architectures with Weak Memory Models: Label: en
Counterexample Guided Synthesis of Monitors for Realizability Enforcement: Label: en
Controllers with Minimal Observation Power (Application to Timed Systems): Label: en
Synthesis of Succinct Systems: Label: en
Accelerating Interpolants: Label: en
Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data: Label: en
Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding: Label: en
Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations: Label: en
Model Checking Systems and Specifications with Parameterized Atomic Propositions: Label: en