@inproceedings {Simula.simula.510,
	title = {Addressing Manufacturing Challenges With Cost-Efficient Fault Tolerant Routing},
	journal = {NOCS {\textquoteright}10 Proceedings of the 2010 Fourth ACM/IEEE International Symposium on Networks-on-Chip},
	year = {2010},
	pages = {25-32},
	publisher = {IEEE Computer Society},
	type = {Conference},
	isbn = {ISBN: 978-0-7695-4053-5},
	doi = {10.1109/NOCS.2010.12},
	author = {Samuel Rodrigo {Mocholi} and Flich, Jos{\'e} and Roca, Antoni and Medardoni, Simone and Bertozzi, Davide and Camacho, Jesus and Silla, Federico and Duato, Jose},
	editor = {IEEE Computer {Society}}
}
@inproceedings {Simula.simula.522,
	title = {An Efficient Implementation of Distributed Routing Algorithms for NoCs},
	journal = {Second ACM/IEEE International Symposium on Networks-on-Chip, NoCS 2008},
	year = {2008},
	month = {April},
	pages = {87-96},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {The design of NoCs for multi-core chips introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are preferred, heterogeneous blocks, fabrication faults, reliability issues, and chip virtualization may lead to the need of irregular topologies or regions. In this situation, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. LBDR (logic-based distributed routing) is proposed as a new routing method that removes the need of using routing tables at all. LBDR enables the implementation of many routing algorithms on most of the practical topologies we might find in the near future in a multi-core system. From an initial topology and routing algorithm, a set of three bits per switch/output port is computed. Evaluation results show that, by using a small logic, LBDR mimics the performance of routing algorithms when implemented with routing tables, both in regular and irregular topologies.},
	isbn = {0-7695-3098-2},
	doi = {10.1109/NOCS.2008.4492728},
	author = {Flich, Jos{\'e} and Samuel Rodrigo {Mocholi} and Duato, Jose},
	editor = {IEEE Computer {Society}}
}
@inproceedings {Briand.2005.1,
	title = {Instrumenting Contracts With Aspect-Oriented Programming to Increase Observability and Support Debugging},
	journal = {21st IEEE International Conference on Software Maintenance (ICSM), Budapest, Hungary, September 25-30},
	year = {2005},
	note = {Use of the attached PDF is subject to the IEEE terms found here: http://www.computer.org/portal/pages/csdl/content/Terms.html},
	pages = {687-690},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Analysis and design by contract allows the definition of a formal agreement between a class and its clients, expressing each party{\textquoteright}s rights and obligations. Operation contracts and class invariants are known to be a useful technique to specify the precondition and postcondition of operations and the legal states of class instances in an object-oriented context, making the definition of object-oriented analysis or design elements more precise. Furthermore, it is also useful to check such contracts and invariants at run time in order to help testing and debugging during corrective maintenance. Indeed, experiments report a substantial gain when relying on instrumented contracts during those two activities. However, the instrumentation of such contracts is a time consuming activity. In this paper we report on how Aspect-Oriented Programming (AOP), using AspectJ, can be employed to automatically and efficiently instrument contracts and invariants in Java. The paper focuses on (1) the AspectJ templates to instrument preconditions, postconditions, and class invariants, (2) the necessary instrumentation for compliance-checking to the Liskov Substitution Principle.},
	isbn = {0-7695-2368-4},
	author = {Briand, Lionel and Dzidek, James and Labiche, Yvan},
	editor = {IEEE Computer {Society}}
}
