The following pages link to Programming Languages and Systems (Q2789030):
Displaying 50 items.
- NetKAT — A Formal System for the Verification of Networks (Q2789031) (← links)
- Optimized Compilation of Multiset Rewriting with Comprehensions (Q2789033) (← links)
- Logic Programming and Logarithmic Space (Q2789034) (← links)
- Automatic Memory Management Based on Program Transformation Using Ownership (Q2789036) (← links)
- The Essence of Ruby (Q2789039) (← links)
- Types for Flexible Objects (Q2789042) (← links)
- A Translation of Intersection and Union Types for the λμ-Calculus (Q2789043) (← links)
- A Formalized Proof of Strong Normalization for Guarded Recursive Types (Q2789044) (← links)
- Functional Pearl: Nearest Shelters in Manhattan (Q2789046) (← links)
- Necessary and Sufficient Preconditions via Eager Abstraction (Q2789048) (← links)
- Resource Protection Using Atomics (Q2789050) (← links)
- Resource Analysis of Complex Programs with Cost Equations (Q2789051) (← links)
- Simple and Efficient Algorithms for Octagons (Q2789052) (← links)
- Compositional Entailment Checking for a Fragment of Separation Logic (Q2789053) (← links)
- Automatic Constrained Rewriting Induction towards Verifying Procedural Programs (Q2789055) (← links)
- A ZDD-Based Efficient Higher-Order Model Checking Algorithm (Q2789057) (← links)
- Inferring Grammatical Summaries of String Values (Q2789061) (← links)
- Syntax-Directed Divide-and-Conquer Data-Flow Analysis (Q2789063) (← links)
- Call-by-Value in a Basic Logic for Interaction (Q2789064) (← links)
- Hereditary History-Preserving Bisimilarity: Logics and Automata (Q2789065) (← links)
- Running Probabilistic Programs Backwards (Q2802430) (← links)
- A Verified Compiler for Probability Density Functions (Q2802431) (← links)
- Segment Abstraction for Worst-Case Execution Time Analysis (Q2802432) (← links)
- Automatic Static Cost Analysis for Parallel Programs (Q2802433) (← links)
- Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs (Q2802435) (← links)
- Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs (Q2802436) (← links)
- A Theory of Name Resolution (Q2802438) (← links)
- A Core Calculus for XQuery 3.0 (Q2802439) (← links)
- Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity (Q2802440) (← links)
- Witnessing (Co)datatypes (Q2802441) (← links)
- Refinement Types for Incremental Computational Complexity (Q2802443) (← links)
- Monotonic References for Efficient Gradual Typing (Q2802447) (← links)
- Inter-procedural Two-Variable Herbrand Equalities (Q2802449) (← links)
- Fine-Grained Detection of Privilege Escalation Attacks on Browser Extensions (Q2802451) (← links)
- Analysis of Asynchronous Programs with Event-Based Synchronization (Q2802452) (← links)
- A Semantics for Propositions as Sessions (Q2802455) (← links)
- Composite Replicated Data Types (Q2802456) (← links)
- Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement (Q2802457) (← links)
- Spatial Interpolants (Q2802459) (← links)
- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs (Q2802460) (← links)
- Full Reduction in the Face of Absurdity (Q2802461) (← links)
- CoLoSL: Concurrent Local Subjective Logic (Q2802462) (← links)
- A Separation Logic for Fictional Sequential Consistency (Q2802463) (← links)
- Binding Structures as an Abstract Data Type (Q2802464) (← links)
- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages (Q2802465) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Formalizing Single-Assignment Program Verification: An Adaptation-Complete Approach (Q2802468) (← links)
- Practical Optional Types for Clojure (Q2802470) (← links)
- A Timed Process Algebra for Wireless Networks with an Application in Routing (Q2802472) (← links)
- Computing with Semirings and Weak Rig Groupoids (Q2802473) (← links)
