]> 2002-03-13 A Fully Syntactic AC-RPO. 133-147 http://link.springer.de/link/service/series/0558/bibs/1631/16310133.htm 1999 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta99.html#Rubio99 2002-03-13 A Precedence-Based Total AC-Compatible Ordering. 374-388 1993 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta93.html#RubioN93 2002-01-03 Rewriting for Deduction and Verification. 2 2001 RTA http://link.springer.de/link/service/series/0558/bibs/2051/20510002.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2001.html#Rusinowitch01 2002-03-13 Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. 225-240 1985 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta85.html#Rusinowitch85 2002-03-13 Semantics and Strong Sequentiality of Priority Term Rewriting Systems. 377-391 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#SakaiT96 2002-03-13 Decidability of Confluence and Termination of Monadic Term Rewriting Systems. 275-286 1991 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta91.html#Salomaa91 2006-08-22 <i>lambda</i>-Calculus. 151-165 2006 RTA http://dx.doi.org/10.1007/11805618_12 http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2006.html#Salvati06 2003-06-25 On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. 234-245 2003 RTA http://link.springer.de/link/service/series/0558/bibs/2706/27060234.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2003.html#SalvatiG03 2006-08-22 Structural Proof Theory as Rewriting. 197-211 2006 RTA http://dx.doi.org/10.1007/11805618_15 http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2006.html#SantoFP06 2002-03-13 Divergence Phenomena during Completion. 374-385 1991 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta91.html#Sattler-Klein91 2002-03-13 New Undecidablility Results for Finitely Presented Monoids. 68-82 1997 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta97.html#Sattler-Klein97 2002-03-13 On Implementation of Tree Synchronized Languages. 382-396 http://link.springer.de/link/service/series/0558/bibs/1631/16310382.htm 1999 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta99.html#SaubionS99 2002-03-13 Towards an Efficient Construction of Test Sets for Deciding Ground Reducability. 86-100 1995 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta95.html#SchmidF95 2002-03-13 An Algorithm for Distributive Unification. 287-301 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#Schmidt-Schauss96 2002-03-13 On the Exponent of Periodicity of Minimal Solutions of Context Equation. 61-75 http://link.springer.de/link/service/series/0558/bibs/1379/13790061.htm 1998 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta98.html#Schmidt-SchaussS98 2002-03-13 <i>E</i><i>S4</i>. 106-120 http://link.springer.de/link/service/series/0558/bibs/1379/13790106.htm 1998 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta98.html#Schmidt98 2002-03-13 A Criterion for Intractability of E-unification with Free Function Symbols and Its Relevance for Combination Algorithms. 284-298 1997 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta97.html#Schulz97 2002-03-13 Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution. 404-418 1989 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta89.html#SekarPR89 2002-07-26 Layered Transducing Term Rewriting System and Its Recognizability Preserving Property. 98-113 2002 RTA http://link.springer.de/link/service/series/0558/bibs/2378/23780098.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2002.html#SekiTFK02 2002-03-13 Some Undecidable Termination Problems for Semi-Thue Systems (Abstract). 434 1993 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta93.html#Senizergues93 2002-03-13 A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. 194-209 1995 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta95.html#Senizergues95 2002-03-13 On the Termination Problem for One-Rule Semi-Thue System. 302-316 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#Senizergues96 2006-08-22 Computationally Equivalent Elimination of Conditions. 19-34 2006 RTA http://dx.doi.org/10.1007/11805618_3 http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2006.html#SerbanutaR06 2002-07-26 An Extensional Böhm Model. 159-173 2002 RTA http://link.springer.de/link/service/series/0558/bibs/2378/23780159.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2002.html#SeveriV02 2002-07-26 Combining Shostak Theories. 1-18 2002 RTA http://link.springer.de/link/service/series/0558/bibs/2378/23780001.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2002.html#ShankarR02 2004-09-01 On the Modularity of Confluence in Infinitary Term Rewriting. 185-199 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3091&spage=185 2004 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2004.html#Simonsen04 2005-04-05 Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. 219-234 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=219 2005 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2005.html#Simpson05 2003-06-25 Efficient Reductions with Director Strings. 46-60 2003 RTA http://link.springer.de/link/service/series/0558/bibs/2706/27060046.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2003.html#SinotFM03 2002-03-13 <i>O(n log n)</i>Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E. 419-433 1989 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta89.html#Snyder89 2002-03-13 Goal Directed Strategies for Paramodulation. 150-161 1991 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta91.html#SnyderL91 2002-03-13 Boolean Algebra Admits No Convergent Term Rewriting System. 264-274 1991 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta91.html#Socher-Ambrosius91 2002-03-13 Combinatorial Hypermap Rewriting. 62-73 1987 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta87.html#Sopena87 2002-03-13 Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems. 74-82 1987 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta87.html#SquierO87 2002-01-03 On the Word Problem for Combinators. 203-213 2000 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2000.html#Statman00 2002-03-13 Effective Reduction and Conversion Strategies for Combinators. 299-307 1997 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta97.html#Statman97 2002-03-13 Extensions and Comparison of Simplification Orderings. 434-448 1989 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta89.html#Steinbach89 2002-03-13 Automatic Termination Proofs With Transformation Orderings. 11-25 1995 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta95.html#Steinbach95 2002-03-13 Term Rewriting in Contemporary Resolution Theorem Proving (Abstract). 101 1995 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta95.html#Stickel95 2002-03-13 Studying Quasigroup Identities by Rewriting Techniques: Problems and First Results. 450-456 1995 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta95.html#StickelZ95 2002-03-13 Optimizing Equational Programs. 13-24 1987 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta87.html#Strandh87 2002-03-13 Classes of Equational Programs that Compile into Efficient Machine Code. 449-461 1989 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta89.html#Strandh89 2002-01-03 An Algebra of Resolution. 214-228 2000 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2000.html#Struth00 2002-01-03 Deriving Focused Calculi for Transitive Relations. 291-305 2001 RTA http://link.springer.de/link/service/series/0558/bibs/2051/20510291.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2001.html#Struth01 2002-07-26 Deriving Focused Lattice Calculi. 83-97 2002 RTA http://link.springer.de/link/service/series/0558/bibs/2378/23780083.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2002.html#Struth02 2002-03-13 On the Word Problem for Free Lattices. 128-141 1997 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta97.html#Struth97 2002-01-03 Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems. 229-245 2000 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2000.html#Stuber00 2002-03-13 Superposition Theorem Proving for Albelian Groups Represented as Integer Modules. 33-47 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#Stuber96 2002-03-13 Theory Path Orderings. 148-162 http://link.springer.de/link/service/series/0558/bibs/1631/16310148.htm 1999 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta99.html#Stuber99 2005-04-05 The Algebra of Equality Proofs. 469-483 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=469 2005 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2005.html#StumpT05 2002-03-13 Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. 179-193 1995 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta95.html#SuzukiMI95 2002-07-26 Recursive Derivational Length Bounds for Confluent Term Rewrite Systems. 281-295 2002 RTA http://link.springer.de/link/service/series/0558/bibs/2378/23780281.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2002.html#Tahhan-Bittar02 2002-03-13 The Negation Elimination from Syntactic Equational Formula is Decidable. 316-327 1993 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta93.html#Tajine93 2004-09-01 A Verification Technique Using Term Rewriting Systems and Abstract Interpretation. 119-133 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3091&spage=119 2004 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2004.html#Takai04 2002-01-03 Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. 246-260 2000 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2000.html#TakaiKS00 2003-06-25 Size-Change Termination for Term Rewriting. 264-278 2003 RTA http://link.springer.de/link/service/series/0558/bibs/2706/27060264.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2003.html#ThiemannG03 2002-01-03 Tree Automata and Term Rewrite Systems. 27-30 2000 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2000.html#Tison00 2002-03-13 Fair Termination is Decidable for Ground Systems. 462-476 1989 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta89.html#Tison89 2002-03-13 Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space. 269-283 1997 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta97.html#TomasF97 2005-04-05 Unification in a Class of Permutative Theories. 105-119 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=105 2005 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2005.html#TourE05 2002-03-13 A Characterisation of Multiply Recursive Functions with Higman's Lemma. 163-174 http://link.springer.de/link/service/series/0558/bibs/1631/16310163.htm 1999 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta99.html#Touzet99 2004-09-01 Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms. 40-54 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3091&spage=40 2004 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2004.html#Toyama04 2005-04-05 Confluent Term Rewriting Systems. 1 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=1 2005 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2005.html#Toyama05 2002-03-13 Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. 477-491 1989 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta89.html#ToyamaKB89 2002-03-13 The First-Order Theory of One-Step Rewriting is Undecidable. 276-286 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#Treinen96 2006-08-22 The CL-Atse Protocol Analyser. 277-286 2006 RTA http://dx.doi.org/10.1007/11805618_21 http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2006.html#Turuani06 2003-06-25 "Term Partition" for Mathematical Induction. 352-366 2003 RTA http://link.springer.de/link/service/series/0558/bibs/2706/27060352.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2003.html#UrsoK03 2002-03-13 Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover. 420-423 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#VandevoordeK96 2003-06-25 Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. 180-196 2003 RTA http://link.springer.de/link/service/series/0558/bibs/2706/27060180.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2003.html#Verma03 2002-03-13 Smaran: A Congruence-Closure Based System for Equational Computations. 457-461 1993 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta93.html#Verma93 2002-03-13 Algorithms and Reductions for Rewriting Problems. 166-180 http://link.springer.de/link/service/series/0558/bibs/1379/13790166.htm 1998 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta98.html#VermaRL98 2002-03-13 ^arrow²: A Laboratory fro Rapid Term Graph Rewriting. 252-255 http://link.springer.de/link/service/series/0558/bibs/1631/16310252.htm 1999 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta99.html#VermaS99 2002-01-03 A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names. 306-321 2001 RTA http://link.springer.de/link/service/series/0558/bibs/2051/20510306.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2001.html#VestergaardB01 2002-03-13 Higher-Order Superposition for Dependent Types. 123-137 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#Virga96 2002-01-03 Stratego: A Language for Program Transformation Based on Rewriting Strategies. 357-362 2001 RTA http://link.springer.de/link/service/series/0558/bibs/2051/20510357.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2001.html#Visser01 2002-03-13 Strategic Pattern Matching. 30-44 http://link.springer.de/link/service/series/0558/bibs/1631/16310030.htm 1999 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta99.html#Visser99 2002-03-13 A Compiler for Nondeterministic Term Rewriting Systems. 154-167 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#Vittek96 2002-07-26 Conditions for Efficiency Improvement by Tree Transducer Composition. 222-236 2002 RTA http://link.springer.de/link/service/series/0558/bibs/2378/23780222.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2002.html#Voigtlander02 2002-03-13 A New Proof Manager and Graphic Interface for Larch Prover. 408-411 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#Voisin96 2002-03-13 Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction. 492-512 1989 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta89.html#Vorobyov89 2002-03-13 The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. 254-268 1997 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta97.html#Vorobyov97 2005-04-05 Call-by-Value Is Dual to Call-by-Name - Reloaded. 185-203 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=185 2005 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2005.html#Wadler05 2002-07-26 Rewrite Games. 144-158 2002 RTA http://link.springer.de/link/service/series/0558/bibs/2378/23780144.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2002.html#Waldmann02 2004-09-01 Matchbox: A Tool for Match-Bounded String Rewriting. 85-94 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3091&spage=85 2004 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2004.html#Waldmann04 2002-03-13 Normalization of S-Terms is Decidable. 138-150 http://link.springer.de/link/service/series/0558/bibs/1379/13790138.htm 1998 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta98.html#Waldmann98 2002-03-13 EPIC: An Equational Language -Abstract Machine Supporting Tools-. 424-427 1996 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta96.html#WaltersK96 2002-03-13 Rewrite Systems for Integer Arithmetic. 324-338 1995 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta95.html#WaltersZ95 2006-08-22 Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems. 343-356 2006 RTA http://dx.doi.org/10.1007/11805618_26 http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2006.html#WangS06 2006-08-22 Slothrop: Knuth-Bendix Completion with a Modern Termination Checker. 287-296 2006 RTA http://dx.doi.org/10.1007/11805618_22 http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2006.html#WehrmanSW06 2004-01-19 Diagrams for Meaning Preservation. 88-106 2003 RTA http://link.springer.de/link/service/series/0558/bibs/2706/27060088.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2003.html#WellsPK03 2002-03-13 A Semantic Approach to Order-Sorted Rewriting. 47-61 1993 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta93.html#Werner93 2002-01-03 A Normal Form for Church-Rosser Language Systems. 322-337 2001 RTA http://link.springer.de/link/service/series/0558/bibs/2051/20510322.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2001.html#Woinowski01 2002-03-13 Rewriting, and Equational Unification: the Higher-Order Cases. 25-36 1991 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta91.html#Wolfram91 2002-01-03 Confluence and Termination of Simply Typed Term Rewriting Systems. 338-352 2001 RTA http://link.springer.de/link/service/series/0558/bibs/2051/20510338.htm http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2001.html#Yamada01 2002-03-13 Combining Unification Algorithms for Confined Regular Equational Theories. 365-380 1985 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta85.html#Yelick85 2005-04-05 Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete. 235-249 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=235 2005 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2005.html#Yoshinaka05 2002-03-13 The Set of Unifiers in Typed Lambda-Calculus as Regular Expression. 430-440 1985 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta85.html#Zaionc85 2004-09-01 TORPA: Termination of Rewriting Proved Automatically. 95-104 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3091&spage=95 2004 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta2004.html#Zantema04 2002-03-13 Termination of Context-Sensitive Rewriting. 172-186 1997 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta97.html#Zantema97 2002-03-13 ^p^q^r^s. 41-55 1995 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta95.html#ZantemaG95 2002-03-13 A Case Study of Completion Modulo Distributivity and Abelian Groups. 32-46 1993 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta93.html#Zhang93 2002-03-13 Consider Only General Superpositions in Completion Procedures. 513-527 1989 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta89.html#ZhangK89 2002-03-13 Contextual Rewriting. 46-62 1985 RTA http://www.informatik.uni-trier.de/~ley/db/conf/rta/rta85.html#ZhangR85 2003-05-22 Signalling on ATM testbeds: an example. 52-53 1995 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/6980/69800052abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1995.html#Hidano95 2004-10-28 1st IEEE Real-Time Technology and Applications Symposium, May 15-17, 1995, Chicago, Illinois, USA IEEE Real-Time Technology and Applications Symposium 1995 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1995.html 2004-06-21 Implementing Pfairness on a Symmetric Multiprocessor. 544-553 2004 IEEE Real-Time and Embedded Technology and Applications Symposium http://csdl.computer.org/comp/proceedings/rtas/2004/2148/00/21480544abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2004.html#HolmanA04 2004-10-28 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96), June 10-12, 1996, Boston, MA, USA IEEE Real-Time Technology and Applications Symposium 1996 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1996.html 2002-01-03 KURT-Linux Support for Synchronous Fine-Grain Distributed Computations. 78- 2000 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/0713/07130078abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2000.html#HouseN00 2004-10-28 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97), 9-11 June 1997, Montreal, Canada IEEE Real-Time Technology and Applications Symposium 1997 0-8186-8016-4 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1997.html 2003-05-19 Verifiable Embedded Real-Time Application Framework. 109-110 2001 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/1134/11340109abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2001.html#HsiungSGCC01 2003-05-19 Proceedings of the 7th IEEE Real-Time Technology and Applications Symposium (RTAS 2001), 30 May - 1 June 2001, Taipei, Taiwan IEEE Real-Time and Embedded Technology and Applications Symposium 2001 0-7695-1134-1 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2001.html 2004-06-21 On the Fundamental Capacity and Lifetime Limits of Energy-Constrained Wireless Sensor Networks. 2-9 2004 IEEE Real-Time and Embedded Technology and Applications Symposium http://csdl.computer.org/comp/proceedings/rtas/2004/2148/00/21480002abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2004.html#HuL04 2003-05-19 Proceedings of the 8th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2002), 24-27 September 2002, San Jose, CA, USA IEEE Real-Time and Embedded Technology and Applications Symposium 2002 0-7695-1739-0 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2002.html 2003-05-22 Applying imprecise algorithms to real-time image and video transmissio. 96- 1995 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/6980/69800096abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1995.html#HuangC95 2004-06-21 Proceedings of the 9th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2003), May 27-30, 2003, Toronto, Canada IEEE Real-Time and Embedded Technology and Applications Symposium 2003 0-7695-1956-3 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2003.html 2003-07-03 A Cyclic-Executive-Based QoS Guarantee over USB. 88-95 2003 IEEE Real Time Technology and Applications Symposium http://csdl.computer.org/comp/proceedings/rtas/2003/1956/00/19560088abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2003.html#HuangCK03 2004-06-21 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2004), 25-28 May 2004, Toronto, Canada IEEE Real-Time and Embedded Technology and Applications Symposium 2004 0-7695-2148-7 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2004.html 2006-01-31 The Implementation of a Multi-Server Distributed MPEG Video System. 111-113 2001 IEEE Real Time Technology and Applications Symposium http://dlib.computer.org/conferen/rtas/1134/pdf/11340111.pdf http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2001.html#HuiNWL01 2005-05-02 11th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2005), 7-10 March 2005, San Francisco, CA, USA IEEE Real-Time and Embedded Technology and Applications Symposium 2005 0-7695-2302-1 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2005.html 2004-10-28 Experiences using RT-Linux to Implement a Controller for a High Speed Magnetic Bearing System. 121- 1999 IEEE Real Time Technology and Applications Symposium http://csdl.computer.org/comp/proceedings/rtas/1999/0194/00/01940121abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1999.html#HumphreyHA99 2006-06-09 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2006), 4-7 April 2006, San Jose, California, USA IEEE Real-Time and Embedded Technology and Applications Symposium 2006 0-7695-2516-4 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2006.html 2005-05-02 Integrated CORBA Scheduling and Resource Management for Distributed Real-Time Embedded Systems. 375-384 2005 IEEE Real-Time and Embedded Technology and Applications Symposium http://doi.ieeecomputersociety.org/10.1109/RTAS.2005.30 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2005.html#BryanDWMZNFJLWG05 2004-06-21 Online Control for Self-Management in Computing Systems. 368-375 2004 IEEE Real-Time and Embedded Technology and Applications Symposium http://csdl.computer.org/comp/proceedings/rtas/2004/2148/00/21480368abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2004.html#AbdelwahedKN04 2006-01-12 Time Slot Allocation for Real-Time Messages with Negotiable Distance Constrains. 131-136 1998 IEEE Real Time Technology and Applications Symposium http://dlib.computer.org/conferen/rtas/8569/pdf/85690131.pdf http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1998.html#DongMM98 2002-01-03 An Automated Profiling Subsystem for QoS-Aware Services. 208-217 2000 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/0713/07130208abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2000.html#Abdelzaher00 2006-01-24 Adding instruction cache effect to schedulability analysis of preemptive real-time systems. 204- 1996 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/7448/74480204abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1996.html#Busquets-MataixSOGW96 2003-05-19 The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks. 173- 2002 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/1739/17390173abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2002.html#AbdelzaherAJSN02 2003-05-19 Supporting a Low Delay Best-Effort Class in the Presence of Real-Time Traffic. 45-54 2002 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/1739/17390045abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2002.html#ChakrabortyGT02 2003-05-22 QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control. 228-238 1997 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/8016/80160228abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1997.html#AbdelzaherAS97 2006-06-06 Implementation of a Transient-Fault-Tolerance Scheme on DEOS - A Technology Transfer from an Academic System to an Industrial System. 56- 1999 IEEE Real Time Technology and Applications Symposium http://csdl.computer.org/comp/proceedings/rtas/1999/0194/00/01940056abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1999.html#DongMMGHL99 2003-05-19 Schedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Service. 15-25 2001 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/1134/11340015abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2001.html#AbdelzaherL01 2003-05-22 A low level analysis of the realtime Mach distributed operating system. 46-47 1995 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/6980/69800046abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1995.html#DrummondW95 2002-03-14 End-Host Architecture for QoS-Adaptive Communication. 121-130 1998 IEEE Real Time Technology and Applications Symposium http://dlib.computer.org/conferen/rtas/8569/pdf/85690121.pdf http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1998.html#AbdelzaherS98 2003-05-19 Deadline Fair Scheduling: Bridging the Theory and Practice of Proportionate Fair Scheduling in Multiprocessor Systems. 3-14 2001 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/1134/11340003abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2001.html#ChandraAS01 2005-05-02 A Novel Framework for Quality-Aware Resource Management in Phased Array Radar Systems. 322-331 2005 IEEE Real-Time and Embedded Technology and Applications Symposium http://doi.ieeecomputersociety.org/10.1109/RTAS.2005.3 http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2005.html#Lee05 2003-05-22 RTCAST: lightweight multicast for real-time process groups. 250-259 1996 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/7448/74480250abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1996.html#AbdelzaherSJS96 2003-06-06 Error Propagation Analysis of Real-Time Data Intensive Applications. 166-171 1997 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/8016/80160166abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1997.html#DuoLW97 2003-05-19 Hierarchical QoS Management for Time Sensitive Applications. 63- 2001 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/1134/11340063abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2001.html#AbeniB01 2004-06-21 Dynamic CPU Management for Real-Time, Middleware-Based Systems. 286-295 2004 IEEE Real-Time and Embedded Technology and Applications Symposium http://csdl.computer.org/comp/proceedings/rtas/2004/2148/00/21480286abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2004.html#EideSRL04 2003-05-19 A Measurement-Based Analysis of the Real-Time Performance of Linux. 133- 2002 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/1739/17390133abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas2002.html#AbeniGKSW02 2003-05-22 SEW: A Toolset For Design and Analysis of Distributed Real-Time Systems. 72- 1997 IEEE Real Time Technology and Applications Symposium http://computer.org/proceedings/rtas/8016/80160072abs.htm http://www.informatik.uni-trier.de/~ley/db/conf/rtas/rtas1997.html#ChatterjeeBMCS97 2003-07-03 Collaborative Operating System and Compiler Power Management for Real-Time Applications. 133- 2003 IEEE Real Time Technology and Applications Symposium http://csdl.computer.org/comp/proceedings/rtas/2003/1956/00/19560133a