Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
To support the rapid growth of the web and e-commerce, W3C developed DOM as an application programming interface that the abstract, logical tree structure of an XML document. In t...
This paper describes a new approach to programming autonomic systems. Autonomic functions are integrated into element objects at design time using a special language called JSpoon...