Sciweavers

136 search results - page 2 / 28
» Assume-Guarantee Verification of Concurrent Systems
Sort
View
ATVA
2006
Springer
153views Hardware» more  ATVA 2006»
13 years 11 months ago
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
Wonhong Nam, Rajeev Alur
HYBRID
2001
Springer
13 years 12 months ago
Assume-Guarantee Reasoning for Hierarchical Hybrid Systems
Abstract. The assume-guarantee paradigm is a powerful divide-andconquer mechanism for decomposing a veri cation task about a system into subtasks about the individual components of...
Thomas A. Henzinger, Marius Minea, Vinayak S. Prab...
TOPLAS
1998
55views more  TOPLAS 1998»
13 years 7 months ago
Compositional Verification of Concurrent Systems Using Petri-Net-Based Condensation Rules
Eric Y. T. Juan, Jeffrey J. P. Tsai, Tadao Murata
SAC
2008
ACM
13 years 7 months ago
Preserving coordination properties when transforming concurrent system components
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
Gudmund Grov, Robert F. Pointon, Greg Michaelson, ...
AICOM
2010
127views more  AICOM 2010»
13 years 7 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...