Formally Proving Size Optimality of Sorting Networks
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Automated Reasoning"
DOI: 10.1007/s10817-017-9405-9
Abstract: Recent successes in formally verifying increasingly larger computer-generated proofs have relied extensively on (a) using oracles, to find answers for recurring subproblems efficiently, and (b) extracting formally verified checkers, to perform exhaustive case analysis in… read more here.
Keywords: size optimality; sorting networks; formally proving; optimality sorting ... See more keywords