Bibliography

1

L. Adleman, ``Short Permutation Strings'', Discrete Mathematics 10, 1974, pp. 197-200.

2

M. Burgess, ``A Site Configuration Engine'', Computing Systems 8, 1995.

3

M. Burgess and R. Ralston, ``Distributed Resource Administration Using Cfengine'', Software: practice and experience 27, 1997.

4

M. Burgess, ``Computer Immunology'', Proc. LISA-XII, 1998.

5

M. Cai, ``A New Bound on the Length of the Shortest String Containing all r-Permutations'', Discrete Mathematics 39, 1982, pp. 329-330

6

S. C. Cheung and J. Kramer, ``Checking subsystem safety properties in compositional reachability analysis'', Proceedings of the International Conference on Software Engineering, Berlin, Germany, March 25-29, 1996.

7

A. Couch, ``SLINK: simple, effective filesystem maintenance abstractions for community-based administration'', Proc. Lisa-X, Usenix Assoc, 1996.

8

A. Couch, ``Chaos out of order: a simple, scalable file distribution facility for `intentionally heterogeneous' networks'', Proc. LISA-XI, Usenix Assoc., 1997.

9

A. Couch and M. Gilfix, ``It's elementary, dear Watson: applying logic programming to convergent system management processes'', Proc. Lisa-XIII, Usenix Assoc., 1999.

10

Alva L. Couch, ``An expectant chat about script maturity'', Proc. LISA-XIV, Usenix Assoc., 2000.

11

S. Duri, U. Buy, R. Devarapalli, and S. M. Shatz, ``Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada'', ACM Transactions on Software Engineering and Methodology, 3, No. 4, ACM Press, 1994.

12

Ellery Eells, Probabilistic Causality, Cambridge University Press, 1991.

13

G. Galbiati and F. P. Preparata, ``On Permutation-Embedding Sequences'' SIAM Journal on Applied Mathematics 30, No. 3 (May, 1976), pp. 421-423.

14

M. Gilfix and A. Couch, ``Peep (the network auralizer): monitoring your network with sound'', Proc. LISA-XIV, Usenix Assoc., 2000.

15

C. Goldfarb and P. Prescod, The XML Handbook, 2nd Edition, Prentice-Hall, Inc., 2000.

16

S Hansen and T. Atkins, ``Centralized system monitoring with swatch,'' Proc. LISA VII, Usenix Assoc., 1993.

17

Matt Holgate and Will Partain, ``The Arusha Project: A framework for collaborative Unix system administration'', to appear in Proc. LISA XV, USENIX Assoc., San Diego CA, 2001.

18

Matt Holgate, Will Partain, et al, ``The Arusha Project Web Site'', http://ark.sourceforge.net.

19

D. J. Kleitman and D. J. Kwiatkowski, ``A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences'', Journal of Combinatorial Theory (A) 21, 1976, pp. 129-136.

20

D. Libes, Exploring Expect, O'Reilly and Assoc., 1994.

21

T. McCabe, ``A software complexity measure'', IEEE Trans. Software Engineering 2, 1976.

22

S. P. Mohanty Shortest string containing all permutations, Discrete Mathematics 31, 1980, pp. 91-95.

23

A. Oram and S. Talbot, Managing Projects with Make, 2nd Edition, O'Reilly and Associates, 1991.

24

R. Osterlund, ``PIKT: Problem Informant/Killer Tool'', Proc. LISA-XIV, Usenix Assoc., 2000.

25

Frode Eika Sandnes, ``Scheduling partially ordered events in a randomised framework - empirical results and implications for automatic configuration management'', to appear in Proc. LISA XV, USENIX Assoc., San Diego CA, 2001.

26

C. Savage, ``Short Strings Containing All k-Element Permutations'', Discrete Mathematics 42, 1982, pp. 281-285.

27

A. A. Schaffer, ``Shortest Prefix Strings Containing All Subset Permutations'', Discrete Mathematics 64, 1987, pp. 239-252.

28

J. Trocki, ``Mon, the Server Monitoring Daemon,'' http://www.kernel.org/software/mon.