1360 search results - page 196 / 272 » Reasoning on Workflow Executions |
JPDC
2007
13 years 8 months ago
2007
Client interactions with modern web-accessible network services are typically organized into sessions involving multiple requests that read and write shared application data. Ther...
ISSTA
2012
ACM
11 years 11 months ago
2012
ACM
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
ICFP
2004
ACM
14 years 8 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
ESOP
2010
Springer
14 years 6 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
LCTRTS
2001
Springer
14 years 1 months ago
2001
Springer
1 COTS (commercial off-the-shelf) devices are capable of executing powerful, distributed algorithms. Very large, adaptive systems can be created by simply integrating these devices...