FormalZ @ cseet2020
0 likes26 views
This document provides guidance for teachers on using FormalZ, a game-based learning platform for teaching formal methods. It outlines how teachers can create puzzle problems with pre-conditions and post-conditions, invite students to join problem rooms, and monitor student progress in real-time using integrated analytics. Additional details are given on fully installing FormalZ locally using Docker or Vagrant for testing purposes.
![How to create a problem ?
● Problem header
○ Valid header of a java static method.
■ Without the keyword static not access modifier like public
■ Example: int foo(int[] anArray)
○ Allowed types:
■ int, boolean, int[], boolean[]
● Define the pre and post conditions using a pseudo-code like syntax
● Examples:
○ Problem: Given two non-negative integers, max(x,y) returns the greatest of the two.
Use "retval" to refer to the return value.
○ Preconditions
■ Pre condition: (x >= 0) && (y >= 0)
■ Post condition: ((retval == x) || (retval == y)) && (retval >= x) && (retval >= y)](https://image.slidesharecdn.com/formalzcseet2020-201111173941/85/FormalZ-cseet2020-5-320.jpg)
![Complete BNF for formulas
● Formula ::= Expr relationalOp Expr
| ! Formula // negation
| Formula logicalOp Formula
| forall ( arrayIndentifier , indexIdentifier -> Formula )
| exists( arrayIndentifier , indexIdentifier -> Formula )
relationalOp is one of: == <= < > >=
logicalOp is one of: && ||
arrrayIdentifier is an identifier of an array-type, e.g. a, b
indexIdentfier is an identifier of int type, e.g. k, i, j
Expr ::= an integer value
| an identifier of int type
| Expr nummericOp Expr
| arrayIdentifier.length
| arrayIdentifier[ Expr ]
nummericOp is one of: + - *
We advise to restrict the use of * so that
one of the argument should be a
constant, else the resulting pre/post-
condition might be undecidable for the
back-end theorem prover.
Red are terminal
symbols.](https://image.slidesharecdn.com/formalzcseet2020-201111173941/85/FormalZ-cseet2020-6-320.jpg)
FormalZ @ cseet2020
- 1. FormalZ : Playful Formal Method E R A S M U S + Project 2017-1-NL01-KA203-035259 Iván Martínez Ortiz Universidad Complutense de Madrid IMPRESS Project https://impress-project.eu/
- 2. What do I need to do as a teacher? 1. Join as a teacher in FormalZ 2. Create a Room 3. Prepare some problems 4. Ask the students to join the room 5. Let them play (and oversee) the gameplay Bonus: setup your own FormalZ installation
- 3. How to create a problem ? ● You need to think about the problem in terms of ○ Core elements ■ Problem Header ■ Pre-condition ■ Post-condition ■ Problem description => For the students Programinput output pre-condition post-condition
- 4. How to create a problem ? ● Additional elements ■ Difficulty ■ Amount of intermediate problems ● Gaming elements ■ Available lives ■ Available money ● Visibility options ○ Usually used for assignments. ○ Available and due Dates
- 5. How to create a problem ? ● Problem header ○ Valid header of a java static method. ■ Without the keyword static not access modifier like public ■ Example: int foo(int[] anArray) ○ Allowed types: ■ int, boolean, int[], boolean[] ● Define the pre and post conditions using a pseudo-code like syntax ● Examples: ○ Problem: Given two non-negative integers, max(x,y) returns the greatest of the two. Use "retval" to refer to the return value. ○ Preconditions ■ Pre condition: (x >= 0) && (y >= 0) ■ Post condition: ((retval == x) || (retval == y)) && (retval >= x) && (retval >= y)
- 6. Complete BNF for formulas ● Formula ::= Expr relationalOp Expr | ! Formula // negation | Formula logicalOp Formula | forall ( arrayIndentifier , indexIdentifier -> Formula ) | exists( arrayIndentifier , indexIdentifier -> Formula ) relationalOp is one of: == <= < > >= logicalOp is one of: && || arrrayIdentifier is an identifier of an array-type, e.g. a, b indexIdentfier is an identifier of int type, e.g. k, i, j Expr ::= an integer value | an identifier of int type | Expr nummericOp Expr | arrayIdentifier.length | arrayIdentifier[ Expr ] nummericOp is one of: + - * We advise to restrict the use of * so that one of the argument should be a constant, else the resulting pre/post- condition might be undecidable for the back-end theorem prover. Red are terminal symbols.
- 7. How to invite students ? ● Activate the check “Invite link” during room creation ○ You can edit an already created Room activate the check. ○ Distribute the join link among students ● Manually add each of the students ○ Only their email is required. ○ FormalZ will send an invitation link
- 8. Let’s play ! ● Once joined to a Room, students have access to all the problems there ○ Note: that as a teacher you can hide and archive problems ● Now what ? ○ If you are with your students in the very same location you can watch an oversee the activity. ● But, what if ○ I have a lot of students ? ○ we are not in the same location ?
- 9. Analytics ● After the students finishes the puzzle or quit, the leaderboard and some statistics are updated. ● FormalZ it is integrated with RAGE Analytics, so it is possible to get near real-time updates on the student progress
- 10. Bonus: How to install ● All results and documentation are available at https://impress-project.eu/formalz/ ● We have prepared a docker-based installation available at https://github.com/e-ucm/formalz-installer ● There is also a vagrant template so, you can easily test it in a VM in your laptop. ● If you want real-time analytics, you need to install RAGE Analytics BEFORE installing Formalz https://github.com/e-ucm/rage-analytics/tree/impress