Verification of semantic commutativity conditions and inverse operations on linked data structures
We present a new technique for verifying commutativity conditions, which are logical formulas that characterize when operations commute. Because our technique reasons with the abstract state of verified linked data structure implementations, it can verify commuting operations that produce semantical...
Main Authors: | Kim, Deokhwan (Contributor), Rinard, Martin C. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2012-08-27T18:19:26Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Verification of semantic commutativity conditions and inverse operations on linked data structures
by: Kim, Deokhwan
Published: (2012) -
Parallelizing Sequential Programs with Statistical Accuracy Tests
by: Misailovic, Sasa, et al.
Published: (2015) -
Commutative Watermarking-Encryption of Audio Data with Minimum Knowledge Verification
by: Roland Schmitz, et al.
Published: (2017-01-01) -
Inverse Commutativity Conditions for Second-Order Linear Time-Varying Systems
by: Mehmet Emir Koksal
Published: (2017-01-01) -
Exploiting semantic commutativity in hardware speculation
by: Zhang, Guowei, et al.
Published: (2017)