3228 search results - page 333 / 646 » Computationally Sound Proofs |
117
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
136
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
139
click to vote
COORDINATION
2006
Springer
15 years 7 months ago
2006
Springer
We tackle the problem of providing rigorous formal foundations to current software engineering technologies for web services. We focus on two of the most used XML-based languages f...
136
click to vote
FTDCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Web services are essentially black box components from a composer's or a mediator's perspective. The behavioural description of any service can be asserted by the compos...
156
click to vote
CVPR
1998
IEEE
15 years 7 months ago
1998
IEEE
Most of behavior recognition methods proposed so far share the limitations of bottom-up analysis, and singleobject assumption; the bottom-up analysis can be confused by erroneous ...