534 search results - page 59 / 107 » Proving Termination of Rewrite Systems Using Bounds |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
CEAS
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we detail the use of e-mail social network analysis for the detection of security policy violations on computer systems. We begin by formalizing basic policies that ...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, c...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
FIDJI
2003
Springer
14 years 29 days ago
2003
Springer
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...