We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented in terms of types ascribed to expressions and statements, certifiable by type derivations, and the transformation component carries out the optimizations that the type derivations license. We describe dead code elimin...

We apply an extension of the Nelson-Oppen combination method to develop a decision procedure for the non-disjoint union of theories modeling data structures with a counting operator and fragments of arithmetic. We present some data structures and some fragments of arithmetic for which the combination method is complete and effective. To achieve effectiveness, the combination method relies on pa...

abstract Modoc was proposed by Van Gelder as an improvement to model elimination. The main contribution of Modoc is in its new pruning technique based on the concept of autarky, rst introduced by Monien and Speckenmeyer. Compared to programs based on model search, Modoc has since been observed to excel in speed on circuit formulas yet to fall behind on random formulas. This paper reports on a s...

We show that the Sudakov factor from the resummation of double logarithms ln(s/k T ) contained in the distribution functions is responsible for the kT smearing mechanism employed in the next-to-leading-order QCD (αα 2 s) calculations of direct photon production. s is the center-of-mass energy, and kT the transverse momentum carried by a parton in a colliding hadron. This factor exhibits the app...

When the Model Elimination (ME) procedure was rst proposed, a notion of lemma was put forth as a promising augmentation to the basic complete proof procedure. Here the lemmas that are used are also discovered by the procedure in the same proof run. Several implementations of ME now exist but only a 1970's implementation explicitly examined this lemma mechanism, with indiierent results. We repor...

As a potential explanation to measured inconsistencies between stated privacy concerns and actual disclosing behavior, denoted as the „privacy paradox“, scholars have proposed a systematic distinction between situational privacy considerations and pre-existing, superordinate factors that shape the decisive situation without being directly connected to the situation itself. Deploying an experime...

În această lucrare se prezintă o metodă eficientă de implementare a eliminării Gaussiene pentru o matrice de dimensiuni n·m (m≥n), folosind o arhitectură SIMD ce constă dintr-o matrice de n·m procesoare. Algoritmul descris constă în 2·n-1=O(n) iteraţii, oferind astfel o creştere de viteză optimă faţă de versiunea serială. O particularitate a algoritmului este că nu necesită realizarea operaţiei...

2 Discrete vector fields. 4 2.1 W-contractions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Algebraic discrete vector fields. . . . . . . . . . . . . . . . . . . . . 6 2.3 V-paths and admissible vector fields. . . . . . . . . . . . . . . . . . 7 2.4 Reductions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.4.1 Definition. . . . . . . . . . . . . . . . . ...