Pages that link to "Item:Q2942852"
From MaRDI portal
The following pages link to Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Q2942852):
Displaying 35 items.
- Freefinement (Q2942853) (← links)
- Underspecified harnesses and interleaved bugs (Q2942854) (← links)
- Towards a program logic for JavaScript (Q2942855) (← links)
- Higher-order functional reactive programming in bounded space (Q2942856) (← links)
- The marriage of bisimulations and Kripke logical relations (Q2942857) (← links)
- Information effects (Q2942859) (← links)
- Probabilistic relational reasoning for differential privacy (Q2942860) (← links)
- Access permission contracts for scripting languages (Q2942863) (← links)
- Recursive proofs for inductive tree data-structures (Q2942864) (← links)
- Symbolic finite state transducers (Q2942866) (← links)
- Multiple facets for dynamic information flow (Q2942868) (← links)
- Defining code-injection attacks (Q2942871) (← links)
- Deciding choreography realizability (Q2942872) (← links)
- Analysis of recursively parallel programs (Q2942873) (← links)
- Nested refinements (Q2942876) (← links)
- An abstract interpretation framework for termination (Q2942877) (← links)
- Playing in the grey area of proofs (Q2942878) (← links)
- Static and user-extensible proof checking (Q2942880) (← links)
- Verification of parameterized concurrent programs by modular reasoning about data and control (Q2942881) (← links)
- Resource-sensitive synchronization inference by abduction (Q2942882) (← links)
- Syntactic control of interference for separation logic (Q2942883) (← links)
- Canonicity for 2-dimensional type theory (Q2942884) (← links)
- Algebraic foundations for effect-dependent optimisations (Q2942885) (← links)
- On the power of coercion abstraction (Q2942887) (← links)
- Towards nominal computation (Q2942888) (← links)
- Programming with binders and indexed data-types (Q2942890) (← links)
- Formalizing the LLVM intermediate representation for verified program transformations (Q2942893) (← links)
- Randomized accuracy-aware program transformations for efficient approximate computations (Q2942894) (← links)
- A rely-guarantee-based simulation for verifying concurrent program transformations (Q2942895) (← links)
- A unified approach to fully lazy sharing (Q2942896) (← links)
- Edit lenses (Q2942897) (← links)
- A mechanized semantics for C++ object construction and destruction, with applications to resource management (Q2942898) (← links)
- A type theory for probability density functions (Q2942901) (← links)
- A type system for borrowing permissions (Q2942905) (← links)
- Self-certification (Q2942906) (← links)
