17 search results - page 4 / 4 » Team Automata Satisfying Compositionality |
CADE
2006
Springer
14 years 6 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
CASCON
2010
13 years 2 months ago
2010
For a system of distributed processes, correctness can be ensured by (statically) checking whether their composition satisfies properties of interest. However, web services are dis...