Search results for "innermost"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
123	Beatriz Alarcón, Salvador Lucas	Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs.	FroCoS	2007	DBLP DOI BibTeX RDF
97	Dorit Nuzman, Ayal Zaks	Outer-loop vectorization: revisited for short SIMD architectures.	PACT	2008	DBLP DOI BibTeX RDF	SIMD, vectorization, data reuse, subword parallelism
95	Jaco van de Pol, Hans Zantema	Generalized Innermost Rewriting.	RTA	2005	DBLP DOI BibTeX RDF
95	Jürgen Giesl, Aart Middeldorp	Innermost Termination of Context-Sensitive Rewriting.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
82	René Thiemann, Jürgen Giesl, Peter Schneider-Kamp	Deciding Innermost Loops.	RTA	2008	DBLP DOI BibTeX RDF
82	Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio	Orderings for Innermost Termination.	RTA	2005	DBLP DOI BibTeX RDF
80	Guillem Godoy, Eduard Huntingford	Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.	RTA	2007	DBLP DOI BibTeX RDF
69	René Thiemann, Jürgen Giesl, Peter Schneider-Kamp	Improved Modular Termination Proofs Using Dependency Pairs.	IJCAR	2004	DBLP DOI BibTeX RDF
68	Thomas Arts, Jürgen Giesl	Proving Innermost Normalisation Automatically.	RTA	1997	DBLP DOI BibTeX RDF
54	René Thiemann	From Outermost Termination to Innermost Termination.	SOFSEM	2009	DBLP DOI BibTeX RDF
54	Yoshiharu Kojima, Masahiko Sakai	Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems.	RTA	2008	DBLP DOI BibTeX RDF
54	Bernhard Gramlich	On Proving Termination by Innermost Termination.	RTA	1996	DBLP DOI BibTeX RDF
54	Bernhard Gramlich	Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems.	LPAR	1992	DBLP DOI BibTeX RDF
43	Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner	System Presentation -- CARIBOO: An induction based proof tool for termination with strategies.	PPDP	2002	DBLP DOI BibTeX RDF	ELAN, innermost, local strategy, rule based language induction, constraint, termination, rewriting, ordering, narrowing
41	Kieron Turkington, Turkington A. Constantinides, Kostas Masselos, Peter Y. K. Cheung	Outer Loop Pipelining for Application Specific Datapaths in FPGAs.	IEEE Trans. Very Large Scale Integr. Syst.	2008	DBLP DOI BibTeX RDF
41	Ho-Ryong Jung, Moon-Ryul Jung	An Implicit Active Contour Model for Feature Regions and Lines.	MMM	2008	DBLP DOI BibTeX RDF	local band, thin regions, level-set, features, active contours
41	Guillem Godoy, Eduard Huntingford, Ashish Tiwari 0001	Termination of Rewriting with Right-Flat Rules.	RTA	2007	DBLP DOI BibTeX RDF
41	Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke 0001	Mechanizing and Improving Dependency Pairs.	J. Autom. Reason.	2006	DBLP DOI BibTeX RDF	termination, term rewriting, dependency pairs
41	Hongbo Rong, Zhizhong Tang, Ramaswamy Govindarajan, Alban Douillet, Guang R. Gao	Single-Dimension Software Pipelining for Multi-Dimensional Loops.	CGO	2004	DBLP DOI BibTeX RDF
41	Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke 0001	Improving Dependency Pairs.	LPAR	2003	DBLP DOI BibTeX RDF
41	Thomas Arts, Jürgen Giesl	Modularity of Termination Using Dependency pairs.	RTA	1998	DBLP DOI BibTeX RDF
41	Jian Wang, Guang R. Gao	Pipelining-Dovetailing: A Transformation to Enhance Software Pipelining for Nested Loops.	CC	1996	DBLP DOI BibTeX RDF	Very Long Instruction Word(VLIW), Instruction-Level Parallelism, Software Pipelining, Superscalar, Nested Loop, Loop Scheduling, Fine-Grain Parallelism
40	Laurent Fribourg	Handling Function Definitions through Innermost Superposition and Rewriting.	RTA	1985	DBLP DOI BibTeX RDF
29	Isabelle Gnaedig, Hélène Kirchner	Termination of rewriting under strategies.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	innermost, local strategy, outermost, Abstraction, termination, induction, narrowing, ordering constraint
29	Wan J. Fokkink, Jasper Kamperman, Pum Walters	Lazy rewriting on eager machinery.	ACM Trans. Program. Lang. Syst.	2000	DBLP DOI BibTeX RDF	innermost reduction, lazy rewriting, specificity ordering
29	Zhixi Fang, Peiyi Tang, Pen-Chung Yew, Chuan-Qi Zhu	Dynamic Processor Self-Scheduling for General Parallel Nested Loops.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	dynamic processor self scheduling, general parallel nested loops, fetch-and-op operations, innermost parallel loop nests, dynamic parallel linked lists, guided self-scheduling, shortest-delay self-scheduling, scheduling, data structures, multiprocessing systems, multiprocessor systems, granularity, dynamic data structures
28	Hongbo Rong, Zhizhong Tang, Ramaswamy Govindarajan, Alban Douillet, Guang R. Gao	Single-dimension software pipelining for multidimensional loops.	ACM Trans. Archit. Code Optim.	2007	DBLP DOI BibTeX RDF	Software pipelining, loop transformation, modulo scheduling
28	Alban Douillet, Hongbo Rong, Guang R. Gao	Multi-dimensional Kernel Generation for Loop Nest Software Pipelining.	Euro-Par	2006	DBLP DOI BibTeX RDF
28	Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner	A Proof of Weak Termination Providing the Right Way to Terminate.	ICTAC	2004	DBLP DOI BibTeX RDF
28	Hongbo Rong, Alban Douillet, Ramaswamy Govindarajan, Guang R. Gao	Code Generation for Single-Dimension Software Pipelining of Multi-Dimensional Loops.	CGO	2004	DBLP DOI BibTeX RDF
28	Yong Dou, Xicheng Lu	LEAP: A Data Driven Loop Engine on Array Processor.	APPT	2003	DBLP DOI BibTeX RDF
28	Chi Ta Wu, TingTing Hwang	Instruction buffering for nested loops in low power design.	ISCAS (4)	2002	DBLP DOI BibTeX RDF
28	Pierre Réty, Julie Vuotto	Regular Sets of Descendants by Some Rewrite Strategies.	RTA	2002	DBLP DOI BibTeX RDF
28	Salvador Lucas	Termination of Rewriting With Strategy Annotations.	LPAR	2001	DBLP DOI BibTeX RDF	Rewriting strategies, termination
28	Annegret Habel, Detlef Plump	Complete Strategies for Term Graph Narrowing.	WADT	1998	DBLP DOI BibTeX RDF
28	María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal	Safe Folding/Unfolding with Conditional Narrowing.	ALP/HOA	1997	DBLP DOI BibTeX RDF
28	Steve Carr 0001, Chen Ding, Philip H. Sweany	Improving Software Pipelining with Unroll-and-Jam.	HICSS (1)	1996	DBLP DOI BibTeX RDF
28	Bernhard Gramlich	On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems.	ALP	1994	DBLP DOI BibTeX RDF
28	Chris Fickert, Thomas A. Sudkamp	Unification based FP interpreters.	ACM SIGPLAN Notices	1992	DBLP DOI BibTeX RDF	FP
28	P. H. Cheong, Laurent Fribourg	Efficient Integration of Simplifications into Prolog.	PLILP	1991	DBLP DOI BibTeX RDF
26	Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl	From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting.	FoSSaCS (2)	2024	DBLP DOI BibTeX RDF
26	Danny Hynds, George Chernyshov, Dingding Zheng, Aoi Uyama, Juling Li, Kozue Matsumoto, Michael Pogorzhelskiy, Kai Kunze, Jamie A. Ward, Kouta Minamizawa	Innermost Echoes: Integrating Real-Time Physiology into Live Music Performances.	TEI	2024	DBLP DOI BibTeX RDF
26	Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl	From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting.	CoRR	2023	DBLP DOI BibTeX RDF
26	Jan-Christoph Kassing, Jürgen Giesl	Improving Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting.	CoRR	2023	DBLP DOI BibTeX RDF
26	Jan-Christoph Kassing, Jürgen Giesl	Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version).	CoRR	2023	DBLP DOI BibTeX RDF
26	Jan-Christoph Kassing, Jürgen Giesl	Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs.	CoRR	2023	DBLP DOI BibTeX RDF
26	Johri van Eerd, Jan Friso Groote, Pieter Hijma, Jan Martens 0001, Muhammad Osama 0003, Anton Wijs	Innermost many-sorted term rewriting on GPUs.	Sci. Comput. Program.	2023	DBLP DOI BibTeX RDF
26	Jan-Christoph Kassing, Jürgen Giesl	Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs.	CADE	2023	DBLP DOI BibTeX RDF
26	Liye Guo, Deivid Vale	Analyzing Innermost Runtime Complexity Through Tuple Interpretations.	LSFA	2022	DBLP DOI BibTeX RDF
26	Ariane Alves Almeida, Mauricio Ayala-Rincón	Formalizing the dependency pair criterion for innermost termination.	Sci. Comput. Program.	2020	DBLP DOI BibTeX RDF
26	Sayaka Ishizuki, Michio Oyamaguchi, Masahiko Sakai	Conditions for confluence of innermost terminating term rewriting systems.	Appl. Algebra Eng. Commun. Comput.	2019	DBLP DOI BibTeX RDF
26	Ariane Alves Almeida, Mauricio Ayala-Rincón	Formalizing the Dependency Pair Criterion for Innermost Termination.	CoRR	2019	DBLP BibTeX RDF
26	Thomas Genet, Yann Salmon 0001	Reachability Analysis of Innermost Rewriting.	Log. Methods Comput. Sci.	2017	DBLP DOI BibTeX RDF
26	Florian Frohn, Jürgen Giesl	Analyzing Runtime Complexity via Innermost Runtime Complexity.	LPAR	2017	DBLP DOI BibTeX RDF
26	Thomas Genet, Yann Salmon 0001	Reachability Analysis of Innermost Rewriting.	RTA	2015	DBLP DOI BibTeX RDF
26	Yann Salmon 0001	Analyse d'atteignabilité pour les programmes fonctionnels avec stratégie d'évaluation en profondeur. (Reachability analysis for functional programs with innermost evaluation strategy).		2015	RDF
26	Lars Noschinski, Fabian Emmes, Jürgen Giesl	Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs.	J. Autom. Reason.	2013	DBLP DOI BibTeX RDF
26	Jean-Paul Delahaye, Hector Zenil	Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness.	Appl. Math. Comput.	2012	DBLP DOI BibTeX RDF
26	Stephan Schleim	Mind Reading - Neuroimaging as a gaze into the innermost of the psyche.	Datenschutz und Datensicherheit	2012	DBLP DOI BibTeX RDF
26	Jean-Paul Delahaye, Hector Zenil	Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness	CoRR	2011	DBLP BibTeX RDF
26	Lars Noschinski, Fabian Emmes, Jürgen Giesl	A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems.	CADE	2011	DBLP DOI BibTeX RDF
26	Guillem Godoy	Normalization properties for Shallow TRS and Innermost Rewriting.	Appl. Algebra Eng. Commun. Comput.	2010	DBLP DOI BibTeX RDF
26	Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe	Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs.	IEICE Trans. Inf. Syst.	2010	DBLP DOI BibTeX RDF
26	Harald Zankl, Nao Hirokawa, Aart Middeldorp	Uncurrying for Innermost Termination and Derivational Complexity	HOR	2010	DBLP DOI BibTeX RDF
26	Ming-Yuan Zhong, Jong-Jiann Shieh	Power Improvement Using Block-Based Loop Buffer with Innermost Loop Control.	ICA3PP (2)	2010	DBLP DOI BibTeX RDF
26	Sid Ahmed Ali Touati, Zsolt Mathe	Periodic register saturation in innermost loops.	Parallel Comput.	2009	DBLP DOI BibTeX RDF
26	Adrià Gascón, Guillem Godoy, Florent Jacquemard	Closure of Tree Automata Languages under Innermost Rewriting.	WRS@RTA	2008	DBLP DOI BibTeX RDF
26	Beatriz Alarcón, Salvador Lucas	Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting.	PROLE	2008	DBLP DOI BibTeX RDF
26	René Thiemann, Aart Middeldorp	Innermost Termination of Rewrite Systems by Labeling.	WRS@RDP	2007	DBLP DOI BibTeX RDF
26	Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe	Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems.	WRS@RDP	2007	DBLP DOI BibTeX RDF
26	Bin-Hua Tein, I-Wei Wu, Chung-Ping Chung	Instruction Fetch Energy Reduction Using Forward-Branch Bufferable Innermost Loop Buffer.	CDES	2006	DBLP BibTeX RDF
26	Mirtha-Lina Fernández	Relaxing monotonicity for innermost termination.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
26	M. R. K. Krishna Rao	Some characteristics of strong innermost normalization.	Theor. Comput. Sci.	2000	DBLP DOI BibTeX RDF
26	M. R. K. Krishna Rao	Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting Systems.	Acta Informatica	1996	DBLP DOI BibTeX RDF
26	M. R. K. Krishna Rao	Some Characteristics of Strong Innermost Normalization.	AMAST	1996	DBLP DOI BibTeX RDF
26	Sergio Antoy	Normalization by Leftmost Innermost Rewriting.	CTRS	1992	DBLP DOI BibTeX RDF
26	Mark E. Stickel	A note on leftmost innermost term reduction.	SIGSAM Bull.	1983	DBLP DOI BibTeX RDF
14	Agus Budiyono, T. Sudiyanto	Control of Small Scale Helicopter Using s-CDM and LQ Design.	Intelligent Unmanned Systems	2009	DBLP DOI BibTeX RDF
14	Hyunchul Park 0001, Yongjun Park 0001, Scott A. Mahlke	Polymorphic pipeline array: a flexible multicore accelerator with virtualized execution for mobile multimedia applications.	MICRO	2009	DBLP DOI BibTeX RDF	programmable accelerator, virtualization, software pipelining
14	Reinhard Schauer, Rudolf K. Keller	A case for concept programs.	ICPC	2009	DBLP DOI BibTeX RDF
14	Albert Hartono, Muthu Manikandan Baskaran, Cédric Bastoul, Albert Cohen 0001, Sriram Krishnamoorthy, Boyana Norris, J. Ramanujam, P. Sadayappan	Parametric multi-level tiling of imperfectly nested loops.	ICS	2009	DBLP DOI BibTeX RDF	imperfectly nested loops, parametric tiling
14	Tao Liu, Haibo Lin, Tong Chen 0001, Kevin O'Brien, Ling Shao 0002	DBDB: optimizing DMATransfer for the cell be architecture.	ICS	2009	DBLP DOI BibTeX RDF	loop blocking, local memory, multi-core system
14	Yongjun Park 0001, Hyunchul Park 0001, Scott A. Mahlke	CGRA express: accelerating execution using dynamic operation fusion.	CASES	2009	DBLP DOI BibTeX RDF	latency-constrained, subgraph accelerator, modulo scheduling, coarse-grained reconfigurable architecture
14	Martin Avanzini, Georg Moser	Dependency Pairs and Polynomial Path Orders.	RTA	2009	DBLP DOI BibTeX RDF
14	Rebecca Wirfs-Brock	Connecting Design with Code.	IEEE Softw.	2008	DBLP DOI BibTeX RDF
14	Marc González 0001, Nikola Vujic, Xavier Martorell, Eduard Ayguadé, Alexandre E. Eichenberger, Tong Chen 0001, Zehra Sura, Tao Zhang, Kevin O'Brien, Kathryn M. O'Brien	Hybrid access-specific software cache techniques for the cell BE architecture.	PACT	2008	DBLP DOI BibTeX RDF	memory classification, OpenMP, compiler optimizations, local memories, software cache
14	Xianzhang Feng, Yuanpeng Liu, Haodong Luo, Huarui Tang, Cai Liu	Numerical Simulation during Expansion for Hot Rolling Sheet Strip.	WKDD	2008	DBLP DOI BibTeX RDF
14	Martin Avanzini, Georg Moser	Complexity Analysis by Rewriting.	FLOPS	2008	DBLP DOI BibTeX RDF
14	Nikola Vujic, Marc González 0001, Xavier Martorell, Eduard Ayguadé	Automatic Pre-Fetch and Modulo Scheduling Transformations for the Cell BE Architecture.	LCPC	2008	DBLP DOI BibTeX RDF	Cell BE Architecture, Modulo Scheduling, Pre-fetching, Software Cache
14	Raúl Gutiérrez, Salvador Lucas, Xavier Urbain	Usable Rules for Context-Sensitive Rewrite Systems.	RTA	2008	DBLP DOI BibTeX RDF	termination, term rewriting, Dependency pairs
14	Jeffrey R. Diamond, Behnam Robatmili, Stephen W. Keckler, Robert A. van de Geijn, Kazushige Goto, Doug Burger	High performance dense linear algebra on a spatially distributed processor.	PPoPP	2008	DBLP DOI BibTeX RDF	gotoblas, grid processors, hybrid dataflow, matrix multiply, tile based architecture, instruction level parallelism, on-chip networks, dense linear algebra
14	Danièle Bourcier, Pierre Mazzega	Toward measures of complexity in legal systems.	ICAIL	2007	DBLP DOI BibTeX RDF	legal outputs, legal system, complexity, network, measure, analysis
14	Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp	Proving Termination by Bounded Increase.	CADE	2007	DBLP DOI BibTeX RDF
14	Isabelle Gnaedig	Induction for positive almost sure termination.	PPDP	2007	DBLP DOI BibTeX RDF	constraint, probability, abstraction, termination, narrowing
14	Makoto Tatsuta	The Maximum Length of Mu-Reduction in Lambda Mu-Calculus.	RTA	2007	DBLP DOI BibTeX RDF
14	Arun Kejariwal, Xinmin Tian, Milind Girkar, Wei Li 0015, Sergey Kozhukhov, Utpal Banerjee, Alexandru Nicolau, Alexander V. Veidenbaum, Constantine D. Polychronopoulos	Tight analysis of the performance potential of thread speculation using spec CPU 2006.	PPoPP	2007	DBLP DOI BibTeX RDF	conflict probability, misspeculation penalty, threading overhead, performance evaluation, speculative execution
14	Michael J. McGandy	Multimedia Enlightenment: Transcendent Experiences with the Help of Technology.	IEEE Multim.	2006	DBLP DOI BibTeX RDF	transcendent art, video artist, Bill Viola, cutting-edge technology, video displays, video art
14	Taishin Yasunobu Nishida	Membrane Algorithms: Approximate Algorithms for NP-Complete Optimization Problems.	Applications of Membrane Computing	2006	DBLP DOI BibTeX RDF
14	Jorge J. G. Leandro, Roberto M. Cesar, Luciano da Fontoura Costa	Determining the branchings of 3D structures from respective 2D projections.	SIBGRAPI	2006	DBLP DOI BibTeX RDF
14	Yuan Zhao, Ken Kennedy	Dependence-Based Code Generation for a CELL Processor.	LCPC	2006	DBLP DOI BibTeX RDF