IFC Step 1

Task: Ensure that at any runs of your program, the low (public) variable l has the same value as the high (private) variable h.

All variables are boolean and can therefore only be true or false.

Write in your program in the text area below, satisfying the following type system.

A variable is high if its name starts with the letter "h", otherwise it is low.

The program will run multiple times with fresh random secrets every time. All runs must leak successfully.





        

            
Type system

            
(If you don't know inference rules, or they are too confusing, see the note below.)


            
            
Note:

    Any syntactically valid program is accepted.



        

        

        Read more: 


        Language-Based Information-Flow Security


        

        


            

        


        

            
Syntax

            

<program> ::= <topstms>


<topstms> ::= <stm> <stms>

   <stms> ::= <stm> <stms>
           | {empty}

    <stm> ::= skip;                            (a statement with no effect)
           |  x = <expr>;                      (assignment)
           |  { <stm> ... }                    (block statement)
           |  if (<expr>) <stm> else <stm>     (a conditional statement)
           |  if (<expr>) <stm>                (a conditional statement)
           |  while (<expr>) <stm>             (a loop statement)


   <expr> ::= true | false                     (boolean literals)
           |  <expr> && <expr>                 (boolean and)
           |  <expr> || <expr>                 (boolean or)
           |  ! <expr>                         (boolean negation)
           |  x                                (boolean variable)