595 search results - page 88 / 119 » The Graph Programming Language GP |
STACS
1991
Springer
14 years 11 days ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
PLDI
2010
ACM
14 years 6 months ago
2010
ACM
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
PVLDB
2008
13 years 8 months ago
2008
We propose EndoScope, a software monitoring framework that allows users to pose declarative queries that monitor the state and performance of running programs. Unlike most existin...
ICLP
1989
Springer
1989
Springer
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
14 years 10 days ago
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
DAC
2003
ACM
14 years 9 months ago
2003
ACM
Schedulability analysis of real-time embedded systems requires worst case timing guarantees of embedded software performance. This involves not only language level program analysi...