in reply to Re: Comparative satisfiability of regexps.
in thread Comparative satisfiability of regexps.
I'm attempting to answer the question, "Does any XML document described by A.xsd satisfy the constraints of B.xsd?" Which is, as far as I can tell, calculable iff one can calculate the answer to the question, "Does regexp A satisfy the constraints of regexp B?"
I was quite surprised to find that nobody is apparently even considering the question as it relates to .xsd's, which to my mind misses one of the really great opportunities for proving the correctness of loosely coupled, distributed application networks. Apparently, people are only concerned either with tightly-coupled, pre-negotiated application networks (where correctness is known because application A's output and application B's input are constrained by the same .xsd), or with ad-hoc, one-off verification that this particular instance of application A's output is consistent with application B's input requirements.
I think this is regrettable, and should be fixed. Hence the preceding discussion.
Thanks for your patience, and your knowledge, and your help!
Mickey.
UPDATE:An .xsd (XML Schema Definition) file defines the allowable names, structures, and contents of XML elements and attributes in an XML file. One might write a calendaring application that took XML input, and whose input was specified by an .xsd ("a .xsd"? "an xsd"? "an .xsd"? Bah!) that required the input XML to contain a date element, a time element, and a schedule_item_name element. And so on.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^3: Comparative satisfiability of regexps.
by BrowserUk (Patriarch) on Jan 20, 2005 at 10:13 UTC | |
Re^3: Comparative satisfiability of regexps.
by tall_man (Parson) on Jan 20, 2005 at 16:45 UTC | |
by qq (Hermit) on Jan 21, 2005 at 17:34 UTC | |
Re^3: Comparative satisfiability of regexps.
by paulbort (Hermit) on Jan 20, 2005 at 19:07 UTC |