When does 0–1 Principle Hold for Prefix Sums?

• Published in: New generation computing Vol. 41; no. 3; pp. 523 - 531
• Main Author: Morihata, Akimasa
• Format: Journal Article
• Language: English
• Published: Tokyo Springer Japan 01.09.2023; Springer Nature B.V
• Subjects: Artificial Intelligence; Boolean; Computer Hardware; Computer Science; Computer Systems Organization and Communication Networks; Operators (mathematics); Principles; Programming languages; Questions; Software Engineering/Programming and Operating Systems; Sums; Prefix sum; Relational parametricity; 0–1 principle; Testing
• ISSN: 0288-3635; 1882-7055
• DOI: 10.1007/s00354-023-00219-0

Knuth’s 0–1 principle argues that the correctness of any swap-based sorting network can be verified by testing arbitrary sequences over Boolean values (i.e., 0 and 1). Voigtländer (Proceedings of the 35th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL 2008, San Francisco, California, USA, January 7–12, 2008. ACM, New York, NY, pp 29–35, 2008. https://doi.org/10.1145/1328438.1328445 ) proved a similar result for prefix-sum networks that consist of associative binary operators: the correctness can be verified by testing arbitrary sequences and associative binary operators over three values, namely 0, 1, and 2. He raised the question of whether testing over Boolean values is sufficient if the binary operator is idempotent in addition to associative. This paper answers his question. First, there is an incorrect prefix-sum network for associative idempotent operators, the flaw of which cannot be detected by testing over Boolean values. Second, testing over Boolean values is sufficient if the binary operators are restricted to commutative in addition to associative and idempotent.