1875 search results - page 248 / 375 » A Calculus of Broadcasting Systems |
KBSE
1998
IEEE
15 years 2 months ago
1998
IEEE
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
176
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
APLAS
2009
ACM
15 years 4 months ago
2009
ACM
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...