Backwards type analysis of asynchronous method calls
From MaRDI portal
Recommendations
- Interprocedural analysis of asynchronous programs
- Secure implementation of asynchronous method calls and futures
- A run-time environment for concurrent objects with asynchronous method calls
- A sound and complete reasoning system for asynchronous communication with shared futures
- scientific article; zbMATH DE number 2090648
Cites work
- scientific article; zbMATH DE number 954809 (Why is no real title available?)
- scientific article; zbMATH DE number 1018876 (Why is no real title available?)
- scientific article; zbMATH DE number 2161330 (Why is no real title available?)
- A Complete Guide to the Future
- A calculus for concurrent objects
- A concurrent lambda calculus with futures
- A syntactic approach to type soundness
- Asynchronous and deterministic objects
- Concurrent Programming in ML
- Conditional rewriting logic as a unified model of concurrency
- Creol: A type-safe object-oriented model for distributed concurrent systems
- MULTILISP: a language for concurrent symbolic computation
- Maude: specification and programming in rewriting logic
- Polymorphic type, region and effect inference
- Programming Languages and Systems
- Region-based memory management
- The semantics of future and an application
- Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
This page was built for publication: Backwards type analysis of asynchronous method calls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953530)
