Sciweavers

12148 search results - page 2057 / 2430
» Generalized Bundle Methods
Sort
View
SIGSOFT
2007
ACM
16 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
178
Voted
SIGSOFT
2003
ACM
16 years 8 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
165
Voted
SIGSOFT
2002
ACM
16 years 8 months ago
Negative scenarios for implied scenario elicitation
Scenario-based specifications such as Message Sequence Charts (MSCs) are popular for requirement elicitation and specification. MSCs describe two distinct aspects of a system: on ...
Sebastián Uchitel, Jeff Kramer, Jeff Magee
210
Voted
WWW
2009
ACM
16 years 8 months ago
Characterizing insecure javascript practices on the web
JavaScript is an interpreted programming language most often used for enhancing webpage interactivity and functionality. It has powerful capabilities to interact with webpage docu...
Chuan Yue, Haining Wang
WWW
2008
ACM
16 years 8 months ago
Learning deterministic regular expressions for the inference of schemas from XML data
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn V...
« Prev « First page 2057 / 2430 Last » Next »