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.

Runtime Verification with Imperfect Information Through Indistinguishability Relations: Label: en
Information Flow Control-by-Construction for an Object-Oriented Language: Label: en
Neural Network Verification Using Residual Reasoning: Label: en
Information Exchange Between Over- and Underapproximating Software Analyses: Label: en
Verification of programs with exceptions through operator precedence automata: Label: en
A debugger for probabilistic programs: Label: en
Translation of CCS into CSP, correct up to strong bisimulation: Label: en
Checking opacity and durable opacity with FDR: Label: en
Parallelized sequential composition and hardware weak memory models: Label: en
On the security and safety of AbU systems: Label: en
Upper bound computation of information leakages for unbounded recursion: Label: en
Mixed-neighborhood, multi-speed cellular automata for safety-aware pedestrian prediction: Label: en
Active model learning of stochastic reactive systems: Label: en
Bit-precise verification of discontinuity errors under fixed-point arithmetic: Label: en
Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis: Label: en
Be lazy and don't care: faster CTL model checking for recursive state machines: Label: en
Counterexample classification: Label: en
Hybrid information flow control for low-level code: Label: en
Refining privacy-aware data flow diagrams: Label: en
Exhaustive property oriented model-based testing with symbolic finite state machines: Label: en
Monitoring first-order interval logic: Label: en
Runtime enforcement with reordering, healing, and suppression: Label: en
Validating safety arguments with Lean: Label: en
Graph-based shape analysis beyond context-freeness: Label: en
Online Enumeration of All Minimal Inductive Validity Cores: Label: en
Counterexample Simplification for Liveness Property Violation: Label: en
Spread the work: multi-threaded safety analysis for hybrid systems: Label: en
Program verification for exception handling on active objects using futures: Label: en
From Software Specifications to Constraint Programming: Label: en
Reasoning about Separation Using Abstraction and Reification: Label: en
On Approximate Diagnosability of Metric Systems: Label: en
Formalizing Timing Diagram Requirements in Discrete Duration Calculus: Label: en
PART$$_\mathrm {PW}$$: From Partial Analysis Results to a Proof Witness: Label: en
An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions: Label: en
From Model Checking to a Temporal Proof for Partial Models: Label: en
Attributed Probabilistic P Systems and Their Application to the Modelling of Social Interactions in Primates: Label: en
Clustering Formulation Using Constraint Optimization: Label: en
Refactoring Proofs with Tactician: Label: en
Using Coq for Formal Modeling and Verification of Timed Connectors: Label: en
Reasoning About Sensing Uncertainty in Decision-Making for Self-adaptation: Label: en
A Formal Framework for Specifying and Verifying Microservices Based Process Flows: Label: en
Formalizing Monitoring Processes for Large-Scale Distributed Systems Using Abstract State Machines: Label: en
Intercepting Blackhole Attacks in MANETs: An ASM-based Model: Label: en
Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach: Label: en
A Computational Model of Internet Addiction Phenomena in Social Networks: Label: en
An Experimental Spatio-Temporal Model Checker: Label: en
Automated Synthesis of Protocol Converters with BALM-II: Label: en
A Timed Mobility Semantics Based on Rewriting Strategies: Label: en
Compositional Reasoning about Shared Futures: Label: en
Incentive Stackelberg Mean-Payoff Games: Label: en