3837 search results - page 103 / 768 » Concurrent Engineering support in Software Engineering |
137
click to vote
VMCAI
2009
Springer
15 years 10 months ago
2009
Springer
lue Abstraction for Verifying Linearizability Viktor Vafeiadis Microsoft Research, Cambridge, UK This paper presents a novel abstraction for heap-allocated data structures that kee...
127
click to vote
AMAST
2006
Springer
15 years 7 months ago
2006
Springer
This article demonstrates how a powerful and expressive ion from concurrency theory--monads of resumptions--plays a dual r^ole as a programming tool for concurrent applications. Th...
132
click to vote
VMCAI
2010
Springer
16 years 15 days ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
100
click to vote
APSEC
2008
IEEE
15 years 9 months ago
2008
IEEE
straction to Verify Arbitrary Temporal Properties Amir Pnueli New York University and Weizmann Institute of Sciences (Emeritus) Perspectives in Concurrency Theory, Chennai, 15 Dece...
118
click to vote
VSTTE
2005
Springer
15 years 8 months ago
2005
Springer
After some general remarks about program verification, we introduce separation logic, a novel extension of Hoare logic that can strengthen the applicability and scalability of pro...