Abstract
In sequential computing, every method of an object can be described in isolation via preconditions and postconditions. However, reasoning in a concurrent setting requires a characterization of all possible interactions acrossmethod invocations.Herlihy and Wing [1990]'s notion of linearizability simplifies such reasoning by intuitively ensuring that each method invocation "takes effect" between its invocation and response events. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Jagadeesan, R., Petri, G., Pitcher, C., & Riely, J. (2013). Quarantining weakness: Compositional reasoning under relaxed memory models (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7792 LNCS, pp. 492–511). https://doi.org/10.1007/978-3-642-37036-6_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
