Sciweavers

2995 search results - page 42 / 599
» On multi-avoidance of generalized patterns
Sort
View
AIPS
2008
13 years 10 months ago
Structural Patterns Heuristics via Fork Decomposition
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
Michael Katz, Carmel Domshlak
COMBINATORICS
2002
73views more  COMBINATORICS 2002»
13 years 7 months ago
Prefix Exchanging and Pattern Avoidance by Involutions
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
Aaron D. Jaggard
TLDI
2009
ACM
140views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Design patterns in separation logic
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...
Neelakantan R. Krishnaswami, Jonathan Aldrich, Lar...
NCA
2005
IEEE
14 years 1 months ago
Reducing the Communication Cost via Chain Pattern Scheduling
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop...
Florina M. Ciorba, Theodore Andronikos, Ioannis Dr...
PLDI
1998
ACM
13 years 12 months ago
Simplification of Array Access Patterns for Compiler Optimizations
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
Yunheung Paek, Jay Hoeflinger, David A. Padua