Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Alessandro Beggiato
Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Dynamic Synthesis for Relaxed Memory Models
Partial-Coherence Abstractions for Relaxed Memory Models
ACM SIGPLAN Notices
Can We Schedule Traffic More Efficiently in Optical Packet Switches?
Formal Automatic Verification of Cache Coherence in Multiprocessors With Relaxed Memory Models
IEEE Transactions on Parallel and Distributed Systems
Hardware
Computational Theory
Signal Processing
Architecture
Mathematics
Summarizing Procedures in Concurrent Programs
ACM SIGPLAN Notices
Synthesis of Concurrent Programs
Teaching Mathematics and Computer Science
On Sequentializing Concurrent Programs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Model Checking Concurrent Programs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Proving Acceptability Properties of Relaxed Nondeterministic Approximate Programs
ACM SIGPLAN Notices
Computer Science
