Sciweavers

80 search results - page 1 / 16
» Relational queries over program traces
Sort
View
OOPSLA
2005
Springer
13 years 10 months ago
Relational queries over program traces
Instrumenting programs with code to monitor runtime behavior is a common technique for profiling and debugging. In practice, instrumentation is either inserted manually by progra...
Simon Goldsmith, Robert O'Callahan, Alexander Aike...
APLAS
2011
ACM
12 years 4 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
ICDE
2012
IEEE
269views Database» more  ICDE 2012»
11 years 7 months ago
A Deep Embedding of Queries into Ruby
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
Torsten Grust, Manuel Mayr
DBPL
2007
Springer
103views Database» more  DBPL 2007»
13 years 8 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
ENTCS
2002
143views more  ENTCS 2002»
13 years 4 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...