Quasi-Linearizability is Undecidable
Abstract elided by the publisher.
Related papers
- On Quasi-Open Bisimulation APLAS 2002
- QUASY: Quantitative Synthesis Tool TACAS 2011
- Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract) CAV 1997
- Quasi-Equal Clock Reduction: More Networks, More Queries TACAS 2014
- Polychotomic Encoding: A Better Quasi-Optimal Bit-Vector Encoding of Tree Hierarchies ECOOP 2002
- Static Analysis by Abstract Interpretation of the Quasi-synchronous Composition of Synchronous Programs VMCAI 2005
- A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests ECOOP 2001
- Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes POPL 1993