6th International School on Rewriting

July 16th - 20th, 2012. Valencia, Spain

Track A - Preliminary Program (34 hours)

	Monday, July 16	Tuesday, July 17	Wednesday, July 18	Thursday, July 19	Friday, July 20
09h00	ITR J. Meseguer	ITR J. Meseguer	ITR J. Meseguer	ITR J. Meseguer	ITR J. Meseguer
09h30
10h00
10h30
11h00	Break	Break	Break	Break	Break
11h30	ITR J. Meseguer	ITR J. Meseguer	MAU S. Escobar	MAU S. Escobar	TFA A. Rubio
12h00
12h30
13h00
13h30	Lunch	Lunch	Lunch	Lunch	Lunch
15h00	ETR B. Alarcón R. Gutiérrez	ETR B. Alarcón R. Gutiérrez	Excursion	ETR B. Alarcón R. Gutiérrez	TFA A. Rubio
15h30
16h00
16h30
17h00	Break	Break		Break	Break
17h30	ITR J. Meseguer	ITR J. Meseguer		TFA A. Rubio	ETR B. Alarcón R. Gutiérrez
18h00
18h30
19h00

• Acronyms:
  • ETR: Exercises on Term Rewriting (7.5 hours)
  • ITR: Introduction to Term Rewriting (17 hours)
  • MAU: A Rewriting-Based Specification and Programming Language: Maude (4 hours)
  • TFA: Termination of Rewriting: Foundations and Automation (5.5 hours)

Track B - Preliminary Program (34.5 hours)

	Monday, July 16	Tuesday, July 17	Wednesday, July 18	Thursday, July 19	Friday, July 20
09h00	TAT S. Tison	LCA P. Lescanne	NTA M. Alpuente	ARP A. Voronkov	RLA N. Martí-Oliet
09h30
10h00
10h30
11h00	Break	Break	Break	Break	Break
11h30	LCA P. Lescanne	TAT S. Tison	ARP A. Voronkov	NTA M. Alpuente	RLA N. Martí-Oliet
12h00
12h30
13h00
13h30	Lunch	Lunch	Lunch	Lunch	Lunch
15h00	SAV A.Oliveras	ACA G. Moser	Excursion	MUG T. Kutsia	CER X. Urbain
15h30
16h00
16h30
17h00	Break	Break		Break	Break
17h30	ACA G. Moser	SAV A.Oliveras		CER X. Urbain	MUG T. Kutsia
18h00
18h30
19h00

• Acronyms:
  • ACA: Automated Complexity Analysis of Term Rewriting Systems (4 hours)
  • ARP: Automated Reasoning and Theorem Proving (4 hours)
  • CER: Certification of Rewriting Properties (3.5 hours)
  • LCA: Lambda Calculus: Extensions and Applications (4 hours)
  • MUG: Matching, Unification, and Generalizations (3.5 hours)
  • NTA: Narrowing Techniques and Applications (4 hours)
  • RLA: Rewriting Logic and Applications (4 hours)
  • SAV: SAT and SMT Techniques in Proof and Verification (3.5 hours)
  • TAT: Tree Automata, Turing Machines and Term Rewriting (4 hours)