Pages that link to "Item:Q5255055"
From MaRDI portal
The following pages link to Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Q5255055):
Displaying 40 items.
- Reconfigurable asynchronous logic automata (Q5255056) (← links)
- On the verification problem for weak memory models (Q5255057) (← links)
- Coarse-grained transactions (Q5255058) (← links)
- Sequential verification of serializability (Q5255059) (← links)
- Compositional may-must program analysis (Q5255061) (← links)
- Continuity analysis of programs (Q5255062) (← links)
- Program analysis via satisfiability modulo path programs (Q5255063) (← links)
- A simple, verified validator for software pipelining (Q5255064) (← links)
- A verified compiler for an impure functional language (Q5255065) (← links)
- Verified just-in-time compiler on x86 (Q5255066) (← links)
- Dependent types from counterexamples (Q5255067) (← links)
- Low-level liquid types (Q5255068) (← links)
- Type inference for datalog with complex type hierarchies (Q5255069) (← links)
- Nominal system T (Q5255070) (← links)
- A theory of indirection via approximation (Q5255071) (← links)
- A relational modal logic for higher-order stateful ADTs (Q5255072) (← links)
- Decision procedures for algebraic data types with abstractions (Q5255074) (← links)
- Automatic numeric abstractions for heap-manipulating programs (Q5255075) (← links)
- Static determination of quantitative resource usage for higher-order programs (Q5255076) (← links)
- Toward a verified relational database management system (Q5255077) (← links)
- Counterexample-guided focus (Q5255078) (← links)
- Structuring the verification of heap-manipulating programs (Q5255079) (← links)
- Dependent types and program equivalence (Q5255080) (← links)
- Pure subtype systems (Q5255082) (← links)
- Modular session types for distributed object-oriented programming (Q5255084) (← links)
- From program verification to program synthesis (Q5255085) (← links)
- Abstraction-guided synthesis of synchronization (Q5255086) (← links)
- Programming with angelic nondeterminism (Q5255092) (← links)
- Contracts made manifest (Q5255093) (← links)
- Threesomes, with and without blame (Q5255094) (← links)
- Integrating typed and untyped code in a scripting language (Q5255096) (← links)
- Generating compiler optimizations from proofs (Q5255097) (← links)
- Automatically generating instruction selectors using declarative machine descriptions (Q5255098) (← links)
- Semantics and algorithms for data-dependent grammars (Q5255099) (← links)
- Paralocks (Q5255100) (← links)
- Modular verification of security protocol code by typing (Q5255101) (← links)
- Dynamically checking ownership policies in concurrent c/c++ programs (Q5255102) (← links)
- Nested interpolants (Q5255103) (← links)
- Monads in action (Q5255104) (← links)
- Higher-order multi-parameter tree transducers and recursion schemes for program verification (Q5255106) (← links)
