Laura G. Dean. Improved Simulation of Input/Output Automata. Master of Engineering Thesis, Massachusetts Institute of Technology, Cambridge, MA, September 2001.

DVI PostScript PDF(fsvo "portable")

Abstract

The IOA Simulator is part of a collection of tools for developing and analyzing distributed algorithms. This thesis describes several improvements to the Simulator: adding new data type implementations, sharing data types with the IOA Code Generator, improving the Simulator's documentation, and adding an interface to Daikon, an invariant-discovery tool. These improvements should increase the Simulator's usability as a tool in writing and verifying algorithms for distributed systems.

• 2-1 Fibonacci.ioa
• 2-2 Simulator output for sim 6 Fibonacci.ioa
• 2-3 Fibonacci with a schedule block
• 2-4 Fibonacci with a choose block
• 2-5 Fibonacci with a choose block and a det block
• 2-6 Paired Fibonacci
• 2-7 Paired Fibonacci with a using clause
• 2-8 Paired Fibonacci output
• 2-9 Strong cache and central memory
• 3-1 Fibonacci.ioa (same as listing 2-1)
• 3-2 Daikon output for Fibonacci
• 3-3 Fibonacci with unspecified parameters
• 3-4 Daikon output for parameterized Fibonacci
• 3-5 Hanoi
• 3-6 Daikon output for {\tt Hanoi}
  Input IOA files:
  • moving discs from A to B
  • moving discs from A to C
  • moving discs from B to A
  • moving discs from B to C
  • moving discs from C to A
  • moving discs from C to B
• 4-1 BoolToggler.ioa, legal
• 4-2 BoolToggler.ioa, illegal
• 4-3 {\tt Chooser.ioa}, nondeterministic
• 4-4 {\tt ResolvedChooser.ioa}, deterministic
• 5-1 union.il
• B-1 Fibonacci.decls
• B-2 Fibonacci.dtrace, for sim 10 -daikon Fibonacci.ioa
• B-3 Daikon output for a single Hanoi test case