Artifact for submission 42

Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries

This is the artifact provided for the submission 42.

All of our case studies are available from the github repository. Below we describe the necessary details to reproduce the experiments in the virtual machine.

1. Virtual machine

You can download the virtual machine (VirtualBox, 64-bit, 2.0 GB) from here.

The virtual machine contains Debian GNU/Linux 3.16 with all necessary packages installed. The packages are installed under the user account named ‘user’ with the password ‘user’. If you have to use the root account, the password is ‘root’. Alternatively, you can also use the ‘sudo’ command.

2. Package structure

The artifact files are located under the directory /home/user/submission82, whose structure is as follows:

  • benchmarks/ contains the benchmarks used in the paper, encoded in generalized threshold automata.
  • bymc/ contains the tool (binaries and source code).

3. Platform requirements

We ran the experiments on two systems:

  • a laptop equipped with 16 GB of RAM and Intel® CoreTM i7 processor with 2 cores, 3.5 GHz, and
  • in Grid5000 using 32 nodes of the cluster grvingt, each having 2 CPUs Intel Xeon Gold 6130, 16 cores/CPU, 192GB

To run the experiments in your cluster environment, you have to compile the tool according to the instructions found in ~/submission82/bymc/README.txt.

4. Installation instructions

This virtual machine already contains all the necessary tools and libraries. In case you want to install the tool from scratch, please check the file ~/submission82/bymc/README.txt.

6. Running the individual experiments

In this section, we give the commands to verify the threshold automaton ​n-ben-or.ta. To find the properties, search the code for the section specifications() {...}.

6.1. Single core

The following command runs synthesis on a single CPU core, enumerating all possible solutions:

$ ~/submission82/bymc/verifypa-schema \
   ~/submission82/benchmarks/n-ben-or.ta agreement0 -O schema.incremental=1

You should see the following lines in the output:

> Spec agreement0 holds
nschemas = 9, min length = 42, max length = 88, avg length = 63
min time = 0.000000, max time = 1.000000, avg time = 0.111111
saving game to bymc.ser...
Bye!

6.2. Multiple cores (MPI)

The following command runs synthesis with MPI, enumerating all possible solutions:

$ mpirun -n $NUM_NODES --output-filename out ~/submission82/bymc/verifypa-schema \
~/submission82/benchmarks/n-ben-or.ta agreement -O schema.tech=ltl-mpi

(specify the number of MPI nodes by replacing $NUM_NODES with an actual number)

You can check the log file of the master node in out.0 and the log files of the worker nodes in out.i for i > 0.

Latest News

FORSYTE’s 2018 paper awards

FORSYTE has had a quite successful year: Adrian Rebola Pardo and his co-authors received the IJCAR best paper award for their paper Extended Resolution Simulates DRAT, Mitra Tabaei Befrouei and her co-authors received an OOPSLA 2018 Distinguished Paper award for their paper Randomized Testing of Distributed Systems with Probabilistic Guarantees, and Thomas Pani received the […]

Continue reading

OOPSLA Distinguished Paper Award

Mitra Tabaei Befrouei and her co-authors from MPI-SWS Burcu Kulahcioglu Ozkan, Rupak Majumdar, and Filip Niksic, received an OOPSLA’18 Distinguished Paper Award for their contribution “Randomized Testing of Distributed Systems with Probabilistic Guarantees” (Open Access article). Congratulations!

Continue reading

Zvonimir Rakamiric visiting FORSYTE

Prof. Zvonimir Rakamiric from the School of Computing at the University of Utah is spending his sabbatical with the FORSYTE group at TU Wien. He is generously sponsored by the Wolfgang Pauli Institute and a Pauli Fellow.

Continue reading

Full news archive