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.

The Verification of the On-Chip COMA Cache Coherence Protocol: Label: en
Service Specification and Matchmaking Using Description Logic: Label: en
A Hybrid Approach for Safe Memory Management in C: Label: en
Non Expansive ε-Bisimulations: Label: en
Generating Specialized Rules and Programs for Demand-Driven Analysis: Label: en
Domain Axioms for a Family of Near-Semirings: Label: en
Verification of Java Programs with Generics: Label: en
Evolving Specification Engineering: Label: en
Extending Timed Process Algebra with Discrete Stochastic Time: Label: en
Coinductive Properties of Causal Maps: Label: en
Constant Complements, Reversibility and Universal View Updates: Label: en
Implementing a Categorical Information System: Label: en
An Algebraic Semantics for Contract-Based Software Components: Label: en
Separation Logic Contracts for a Java-Like Language with Fork/Join: Label: en
Abstract Interpretation Plugins for Type Systems: Label: en
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols: Label: en
Explaining Verification Conditions: Label: en
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids: Label: en
Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines: Label: en
Calculating Invariants as Coreflexive Bisimulations: Label: en
Towards an Efficient Implementation of Tree Automata Completion: Label: en
Petri Nets Are Dioids: Label: en
An Algebra for Features and Feature Composition: Label: en
Simulation Using Orchestration: Label: en
Marrying Words and Trees: Label: en
Partial order programming (Revisited): Label: en
A generic algebra for data collections based on constructive logic: Label: en
Confluence in concurrent constraint programming: Label: en
An algebraic construction of the well-founded model: Label: en
Symbolic timing devices: Label: en
A Calculus of Countable Broadcasting Systems: Label: en
Automated reasoning about parallel algorithms using powerlists: Label: en
On mechanizing proofs within a complete proof system for Unity: Label: en
Completeness results for two-sorted metric temporal logics: Label: en
CPO models for infinite term rewriting: Label: en
Logical foundations for compositional verification and development of concurrent programs in UNITY: Label: en
An algebraic framework for developing and maintaining real-time systems: Label: en
Petri nets, traces, and local model checking: Label: en
Dynamic matrices and the cost analysis of concurrent programs: Label: en
Verification in continuous time by discrete reasoning: Label: en
Causality and true concurrency: A data-flow analysis of the Pi-Calculus: Label: en
Semantic typing for parametric algebraic specifications: Label: en
Mongruences and cofree coalgebras: Label: en
Encoding natural semantics in Coq: Label: en
Context-free event domains are recognizable: Label: en
Higher-order narrowing with convergent systems: Label: en
Detecting isomorphisms of modular specifications with diagrams: Label: en
On the decidability of process equivalences for the π-calculus: Label: en
Proving the correctness of behavioural implementations: Label: en
Order-sorted algebraic specifications with higher-order functions: Label: en