60 search results - page 8 / 12 » Compositional Proofs with Symbolic Execution |
IFIP
2004
Springer
14 years 29 days ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
FOCS
2003
IEEE
14 years 27 days ago
2003
IEEE
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
TSC
2010
13 years 6 months ago
2010
—Web Services are the most famous implementation of service oriented architectures that has brought some challenging research issues. One of these is the composition, i.e. the ca...
HOLOMAS
2007
Springer
14 years 1 months ago
2007
Springer
An approach to extend process monitoring with the help of information agents (IA) handling semantic data is presented in this paper. According to this approach, an operator of a pr...