Sciweavers

2 search results - page 1 / 1
» Verifying Systems with Integer Constraints and Boolean Predi...
Sort
View
ISSTA
1998
ACM
13 years 9 months ago
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
Tevfik Bultan, Richard Gerber, Christopher League
KBSE
2007
IEEE
13 years 11 months ago
Ensuring consistency in long running transactions
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
Jeffrey Fischer, Rupak Majumdar