Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
93
Voted
ISSTA
2006
ACM
115
views
Software Engineering
»
more
ISSTA 2006
»
Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning
15 years 9 months ago
Download
laser.cs.umass.edu
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed approach for addressing this problem is assume-guarantee reasoning. Using rece...
Jamieson M. Cobleigh, George S. Avrunin, Lori A. C...
claim paper
Read More »