Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-12904-4_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Dynamic Synthesis for Relaxed Memory Models

2012English

Partial-Coherence Abstractions for Relaxed Memory Models

ACM SIGPLAN Notices
2011English

Can We Schedule Traffic More Efficiently in Optical Packet Switches?

2006English

Formal Automatic Verification of Cache Coherence in Multiprocessors With Relaxed Memory Models

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
2000English

Summarizing Procedures in Concurrent Programs

ACM SIGPLAN Notices
2004English

Synthesis of Concurrent Programs

Teaching Mathematics and Computer Science
2015English

On Sequentializing Concurrent Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Model Checking Concurrent Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Proving Acceptability Properties of Relaxed Nondeterministic Approximate Programs

ACM SIGPLAN Notices
Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy