Pages that link to "Item:Q5408394"

The following pages link to Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Q5408394):

Displaying 50 items.

• Modular reasoning about concurrent higher-order imperative programs (Q5408395) (← links)
• A galois connection calculus for abstract interpretation (Q5408396) (← links)
• Polymorphic functions with set-theoretic types (Q5408397) (← links)
• Backpack (Q5408399) (← links)
• Combining proofs and programs in a dependently typed language (Q5408400) (← links)
• Tracing compilation by abstract interpretation (Q5408402) (← links)
• A type-directed abstraction refinement approach to higher-order model checking (Q5408403) (← links)
• Fissile type analysis (Q5408405) (← links)
• A trusted mechanised JavaScript specification (Q5408408) (← links)
• An operational and axiomatic semantics for non-determinism and sequence points in C (Q5408409) (← links)
• NetKAT (Q5408410) (← links)
• Bias-variance tradeoffs in program analysis (Q5408411) (← links)
• Abstract satisfaction (Q5408412) (← links)
• Proofs that count (Q5408413) (← links)
• A verified information-flow architecture (Q5408414) (← links)
• CakeML (Q5408415) (← links)
• Probabilistic relational verification for cryptographic implementations (Q5408416) (← links)
• Bridging boolean and quantitative synthesis using smoothed proof search (Q5408417) (← links)
• A constraint-based approach to solving games on infinite graphs (Q5408418) (← links)
• Sound compilation of reals (Q5408419) (← links)
• 30 years of research and development around Coq (Q5408420) (← links)
• The essence of Reynolds (Q5408421) (← links)
• Freeze after writing (Q5408423) (← links)
• Replicated data types (Q5408424) (← links)
• Verifying eventual consistency of optimistic replication systems (Q5408425) (← links)
• On coinductive equivalences for higher-order probabilistic functional programs (Q5408426) (← links)
• Probabilistic coherence spaces are fully abstract for probabilistic PCF (Q5408427) (← links)
• Tabular (Q5408428) (← links)
• Modular, higher-order cardinality analysis in theory and practice (Q5408429) (← links)
• Profiling for laziness (Q5408430) (← links)
• Fair reactive programming (Q5408431) (← links)
• Optimal dynamic partial order reduction (Q5408432) (← links)
• Modular reasoning about heap paths via effectively propositional formulas (Q5408433) (← links)
• A sound and complete abstraction for reasoning about parallel prefix sums (Q5408435) (← links)
• Authenticated data structures, generically (Q5408436) (← links)
• Gradual typing embedded securely in JavaScript (Q5408437) (← links)
• Sound input filter generation for integer overflow errors (Q5408440) (← links)
• Parametric completeness for separation theories (Q5408441) (← links)
• Proof search for propositional abstract separation logics via labelled sequents (Q5408442) (← links)
• A proof system for separation logic with magic wand (Q5408443) (← links)
• From parametricity to conservation laws, via Noether's theorem (Q5408444) (← links)
• A relationally parametric model of dependent type theory (Q5408445) (← links)
• Game semantics for interface middleweight Java (Q5408446) (← links)
• Abstract acceleration of general linear loops (Q5408447) (← links)
• Minimization of symbolic automata (Q5408448) (← links)
• Consistency analysis of decision-making programs (Q5408449) (← links)
• Toward general diagnosis of static errors (Q5408450) (← links)
• Counter-factual typing for debugging type errors (Q5408451) (← links)
• Battery transition systems (Q5408452) (← links)
• Symbolic optimization with SMT solvers (Q5408453) (← links)