Entity usage
From MaRDI portal
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 49 results in range #1 to #49.
- Fiat: Label: en
- Program Boosting: Label: en
- Decentralizing SDN Policies: Label: en
- Tractable Refinement Checking for Concurrent Objects: Label: en
- Iris: Label: en
- A Calculus for Relaxed Memory: Label: en
- Deep Specifications and Certified Abstraction Layers: Label: en
- Sound Modular Verification of C Code Executing in an Unverified Context: Label: en
- On Characterizing the Data Access Complexity of Programs: Label: en
- Specification Inference Using Context-Free Language Reachability: Label: en
- Quantitative Interprocedural Analysis: Label: en
- Conjugate Hylomorphisms -- Or: Label: en
- Full Abstraction for Signal Flow Graphs: Label: en
- Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems: Label: en
- Probabilistic Termination: Label: en
- Self-Representation in Girard's System U: Label: en
- Towards the Essence of Hygiene: Label: en
- K-Java: Label: en
- Succinct Representation of Concurrent Trace Sets: Label: en
- Equations, Contractions, and Unique Solutions: Label: en
- Proof Spaces for Unbounded Parallelism: Label: en
- Algebraic Effects, Linearity, and Quantum Programming Languages: Label: en
- A Meta Lambda Calculus with Cross-Level Computation: Label: en
- Programming up to Congruence: Label: en
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests: Label: en
- A Coalgebraic Decision Procedure for NetKAT: Label: en
- Abstract Symbolic Automata: Label: en
- Dependent Information Flow Types: Label: en
- Principal Type Schemes for Gradual Programs: Label: en
- Polymorphic Functions with Set-Theoretic Types: Label: en
- Compositional CompCert: Label: en
- Analyzing Program Analyses: Label: en
- A Scalable, Correct Time-Stamped Stack: Label: en
- From Communicating Machines to Graphical Choreographies: Label: en
- Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it: Label: en
- Manifest Contracts for Datatypes: Label: en
- Space-Efficient Manifest Contracts: Label: en
- Safe & Efficient Gradual Typing for TypeScript: Label: en
- Data-Parallel String-Manipulating Programs: Label: en
- DReX: Label: en
- Predicting Program Properties from "Big Code": Label: en
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth: Label: en
- Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks: Label: en
- Differential Privacy: Label: en
- Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy: Label: en
- Runtime Enforcement of Security Policies on Black Box Reactive Programs: Label: en
- Higher Inductive Types as Homotopy-Initial Algebras: Label: en
- Integrating Linear and Dependent Types: Label: en
- Functors are Type Refinement Systems: Label: en