Share This Author
XPath satisfiability in the presence of DTDs
A finer analysis of the problem for particular classes of DTDs is given, exploring the impact of various DTD constructs, identifying tractable cases, as well as providing the complexity in the query size alone.
Analysis of recursive state machines
- R. Alur, M. Benedikt, K. Etessami, Patrice Godefroid, T. Reps, M. Yannakakis
- Computer ScienceTOPL
- 18 July 2001
This study examines the verification of linear time properties of RSMs, and easily derive algorithms for linear time temporal logic model checking with the same complexity in the model.
VeriWeb: Automatically Testing Dynamic Web Sites
VeriWeb is presented, a tool for automatically discovering and systematically exploring Web-site execution paths that can be followed by a user in a Web application that can navigate automatically through dynamic components of Web sites, including form submissions and execution of client-side script.
This survey gives an overview of formal results on the XML query language XPath and its fragments compared to other formalisms for querying trees, algorithms, and complexity bounds for evaluation ofXPath queries, as well as static analysis of XPath queries.
Structural properties of XPath fragments
Structural properties of each of the main sublanguages of navigational XPath (W3c Recommendation) commonly used in practice are studied, providing sound and complete axiom systems and normal forms for several of these fragments.
Cyberspace: First Steps
- M. Benedikt
- Computer Science, Art
- 30 October 1991
These original contributions take up the philosophical basis for cybersspace in virtual realities, basic communications principles, ramifications of cyberspace for future workplaces, and more.
E-services: a look behind the curtain
This paper examines proposals and standards for e-services from the perspectives of XML, data management, workflow, and process models, including behavioral service signatures, verification and synthesis techniques for composite services, analysis of service data manipulation commands, and XML analysis applied to service specifications.
Efficient network aware search in collaborative tagging sites
- S. Amer-Yahia, M. Benedikt, L. Lakshmanan, Julia Stoyanovich
- Computer ScienceProc. VLDB Endow.
- 1 August 2008
This paper investigates efficient top-k processing when the score of an answer is computed as its popularity among members of a seeker's network, and develops algorithms based on maintaining score upper-bounds.
Benchmarking the Chase
This work provides the first comprehensive and publicly available benchmark---test infrastructure and a set of test scenarios---for evaluating chase implementations across a wide range of assumptions about the dependencies and the data.