Simplifying Linearizability Proofs With Reduction and Abstraction

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-12002-2_25
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Aspect-Oriented Linearizability Proofs

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Simplifying Process Model Abstraction: Techniques for Generating Model Names

Information Systems
HardwareInformation SystemsArchitectureSoftware
2014English

Linearizability With Ownership Transfer

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Tools for Simplifying Proofs of Properties of Timed Automata: The TAME Template, Theories, and Strategies.

1999English

Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1984English

TSO-to-TSO Linearizability Is Undecidable

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2017English

Fluoride Abstraction and Reversible Photochemical Reduction of Cationic Uranyl(VI) Phosphine Oxide Complexes

English

Verifying Computations With Streaming Interactive Proofs

Proceedings of the VLDB Endowment
Computer Science
2011English

Simplifying Infusion Calculations

BMJ
1985English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy