Pages that link to "Item:Q5408524"

The following pages link to Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Q5408524):

Displaying 50 items.

• Verified squared (Q5408525) (← links)
• Points-to analysis with efficient strong updates (Q5408527) (← links)
• Pick your contexts well (Q5408528) (← links)
• Learning minimal abstractions (Q5408529) (← links)
• Relaxed-memory concurrency and verified compilation (Q5408530) (← links)
• Mathematizing C++ concurrency (Q5408531) (← links)
• Formal verification of object layout for c++ multiple inheritance (Q5408532) (← links)
• Static analysis of multi-staged programs via unstaging translation (Q5408534) (← links)
• Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol (Q5408535) (← links)
• A parametric segmentation functor for fully automatic and scalable array content analysis (Q5408536) (← links)
• Step-indexed kripke models over recursive worlds (Q5408537) (← links)
• A kripke logical relation between ML and assembly (Q5408538) (← links)
• A typed store-passing translation for general references (Q5408539) (← links)
• A shape analysis for optimizing parallel graph programs (Q5408541) (← links)
• Calling context abstraction with shapes (Q5408542) (← links)
• Precise reasoning for programs using containers (Q5408543) (← links)
• Blame for all (Q5408544) (← links)
• Correct blame for contracts (Q5408545) (← links)
• Generative type abstraction and type-level computation (Q5408546) (← links)
• A separation logic for refining concurrent objects (Q5408547) (← links)
• Modular reasoning for deterministic parallelism (Q5408548) (← links)
• Expressive modular fine-grained concurrency specification (Q5408549) (← links)
• The tree width of auxiliary storage (Q5408550) (← links)
• Fresh-register automata (Q5408551) (← links)
• Vector addition system reachability problem (Q5408552) (← links)
• Automating string processing in spreadsheets using input-output examples (Q5408553) (← links)
• Predicate abstraction and refinement for verifying multi-threaded programs (Q5408554) (← links)
• Geometry of synthesis III (Q5408555) (← links)
• Multivariate amortized resource analysis (Q5408556) (← links)
• Symmetric lenses (Q5408557) (← links)
• Regular expression containment (Q5408558) (← links)
• Making prophecies with decision predicates (Q5408559) (← links)
• Delay-bounded scheduling (Q5408560) (← links)
• On interference abstractions (Q5408561) (← links)
• Dynamic multirole session types (Q5408562) (← links)
• Practical affine types (Q5408563) (← links)
• Dynamic inference of static types for ruby (Q5408564) (← links)
• Robin Milner 1934--2010 (Q5408565) (← links)
• Space overhead bounds for dynamic memory management with partial compaction (Q5408567) (← links)
• Laws of order (Q5408568) (← links)
• Complexity of pattern-based verification for multithreaded programs (Q5408569) (← links)
• EigenCFA (Q5408570) (← links)
• Bisimulation for quantum processes (Q5408571) (← links)
• Safe nondeterminism in a deterministic-by-default parallel language (Q5408574) (← links)
• Loop transformations (Q5408575) (← links)
• The essence of compiling with traces (Q5408577) (← links)
• Resourceable, retargetable, modular instruction selection using a machine-independent, type-based tiling of low-level intermediate code (Q5408578) (← links)
• Verifying higher-order functional programs with pattern-matching algebraic data types (Q5408579) (← links)
• Streaming transducers for algorithmic verification of single-pass list-processing programs (Q5408580) (← links)
• Decidable logics combining heap structures and data (Q5408581) (← links)