Sciweavers

2436 search results - page 97 / 488
» Comonadic Notions of Computation
Sort
View
POPL
1995
ACM
15 years 7 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip
AMW
2009
15 years 5 months ago
Temporal Support in Sequential Pattern Mining
In sequential pattern discovery, the support of a sequence is computed as the number of data-sequences satisfying a pattern with respect to the total number of data-sequences in th...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
GG
2010
Springer
15 years 5 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...
APAL
2008
69views more  APAL 2008»
15 years 4 months ago
Lowness properties and approximations of the jump
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
Santiago Figueira, André Nies, Frank Stepha...
ENTCS
2007
103views more  ENTCS 2007»
15 years 3 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal