Artifact for Verification of Randomized Consensus

Verification of Randomized Consensus Algorithms under Round-Rigid Adversaries

This artifact accompanies the technical report and the paper at CONCUR19.

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 in two directories:

  • /home/user/fault-tolerant-benchmarks/random19 contains the benchmarks used in the paper, encoded in generalized threshold automata.
  • /home/user/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 ~/bymc/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 ~/bymc/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:

$ ~/bymc/bymc/verifypa-schema \
   ~/fault-tolerant-benchmarks/random19/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 ~/bymc/bymc/verifypa-schema \
~/fault-tolerant-benchmarks/random19/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

WWTF ICT project awarded to Igor Konnov

Igor Konnov (PI), together with Josef Widder (co-PI) and Helmut Veith (core team), are awarded an ICT research project APALACHE “Abstraction-based Parameterized TLA Checker” by the Vienna Science and Technology Fund WWTF.

Continue reading

Austrian Computer Science Day 2015

The Austrian Computer Science Day 2015, which takes place on October 15, features a range of talks by leading Austrian computer scientists, including topics such as computer games, augmented reality, aware systems, semantic web, business processes, and reliable systems. Register for free by October 7, 2015! This year’s speakers are: Alois Ferscha (JKU Linz) Tom […]

Continue reading

Helmut Veith receives CAV Award

The 2015 CAV Award is given to Edmund Clarke, Orna Grumberg, Ron Hardin, Zvi Harel, Somesh Jha, Robert Kurshan, Yuan Lu, and Helmut Veith for the development and implementation of the localization-reduction technique and the formulation of counterexample-guided abstraction refinement (CEGAR).

Continue reading

FRIDA’15

We had great talks at FRIDA’15 workshop in Grenoble. The slides of some of the talks are available online.

Continue reading

Full news archive