120
click to vote
CONCUR
2003
Springer
15 years 3 months ago
2003
Springer
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
CALCO
2005
Springer
15 years 3 months ago
2005
Springer
We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ibeh, which captures formally and abstractly the intuitions of add...
CSFW
2008
IEEE
15 years 4 months ago
2008
IEEE
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...