Applications and extensions of context-sensitive rewriting

[EN] Context-sensitive rewriting is a restriction of term rewriting which is obtained by imposing replacement restrictions on the arguments of function symbols. It has proven useful to analyze computational properties of programs written in sophisticated rewriting-based programming languages such asCafeOBJ, Haskell, Maude, OBJ*, etc. Also, a number of extensions(e.g., to conditional rewritingor constrained equational systems) and generalizations(e.g., controlled rewritingor forbidden patterns) of context-sensitive rewriting have been proposed. In this paper, we provide an overview of these applications and related issues. (C) 2021 Elsevier Inc. All rights reserved.Partially supported by the EU (FEDER), and projects RTI2018-094403-B-C32 and PROMETEO/2019/098.Lucas Alba, S. (2021). Applications and extensions of context-sensitive rewriting. Journal of Logical and Algebraic Methods in Programming. 121:1-33. https://doi.org/10.1016/j.jlamp.2021.10068013312

Analysing Parallel Complexity of Term Rewriting

We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques to derive both upper and lower bounds on parallel complexity of rewriting that enable a direct reuse of existing techniques for sequential complexity. The applicability and the precision of the method are demonstrated by the relatively light effort in extending the program analysis tool AProVE and by experiments on numerous benchmarks from the literature.Comment: Extended authors' accepted manuscript for a paper accepted for publication in the Proceedings of the 32nd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2022). 27 page

On Complexity Bounds and Confluence of Parallel Term Rewriting

We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques to derive both upper and lower bounds on parallel complexity of rewriting that enable a direct reuse of existing techniques for sequential complexity. Our approach to find lower bounds requires confluence of the parallel-innermost rewrite relation, thus we also provide effective sufficient criteria for proving confluence. The applicability and the precision of the method are demonstrated by the relatively light effort in extending the program analysis tool AProVE and by experiments on numerous benchmarks from the literature.Comment: Under submission to Fundamenta Informaticae. arXiv admin note: substantial text overlap with arXiv:2208.0100

Tennessee Blue Book 2011-2012

https://digitalcommons.memphis.edu/govpubs-tn-blue-book/1005/thumbnail.jp

Annual Report of the University, 2001-2002, Volumes 1-4

VITAL ACADEMIC CLIMATE* by Brian Foster, Provost/Vice President of Academic Affairs A great university engages students and faculty fully in important ideas and issues ... not just to learn about them, but to take them apart and put them back together, to debate, deconstruct, resist, reconstruct and build upon them. Engagement of this sort takes concentration and commitment, and it produces the kind of discipline and passion that leads to student and faculty success and satisfaction in their studies, research, performance, artistic activity and service. It is also the kind of activity that creates a solid, nurturing spirit of community. This is what we mean when we talk about a vital academic climate. We are striving for an environment that will enrich the social, cultural and intellectual lives of all who come in contact with the University. Many things interconnect to make this happen: curriculum, co-curricular activities, conferences, symposia, cultural events, community service, research and social activity. Our goal is to create the highest possible level of academic commitment and excitement at UNM. This is what characterizes a truly great university. *Strategic Direction 2 New Mexico native Andres C. Salazar, a Ph.D. in electrical engineering from Michigan State University, has been named the PNM Chair in Microsystems, Commercialization and Technology. Carrying the title of professor, the PNM Chair is a joint appointment between the School of Engineering and the Anderson Schools of Management. Spring 2002 graduate John Probasco was selected a 2002 Rhodes Scholar, the second UNM student to be so honored in the past four years. The biochemistry major from Alamogordo previously had been awarded the Goldwater Scholarship and the Truman Scholarship. Andres c. Salazar Biology student Sophie Peterson of Albuquerque was one of 30 students nationwide to receive a 2002-2003 Award of Excellence from Phi Kappa Phi, the oldest and largest national honor society. Regents\\u27 Professor of Communication and Journalism Everett M. Rogers was selected the University\\u27s 4 71h Annual Research Lecturer, the highest honor UNM bestows upon members of its faculty. John Probasco honored by Student Activities Director Debbie Morris. New Mexico resident, author and poet Simon}. Ortiz received an Honorary Doctorate of Letters at Spring Commencement ceremonies. Child advocate Angela Angie Vachio, founder and executive director of Peanut Butter and Jelly Family Services, Inc., was awarded an Honorary Doctorate of Humane Letters. American Studies Assistant Professor Amanda}. Cobb won the 22 d annual American Book Award for listening to Our Grandmothers\\u27 Stories: The Bloomfield Academy for Chickasaw Females, 1852-1949