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 50 results in range #1 to #50.
- Battery transition systems: Label: en
- Counter-factual typing for debugging type errors: Label: en
- Toward general diagnosis of static errors: Label: en
- Consistency analysis of decision-making programs: Label: en
- Minimization of symbolic automata: Label: en
- Abstract acceleration of general linear loops: Label: en
- Game semantics for interface middleweight Java: Label: en
- A relationally parametric model of dependent type theory: Label: en
- From parametricity to conservation laws, via Noether's theorem: Label: en
- A proof system for separation logic with magic wand: Label: en
- Proof search for propositional abstract separation logics via labelled sequents: Label: en
- Parametric completeness for separation theories: Label: en
- Sound input filter generation for integer overflow errors: Label: en
- Gradual typing embedded securely in JavaScript: Label: en
- Authenticated data structures, generically: Label: en
- A sound and complete abstraction for reasoning about parallel prefix sums: Label: en
- Modular reasoning about heap paths via effectively propositional formulas: Label: en
- Optimal dynamic partial order reduction: Label: en
- Fair reactive programming: Label: en
- Profiling for laziness: Label: en
- Modular, higher-order cardinality analysis in theory and practice: Label: en
- Tabular: Label: en
- Probabilistic coherence spaces are fully abstract for probabilistic PCF: Label: en
- On coinductive equivalences for higher-order probabilistic functional programs: Label: en
- Verifying eventual consistency of optimistic replication systems: Label: en
- Replicated data types: Label: en
- Freeze after writing: Label: en
- The essence of Reynolds: Label: en
- 30 years of research and development around Coq: Label: en
- Sound compilation of reals: Label: en
- A constraint-based approach to solving games on infinite graphs: Label: en
- Bridging boolean and quantitative synthesis using smoothed proof search: Label: en
- Probabilistic relational verification for cryptographic implementations: Label: en
- CakeML: Label: en
- A verified information-flow architecture: Label: en
- Proofs that count: Label: en
- Abstract satisfaction: Label: en
- Bias-variance tradeoffs in program analysis: Label: en
- NetKAT: Label: en
- An operational and axiomatic semantics for non-determinism and sequence points in C: Label: en
- A trusted mechanised JavaScript specification: Label: en
- Fissile type analysis: Label: en
- A type-directed abstraction refinement approach to higher-order model checking: Label: en
- Tracing compilation by abstract interpretation: Label: en
- Combining proofs and programs in a dependently typed language: Label: en
- Backpack: Label: en
- Polymorphic functions with set-theoretic types: Label: en
- A galois connection calculus for abstract interpretation: Label: en
- Modular reasoning about concurrent higher-order imperative programs: Label: en
- Closed type families with overlapping equations: Label: en