TACAS11: Compositionality Entails Sequentializability
来源:互联网 发布:kettle json输出 编辑:程序博客网 时间:2024/06/05 06:27
Almost all existing approaches that verify concurrent program restrict the number of contxt switch such that an under-approximation can be obtained.
But this paper avoid this by Compositionality, so it can transform the concurrent program into sequential one, which make it possible to be verified by exiting tools.
I am not too interest in this topic
- TACAS11: Compositionality Entails Sequentializability
- but also entails pain and suffering
- 读论文笔记-主题-semantic compositionality
- TACAS11: Transition Invariants and Transition Predicate Abstraction for Program Termination
- TACAS11: Canonized Rewriting and Ground AC Completion Modulo Shostak Theories
- Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank
- Distributed Representations of Words and Phrasesand their Compositionality
- Distributed Representations of Words and Phrasesand their Compositionality
- 《Distributed Representations of Words and Phrases and their Compositionality》笔记
- 翻译:Distributed Representations of Words and Phrases and their Compositionality
- TACAS11: Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models
- 读论文《Distributed Representations of Words and Phrases and their Compositionality》
- Effective C# 第二版 中文 之03
- 教你用C语言编写"vb"程序
- cxGrid的一点使用方法
- 对于Android的http请求的容错管理
- 新的起点
- TACAS11: Compositionality Entails Sequentializability
- 编码:utf-8,unicode,gbk....
- 开源软件收集
- Liferay Portal 6学习笔记1:Portal介绍
- 如何定制文本框的背景
- JAVA线程间的通信
- 八数码问题 IDA*算法+曼哈顿距离 poj 1077
- Liferay Portal 6学习笔记2:Liferay Portal6安装及简单设置
- Liferay Portal 6学习笔记3:Liferay IDE的安装使用