In this paper we discuss extensions to the conventional relatronal algebra to support transaction time We show that these extensions are applicable to hrstorlcal algebras that sup...
We propose the notion of logical reliability for real-time program tasks that interact through periodically updated program variables. We describe a reliability analysis that chec...
Krishnendu Chatterjee, Arkadeb Ghosal, Thomas A. H...
Abstract. While real-time garbage collection is now available in production virtual machines, the lack of generational capability means applications with high allocation rates are ...
Daniel Frampton, David F. Bacon, Perry Cheng, Davi...
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...