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.

List of pages that use a given entity

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

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. LightDP: towards automating differential privacy proofs: Label: en
  2. Hypercollecting semantics and its application to static analysis of information flow: Label: en
  3. LMS-Verify: abstraction without regret for verified systems programming: Label: en
  4. QWIRE: a core language for quantum circuits: Label: en
  5. The geometry of parallelism: classical, probabilistic, and quantum effects: Label: en
  6. Invariants of quantum programs: characterisations and generation: Label: en
  7. Sums of uncertainty: refinements go gradual: Label: en
  8. Automatically generating the dynamic semantics of gradually typed languages: Label: en
  9. Gradual refinement types: Label: en
  10. Big types in little runtime: open-world soundness and collaborative blame for gradual type systems: Label: en
  11. Fencing off go: liveness and safety for channel-based programming: Label: en
  12. Analyzing divergence in bisimulation semantics: Label: en
  13. A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms: Label: en
  14. Parallel functional arrays: Label: en
  15. Type systems as macros: Label: en
  16. Computational higher-dimensional type theory: Label: en
  17. Type soundness proofs with definitional interpreters: Label: en
  18. Intersection type calculi of bounded dimension: Label: en
  19. Complexity verification using guided theorem enumeration: Label: en
  20. On verifying causal consistency: Label: en
  21. Learning nominal automata: Label: en
  22. Component-based synthesis for complex APIs: Label: en
  23. LOIS: syntax and semantics: Label: en
  24. Genesis: synthesizing forwarding tables in multi-tenant networks: Label: en
  25. Cantor meets Scott: semantic foundations for probabilistic networks: Label: en
  26. A semantic account of metric preservation: Label: en
  27. Stateful manifest contracts: Label: en
  28. Dijkstra monads for free: Label: en
  29. Do be do be do: Label: en
  30. Type directed compilation of row-typed algebraic effects: Label: en
  31. Thread modularity at many levels: a pearl in compositional verification: Label: en
  32. Serializability for eventual consistency: criterion, analysis, and applications: Label: en
  33. Dynamic race detection for C++11: Label: en
  34. Typed self-evaluation via intensional type functions: Label: en
  35. Contextual isomorphisms: Label: en
  36. The exp-log normal form of types: decomposing extensional equality and representing terms compactly: Label: en
  37. Deciding equivalence with sums and the empty type: Label: en
  38. Towards automatic resource bound analysis for OCaml: Label: en
  39. Context-sensitive data-dependence analysis via linear conjunctive language reachability: Label: en
  40. Contract-based resource verification for higher-order functions with memoization: Label: en
  41. Relational cost analysis: Label: en
  42. Rigorous floating-point mixed-precision tuning: Label: en
  43. Stream fusion, to completeness: Label: en
  44. A program optimization for automatic database result caching: Label: en
  45. Coming to terms with quantified reasoning: Label: en
  46. On the relationship between higher-order recursion schemes and higher-order fixpoint logic: Label: en
  47. Monadic second-order logic on finite sequences: Label: en
  48. A relational model of types-and-effects in higher-order concurrent separation logic: Label: en
  49. Interactive proofs in higher-order concurrent separation logic: Label: en
  50. Automatically comparing memory consistency models: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)