[isabelle] Hoare-Logic-bubble_Sort



Hi 
i want to proof the correctness of the bubble Sort algoritmo 
procedure BubbleSort( A : lista degli elementi da ordinare )
  scambio ← true
  while scambio
    scambio ← false
    for i ← 0 to length(A)-2  do
      if A[i] > A[i+1] then
        swap( A[i], A[i+1] )
        scambio ← true
There exists any Hoare Logic theory in Isabelle that can i use to proof that algorithm (In particular a Hoare Logic theory in Isabelle that implement Arrays too ) 

Thanks


This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.