ISSUE-3: Can we limit the generality of subsetting to reduce complexity, e.g. XPath 2.0
Can we limit the generality of subsetting to reduce complexity, e.g. XPath 2.0
- State:
- CLOSED
- Product:
- XML Security 1.1 Requirements and Design Considerations
- Raised by:
- Scott Cantor
- Opened on:
- 2008-07-17
- Description:
- Related Actions Items:
- No related actions
- Related emails:
- Action: A need to address requirements listed as Issues (from gerald.edgar@boeing.com on 2008-09-22)
- Meeting record: 2008-07-17 (from tlr@w3.org on 2008-08-12)
- [draft minutes] XML Security WG f2f 2008-07-17 (from tlr@w3.org on 2008-07-25)
- ISSUE-3: (from sysbot+tracker@w3.org on 2008-07-22)
- F2F BCN 20080717 Thursday morning (from brich@us.ibm.com on 2008-07-21)
Related notes:
incorporated in http://www.w3.org/2008/xmlsec/track/issues/65
Display change log
