Sciweavers

317 search results - page 17 / 64
» Reasoning about the Implementation of Concurrency Abstractio...
Sort
View
101
Voted
VMCAI
2010
Springer
15 years 9 months ago
Collections, Cardinalities, and Relations
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
Kuat Yessenov, Ruzica Piskac, Viktor Kuncak
SAC
2010
ACM
15 years 6 months ago
Checking concurrent contracts with aspects
The applicability of aspects as a means of implementing runtime contract checking has been demonstrated in prior work, where contracts are identified as cross-cutting concerns [1...
Eric Kerfoot, Steve McKeever
SIGSOFT
2009
ACM
16 years 12 days ago
Static data race detection for concurrent programs with asynchronous calls
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
Vineet Kahlon, Nishant Sinha, Erik Kruus, Yun Zhan...
88
Voted
SIGSOFT
1994
ACM
15 years 3 months ago
Data Flow Analysis for Verifying Properties of Concurrent Programs
In this paper we present an approach, based on data ow analysis, that can provide cost-e ective analysis of concurrent programs with respect to explicitly stated correctness prope...
Matthew B. Dwyer, Lori A. Clarke
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
15 years 3 months ago
Automated refinement checking of concurrent systems
Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta