Bruno Buchberger, Adrian Craciun,
"Proving the correctness of the merge-sort algorithm with theorema."
: Symbolic and Numeric Algorithms for Scientific Computing, Proceedings of the SYNASC02 Workshop, Seite(n) 97-111, 10-2002, ISBN: 973-585-785-5, A. Craciun and B. Buchberger. Proving the correctness of the merge-sort
algorithm with theorema.In Symbolic and Numeric Algorithms for Scientific Computing,
Proceedings of the SYNASC02 Workshop, pages 97-111, Timisoara, Romania,
October 2002. ISBN 973-585-785-5. (15 pages)
Original Titel:
Proving the correctness of the merge-sort algorithm with theorema.
Sprache des Titels:
Englisch
Original Buchtitel:
Symbolic and Numeric Algorithms for Scientific Computing, Proceedings of the SYNASC02 Workshop
Seitenreferenz:
97-111
Erscheinungsmonat:
10
Erscheinungsjahr:
2002
Notiz zum Zitat:
A. Craciun and B. Buchberger. Proving the correctness of the merge-sort
algorithm with theorema.In Symbolic and Numeric Algorithms for Scientific Computing,
Proceedings of the SYNASC02 Workshop, pages 97-111, Timisoara, Romania,
October 2002. ISBN 973-585-785-5. (15 pages)
Forschungs-