Sciweavers

198 search results - page 35 / 40
» Time Equations for Lazy Functional (Logic) Languages
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 9 months ago
Rewriting-Based Techniques for Runtime Verification
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...
Grigore Rosu, Klaus Havelund
POPL
2010
ACM
14 years 6 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
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, ...
POPL
2004
ACM
14 years 9 months ago
Global value numbering using random interpretation
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...
Sumit Gulwani, George C. Necula
DOCENG
2003
ACM
14 years 2 months ago
Set-at-a-time access to XML through DOM
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...
Hai Chen, Frank Wm. Tompa
IEEEAMS
2003
IEEE
14 years 2 months ago
Programming Systems for Autonomy
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...
Alexander V. Konstantinou, Yechiam Yemini