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.

Example-directed synthesis: a type-theoretic interpretation: Label: en
Maximal specification synthesis: Label: en
Optimizing synthesis with metasketches: Label: en
Learning programs from noisy data: Label: en
Memoryful geometry of Interaction II: recursion and adequacy: Label: en
Algorithms for algebraic path properties in concurrent systems of constant treewidth components: Label: en
Lattice-theoretic progress measures and coalgebraic model checking: Label: en
Pushdown control-flow analysis for free: Label: en
Casper: an efficient approach to call trace collection: Label: en
Newtonian program analysis via tensor product: Label: en
Taming release-acquire consistency: Label: en
Overhauling SC atomics in C11 and OpenCL: Label: en
A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions: Label: en
Environmental bisimulations for probabilistic higher-order languages: Label: en
Monitors and blame assignment for higher-order session types: Label: en
Effects as sessions, sessions as effects: Label: en
PolyCheck: dynamic verification of iteration space transformations on affine programs: Label: en
SMO: an integrated approach to intra-array and inter-array storage optimization: Label: en
Symbolic abstract data type inference: Label: en
Abstraction refinement guided by a learnt probabilistic model: Label: en
The gradualizer: a methodology and algorithm for generating gradual type systems: Label: en
Abstracting gradual typing: Label: en
Principal type inference for GADTs: Label: en
PSync: a partially synchronous language for fault-tolerant distributed algorithms: Label: en
A program logic for concurrent objects under fair scheduling: Label: en
'Cause I'm strong enough: Reasoning about consistency choices in distributed systems: Label: en
Chapar: certified causally consistent distributed key-value stores: Label: en
Transforming spreadsheet data types using examples: Label: en
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs: Label: en
Kleenex: compiling nondeterministic transducers to deterministic streaming transducers: Label: en
Fabular: regression formulas as probabilistic programming: Label: en
Dependent types and multi-monadic effects in F*: Label: en
The complexity of interaction: Label: en
The hardness of data packing: Label: en
Decidability of inferring inductive invariants: Label: en
Sound type-dependent syntactic language extension: Label: en
From MinX to MinC: semantics-driven decompilation of recursive datatypes: Label: en
Lightweight verification of separate compilation: Label: en
Fully-abstract compilation by approximate back-translation: Label: en
Unboundedness and downward closures of higher-order pushdown automata: Label: en
Symbolic computation of differential equivalences: Label: en
String solving with word equations and transducers: towards a logic for analysing mutation XSS: Label: en
Query-guided maximum satisfiability: Label: en
Reducing crash recoverability to reachability: Label: en
Model checking for symbolic-heap separation logic with inductive predicates: Label: en
Scaling network verification using symmetry and surgery: Label: en
Temporal verification of higher-order functional programs: Label: en
A theory of effects and resources: adjunction models and polarised calculi: Label: en
System f-omega with equirecursive types for datatype-generic programming: Label: en
Type theory in type theory using quotient inductive types: Label: en