Come for the quick hacks, stay for the epiphanies. | |
PerlMonks |
Re^4: Comparative satisfiability of regexps.by Meowse (Beadle) |
on Jan 20, 2005 at 10:10 UTC ( [id://423652]=note: print w/replies, xml ) | Need Help?? |
All true, and well-said, except that the precise commodity desired in this case is proof of the compatibility of two unprovable entities. My code neither knows nor cares what the two regexps "mean", or whether they correctly represent the author's intent; it only cares that output which satisfies the first regexp can be affirmatively stated to satisfy the second regexp.
In our particular instance, we're attempting to verify the correctness of a meta-application built of sequentially assembled functoids whose input and output contracts are specified as .xsd files. We don't want to know what any given functoid does, or what its parameters (or outputs) represent. We just want to verify that a given sequence of correct functoids is itself correct. As a separate note, I'm really disinclined to accept Monte Carlo proofs in the hard sciences. I'll accept them in the soft sciences, but only because there aren't better alternatives. In programming in particular, there's almost always a formal proof of correctness available. Thanks much, Mickey.
In Section
Seekers of Perl Wisdom
|
|