@comment{{Al final apareció en 2018}}
@comment{{2015}}
@unpublished{susana:2012:charlaAlcala,
tipoactividad = {Cursos, seminarios y tutoriales},
internacional = {yes},
author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
title = {Conferencia ``Experiencia en el uso de las Tecnolog{\'{i}}as de la Informaci{\'{o}}n y las Comunicaciones para dar sostenibilidad a una universidad en Ngozi, Burundi''},
note = {III Jornadas de Enfermedades Tropicales y Salud Internacional de la Facultad de Medicina de la Universidad de Alcal{\'{a}}},
address = {Alcal{\'{a}} de Henares, Madrid, Spain},
month = feb,
year = {2012}
}
@inproceedings{2012:susana:SOTICS,
author = {Mar{\'{i}}a Auxiliadora Montes and Miguel {\'{A}}ngel Pe{\~{n}}a and Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
title = {Distribution of Municipal Services Access Points over a Territory in a Scenario with Restricted Information},
booktitle = {Proceedings of the Second International Conference on Social Eco-Informatics (SOTICS 2012), Octubre 21-26, 2012, Venecia, Italia},
year = {2012},
isbn = {978-1-61208-228-8}
}
@inproceedings{2012:susana:Elearning,
author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana and M{\'{a}}ximo {Ram{\'{i}}rez Robles}},
title = {A software supported loan system for sustainability in education},
booktitle = {Proceedings of the 7th International Conference on ICT for Development, Education and Training, Mayo 23-25, 2012, Cotonou, Benin},
year = {2012}
}
@inproceedings{2012:susana:EDUCON,
author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana and M{\'{a}}ximo {Ram{\'{i}}rez Robles}},
title = {UBURYO: Open Source Software for managing micro-credits in education},
booktitle = {Proceedings of the International Conference EDUCON 20121. Collaborative Learning and New Pedagogic Approaches in Engineering Education. IEEE Catalog Number: CFP12EDU-USB, Abril 17-20, 2012, Marrakesh, Marruecos},
year = {2012},
isbn = {978-4673-14dd-8},
issn = {2165-9559},
note = {Premio al mejor art{\'{i}}culo en la categor{\'{i}}a de "M{\'{e}}todos educativos y menanismos de ense{\~{n}}anza en ingenier{\'{i}}a"}
}
@inproceedings{2012:susana:IDLELO,
author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana and M{\'{a}}ximo {Ram{\'{i}}rez Robles}},
title = {Sustainable Loans System: motivation,engagement besides an opportunity of education},
booktitle = {Proceedings of IDLELO 5 (Free and Open Source Foundation For Africa Conference)Theme: "Open Source Solutions for achieving Millenium Development Goals", Marzo 19-23, 2012, Abuja, Nigeria},
year = {2012}
}
@inproceedings{2012:susana:DEV,
author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana and M{\'{a}}ximo {Ram{\'{i}}rez Robles}},
title = {Evaluation of an application for managing microcredits in education},
booktitle = {Proceedings of the ACM DEV 2012 (the second annual Symposium on Computing for Development), Marzo 11-12, 2012, Atlanta, GA, EEUU},
pages = {22},
year = {2012},
isbn = {978-1-4503-1262-2},
doi = {10.1145/2160601.2160629},
publisher = {ACM}
}
@unpublished{susana2012LRC,
author = {Mu{\~n}oz Hern{\'a}ndez, Susana},
title = {Socializing Label Translation for Real Multilingual Software Applications},
note = {In 17th Annual LRC Internationalisation {\&}
Localisation Conference: Social Localisation, University of Limerick},
month = {September},
year = 2012,
url = {http://www.localisation.ie/resources/conferences/2012/presentations/Socializing%20Label%20Translation.pdf}
}
@inproceedings{DBLP:conf/ppdp/MonjarazM12,
author = {Rub{\'e}n Monjaraz and
Julio Mari{\~n}o},
title = {From the $\pi$-calculus to flat GHC},
booktitle = {PPDP},
year = {2012},
pages = {163-172},
ee = {http://doi.acm.org/10.1145/2370776.2370797},
crossref = {DBLP:conf/ppdp/2012},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/ppdp/2012,
editor = {Danny De Schreye and
Gerda Janssens and
Andy King},
title = {Principles and Practice of Declarative Programming, PPDP'12,
Leuven, Belgium - September 19 - 21, 2012},
booktitle = {PPDP},
publisher = {ACM},
year = {2012},
isbn = {978-1-4503-1522-7},
ee = {http://dl.acm.org/citation.cfm?id=2370776},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{2012:gallego:iclp,
author = {{Gallego Arias}, Emilio Jes{\'u}s and Lipton, James},
title = {Logic Programming in Tabular Allegories},
booktitle = {Technical Communications of the 28th International Conference
on Logic Programming, ICLP 2012, September 4-8, 2012, Budapest,
Hungary},
year = {2012},
pages = {334-347},
ee = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.334},
editor = {Agostino Dovier and
V\'{\i}tor Santos Costa},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
series = {LIPIcs},
volume = {17},
isbn = {978-3-939897-43-9}
}
@phdthesis{2012:phd:egallego,
author = {{Gallego Arias}, Emilio Jes{\'{u}}s},
title = {Relational and Allegorical Semantics for Constraint Logic Programming},
school = {Facultad de Inform{\'{a}}tica, Universidad Polit{\'{e}}cnica de Madrid},
note = {Advisors: Jim Lipton and Julio Mari{\~{n}}o},
year = 2012,
month = {July}
}
@inproceedings{2012:PNI:TPF,
tipoactividad = {Ponencias en congresos},
internacional = {no},
revisores = {yes},
author = {{{\'{A}}lvaro} {Garc{\'{i}}a-P{\'{e}}rez} and Pablo Nogueira},
title = {Enfoque normal y enfoque spine para reducci{\'{o}}n en el c{\'{a}}lculo
lambda puro},
booktitle = {Actas de las {XII} {J}ornadas sobre {P}rogramaci{\'{o}}n y
{L}enguajes - {PROLE}'12},
url = {http://www.sistedes.es/ficheros/actas-conferencias/PROLE/2012.pdf},
isbn = {978-84-15487-29-6},
pages = {265-266},
year = {2012},
editor = {{Mar{\'{i}}a del Mar Gallardo} and Mateu Villaret and {Jos{\'{e}}
M. G{\'{o}}mez}},
address = {Almer{\'{i}}a},
month = sep,
organization = {Sistedes},
publisher = {Universidad de Almer{\'{i}}a},
abstract = {El enfoque tradicional para la reducci{\'{o}}n en el c{\'{a}}lculo
lambda puro considera estrategias est{\'{a}}ndar, que nunca
contraen un \emph{redex} que est{\'{e}} a la izquierda del
contracto de alg{\'{u}}n otro redex previamente contra{\'{i}}do. La
estrategia \emph{normal order} representa dicho enfoque---al
que nos referimos como \emph{enfoque normal}---, contrayendo
el redex situado m{\'{a}}s a la izquierda hasta que se alcanza una
forma normal. Normal order elimina todos los \emph{redices}
presentes en el t{\'{e}}rmino, incluso aquellos que se encuentran
en el cuerpo de una abstracci{\'{o}}n o a la derecha de una
variable libre. Normal order es una estrategia completa, ya
que encuentra la forma normal de un t{\'{e}}rmino si {\'{e}}sta existe,
o diverge en caso contrario. Normal order es una estrategia
\emph{h{\'{i}}brida}, donde su definici{\'{o}}n \emph{big-step} utiliza
a la estrategia \emph{call-by-name} de forma subsidiaria. A
diferencia de normal order, call-by-name no contrae ning{\'{u}}n
redex que se encuentre bajo lambda ni a la derecha de una
variable libre, produciendo formas normales
\emph{weak-head}. Normal order utiliza call-by-name para
localizar el redex m{\'{a}}s exterior, contrayendo primero el
redex $(\lambda x.B)\,N$ en vez de contraer prematuramente
alg{\'{u}}n redex en $B$. Existe un enfoque alternativo que
recorre la espina del t{\'{e}}rmino (penetrando en el cuerpo de
las abstracciones) antes de contraer el redex m{\'{a}}s
exterior. Denominamos a {\'{e}}ste \emph{enfoque spine}. Las
estrategia \emph{spine order} reduce bajo lambda y devuelve
formas normales, utilizando \emph{head spine} como
estrategia subsidiaria. Head spine reduce los cuerpos de las
abstracciones pero nunca a la derecha de una variable libre,
produciendo formas normales \emph{head}. Spine order utiliza
un esquema de hibridaci{\'{o}}n similar al de normal order,
tomando head spine como subsidiaria. Spine order contraer{\'{a}}
primero el redex $(\lambda x.B)\,N$---donde $B$ es una forma
normal \emph{head}---en vez de contraer prematuramente alg{\'{u}}n
redex situado a la derecha de una variable libre dentro de
$B$. {?`}Cu{\'{a}}les son las estrategias normal y \emph{spine} en
el c{\'{a}}lculo lambda \emph{value}? Dichas estrategias deben ser
an{\'{a}}logas a normal order y spine order, es decir, deben ser
completas y deben devolver formas normales, utilizando el
enfoque normal o \emph{spine} respectivamente. La respuesta
es \emph{value normal order} y \emph{value spine order}
respectivamente. En este trabajo damos una definici{\'{o}}n
precisa de estrategias h{\'{i}}bridas, construimos value normal
order y value spine order a partir de consideraciones
meta-te{\'{o}}ricas y generalizamos el Teorema de Estandarizaci{\'{o}}n
de Plotkin, demostrando un teorema an{\'{a}}logo al Teorema de
Reducci{\'{o}}n \emph{Quasi-Leftmost}, sustentando as{\'{i}} el enfoque
spine en el c{\'{a}}lculo lambda value.}
}
@inproceedings{2012:GPN:TPF,
tipoactividad = {Conferencias invitadas en congresos},
internacional = {no},
revisores = {yes},
author = {Pablo Nogueira},
title = {Los c{\'{a}}lculos lambda y lambda-value y sus estrategias de
reducci{\'{o}}n},
booktitle = {Actas de las {XII} {J}ornadas sobre {P}rogramaci{\'{o}}n y
{L}enguajes - {PROLE}'12},
url = {http://www.sistedes.es/ficheros/actas-conferencias/PROLE/2012.pdf},
isbn = {978-84-15487-27-2},
pages = {261},
year = {2012},
editor = {{Mar{\'{i}}a del Mar Gallardo} and Mateu Villaret and {Jos{\'{e}}
M. G{\'{o}}mez}},
address = {Almer{\'{i}}a},
month = sep,
organization = {Sistedes},
publisher = {Universidad de Almer{\'{i}}a},
abstract = {El c{\'{a}}lculo lambda es el n{\'{u}}cleo de los lenguajes funcionales.
El c{\'{a}}lculo lambda puro es la versi{\'{o}}n cl{\'{a}}sica m{\'{a}}s basica.
Menos conocidos son el c{\'{a}}lculo lambda-value de Plotkin y la
generalizaci{\'{o}}n de ambos, el c{\'{a}}lculo lambda-param{\'{e}}trico de
Paolini y Ronchi della Rocca. En este seminario me gustar{\'{i}}a
dar a conocer dichos c{\'{a}}lculos, los conceptos fundamentales
(conversi{\'{o}}n, reducci{\'{o}}n, estrategias de reducci{\'{o}}n small-step
y big-step, compleci{\'{o}}n, estandarizaci{\'{o}}n, solvability, etc.)
y por qu{\'{e}} son {\'{u}}tiles para el estudio de los lenguajes de
programaci{\'{o}}n funcional.}
}
@proceedings{DBLP:conf/mpc/2012,
tipoactividad = {Libros},
internacional = {yes},
url = {http://www.springeronline.com/978-3-642-31112-3},
editor = {Jeremy Gibbons and Pablo Nogueira},
title = {Proceedings of the 11th {I}nternational {C}onference on
{M}athematics of {P}rogram {C}onstruction, 25--27 {J}une
2012, {M}adrid, {S}pain},
optbooktitle = {MPC 2012},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {7342},
year = {2012},
isbn = {978-3-642-31112-3},
doi = {10.1007/978-3-642-31113-0}
}
@techreport{2012:moreno:science-in-spain,
tipoactividad = {Otras publicaciones},
author = {{Juan Jos{\'{e}}} {Moreno Navarro}},
title = {Evolution of science in Spain by subject areas},
institution = {Babel Group, Universidad Polit{\'{e}}cnica de Madrid},
year = {2012},
number = {UPM-BABEL-2012-001},
month = sep
}
@mastersthesis{2012:sinan-egilmez,
author = {Sinan E\u{g}ilmez},
title = {A Sound And Efficient Approach For The Similarity Concept In Fuzzy Logic},
school = {Facultad de Inform{\'a}tica, Universidad Polit{\'e}cnica de Madrid},
year = {2012},
month = {October},
day = {9},
url = {http://www.emcl-study.eu/graduates.html},
internacional = {yes},
note = {Advisors: Susana Mu{\~n}oz Hern{\'a}ndez and V{\'i}ctor Pablos Ceruelo, Calificaci{\'{o}}n: Sobresaliente (9.5/10)}
}
@inproceedings{AGERE:2012:afdcbcbelf,
title = {Adding Distribution and Fault Tolerance to {Jason}},
author = {{{\'{A}}lvaro} {Fern{\'{a}}ndez D{\'{i}}az} and {Clara {Benac Earle}} and
{Lars-{\AA}ke {Fredlund}}},
booktitle = {Workshop on Programming based on Actors, Agents, and
Decentralized Control 2012({AGERE! 2012})},
revisores = {yes},
month = {October 21-22},
year = {2012},
internacional = {yes},
tipoactividad = {Ponencias en congresos},
address = {Tucson, Arizona (USA)},
abstract = {In this paper we describe an extension of the multiagent
system programming language Jason with constructs for
distribution and fault tolerance. The standard Java-based
Jason implementation already does provide a distribution
mechanism, which is implemented using the JADE library, but
to use it effectively some Java programming is often
required. Moreover, there is no support for fault
tolerance. In contrast this paper develops constructs for
distribution and fault tolerance wholly integrated in Jason,
permitting the Jason programmer to implement complex
distributed systems entirely in Jason itself. The fault
tolerance techniques implemented allow the agents to detect,
and hence react accordingly, when other agents have stopped
working for some reason (e.g., due to a software or a
hardware failure) or cannot anymore by reached due to a
communication link failure. The introduction of
distribution and fault tolerance in Jason represent a step
forward towards the coherent integration of successful
distributed software techniques, into the agent based
software paradigm. The proposed extension to Jason has been
implemented in eJason, an Erlang-based implementation of
Jason. In fact, in this work we essentially import the
distribution and fault tolerance mechanisms from the Erlang
programming language into Jason, a task which requires
adaptation of the basic primitives due to the difference
between a process based functional programming language
(Erlang) and a language for programming BDI
(Belief-Desire-Intention) agent based systems (Jason). },
pdf = {http://babel.ls.fi.upm.es/~avalor/papers/Agere2012.pdf},
notes = {Final version ongoing},
isbn = {To be supplied}
}
@inproceedings{ErlangWorkshop:2012:afdcbcbelf,
title = {Erlang as an Implementation Platform for {BDI} Languages},
author = {{{\'{A}}lvaro} {Fern{\'{a}}ndez D{\'{i}}az} and {Clara {Benac Earle}} and
{Lars-{\AA}ke {Fredlund}}},
booktitle = {Eleventh ACM SIGPLAN {Erlang} Workshop 2012({Erlang 12})},
revisores = {yes},
month = {September 14},
year = {2012},
internacional = {yes},
tipoactividad = {Ponencias en congresos},
address = {Copenhagen, Denmark},
abstract = {In this paper we report on our experiences using Erlang to
implement a subset of the agent-oriented programming
language Jason. The principal existing implementation of
Jason is written in Java, but suffers from a number of
drawbacks, i.e., has severe limitations concerning the
number of agents that can execute in parallel. Basing a
Jason implementation on Erlang itself has the potential of
improving such aspects of the resulting multi-agent
platform. To evaluate Erlang as a programming language
implementation platform the paper describes our experiences
in mapping Jason to Erlang, highlighting the positive and
negative aspects of Erlang for this task. Moreover, the
paper contains a number of benchmarks to evaluate the
quantitative aspects of the resulting Jason implementation,
especially with respect to support large multi-agent
systems.},
pdf = {http://babel.ls.fi.upm.es/~avalor/papers/erlangWorkshop12.pdf},
isbn = {978-1-4503-1575-3}
}
@article{soriano2012entcs,
author = {Ana Mar{\'{i}}a {Fern{\'{a}}ndez-Soriano} and Julio Mari{\~{n}}o and {{\'{A}}ngel}
Herranz},
title = {A Tool for the Integration of Constraint Programming in
Spreadsheets},
journal = {Electronic Notes in Theoretical Computer Science},
volume = {282},
number = {0},
pages = {35-45},
year = {2012},
note = {Proceedings of the XI Spanish Conference on Programming and
Languages, PROLE 2011},
issn = {1571-0661},
doi = {10.1016/j.entcs.2011.12.004},
url = {http://www.sciencedirect.com/science/article/pii/S1571066111001939},
abstract = {Spreadsheets have become widely used tools, but they are
applied to increasingly complex problems, far beyond the
kind of tasks for which they were originally conceived. This
often results in large, hard to maintain sheets, with little
guarantee about their correctness. Potential errors are due
in part to unskilled users and also to the spreadsheet
systems' own limitations. This contribution presents a tool
that aims at improving the usual working flow when filling
in a spreadsheet. The tool integrates a constraint solver
based on transformations of the cell content into equality
and inequality systems over rationals. The transformed
systems are then solved using constraint logic programs and
the obtained solutions are presented to the user in an
understandable way. One of the practical benefits of this
solution based on constraint logic programming is backwards
execution: our tool is able to find out the required input
values to reach the desired outputs depending on aggregation
formulae written in the cells. Also, the constraint model
offers a simple and sound solution to the problem of
circular references in cell formulas.}
}
@article{gabbaynanevski2012jal,
author = {Murdoch J. Gabbay and Aleksandar Nanevski},
title = {Denotation of Syntax and Metaprogramming in
Contextual Modal Type Theory},
journal = {Submitted to the Journal of Applied Logic},
year = 2012
}
@article{gabbay:metvil,
author = {Murdoch J. Gabbay},
title = {Meta-variables as infinite lists in nominal terms unification and rewriting},
journal = {Logic Journal of the {IGPL}},
publisher = {Oxford University Press},
year = {2012},
note = {In press}
}
@inproceedings{FORTE:2012:cbclf,
title = {Verification of Timed {Erlang} Programs using {McErlang}.},
author = {{Clara {Benac Earle}} and
{Lars-{\AA}ke {Fredlund}}},
booktitle = {14th IFIP WG 6.1 International Conference FMOODS 2012
and 32nd IFIP WG 6.1 International Conference FORTE
2012, Stockholm, Sweden, 13-16 June, 2012},
revisores = {yes},
day = {},
series = {IFIP-LNCS},
volume = 7273,
month = {June},
year = {2012},
internacional = {yes},
tipoactividad = {Ponencias en congresos},
address = {}
}
@inproceedings{PROMAS:2012:afdcbcbelf,
title = {eJason: an implementation of {Jason} in {Erlang}.},
author = {{{\'{A}}lvaro} {Fern{\'{a}}ndez D{\'{i}}az} and {Clara {Benac Earle}} and
{Lars-{\AA}ke {Fredlund}}},
booktitle = {10th International Workshop on Programming Multi-Agent
Systems ({ProMAS} 2012)},
revisores = {yes},
month = {June 5},
year = {2012},
internacional = {yes},
tipoactividad = {Ponencias en congresos},
address = {Valencia, Spain},
note = {Under evaluation to be included in LNCS},
abstract = {In this paper we describe eJason, a prototype implementation
of Jason, the well-known agent-oriented programming language, in
Erlang, a concurrent functional programming language. The reason for
choosing Erlang as the implementation vehicle is the surprising number
of similarities between Jason and Erlang, e.g., both have their syntactical
roots in logic programming, and share an actor-based process and
communication model. Moreover, the Erlang runtime system implements
lightweight processes and fast message passing between processes. Thus,
by mapping Jason agents and agent-to-agent communication onto Erlang
processes and Erlang process-to-process communication, we can create a
very high-performing Jason implementation, potentially capable of supporting
up to a hundred thousand concurrent actors. In this paper we
describe in detail the implementation of Jason in Erlang, and provide
early feedback on the performance of the implementation.},
pdf = {http://babel.ls.fi.upm.es/~avalor/papers/promas2012.pdf}
}
@inproceedings{QEST:2012:afdcbcbelf,
title = {Static Partial Order Reduction for Probabilistic Concurrent
Systems.},
author = {{{\'{A}}lvaro} {Fern{\'{a}}ndez D{\'{i}}az} and {{Christel} {Baier}} and
{Clara {Benac Earle}} and {Lars-{\AA}ke {Fredlund}}},
booktitle = {9th International Conference on Quantitative Evaluation of
SysTems ({QEST}) 2012 },
month = {September 17-20},
year = {2012},
revisores = {yes},
internacional = {yes},
tipoactividad = {Ponencias en congresos},
address = {London, United Kingdom},
isbn = {978-0-7695-4781-7},
pdf = {http://babel.ls.fi.upm.es/~avalor/papers/QEST12.pdf},
abstract = {Sound criteria for partial order reduction for
probabilistic concurrent systems have been presented in the
literature. Their realization relies on
a depth-first search-based approach for generating the reduced model.
The drawback of this dynamic approach is that it can hardly be combined
with other techniques to tackle the state explosion problem, e.g.,
symbolic probabilistic model checking with multi-terminal variants
of binary decision diagrams.
Following the approach presented by Kurshan et al.
for non-probabilistic systems, we study partial order
reduction techniques for probabilistic concurrent systems
that can be realized by a static analysis.
The idea is to inject the reduction criteria
into the control flow graphs of the processes of the system
to be analyzed.
We provide the theoretical foundations of static partial order reduction
for probabilistic concurrent systems and
present algorithms to realize them.
Finally, we report on some experimental results.}
}
@inproceedings{herranz12:_verif_implem_prior_monit_java,
tipoactividad = {Ponencias en congresos},
internacional = {yes},
author = {{{\'{A}}ngel} Herranz and Julio Mari{\~{n}}o},
title = {A Verified Implementation of Priority Monitors in {Java}},
booktitle = {Proceedings 2nd. International Conference on Formal Verification of Object-Oriented Software (FoVeOOS'11), Revised Lectures},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {7421},
year = {2012},
isbn = {978-3-642-31761-3},
ee = {????},
editor = {Bernhard Beckert and Ferruccio Damiani and Dilian Gurov}
}
@proceedings{DBLP:conf/ijcci/2010-s,
editor = {Kurosh Madani and Ant{\'{o}}nio Dourado Correia and
Agostinho C. Rosa and Joaquim Filipe},
title = {Computational Intelligence - Revised and Selected Papers of the International
Joint Conference, {IJCCI} 2010, Valencia, Spain, October 2010},
series = {Studies in Computational Intelligence},
volume = {399},
publisher = {Springer},
year = {2012},
url = {http://dx.doi.org/10.1007/978-3-642-27534-0},
doi = {10.1007/978-3-642-27534-0},
isbn = {978-3-642-27533-3},
timestamp = {Mon, 21 May 2012 19:31:48 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/ijcci/2010-s},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
This file was generated by bibtex2html 1.98.