[Mar08a]

Guillem Marpons. Checking coding rules in OO languages using CRISP. In COST Action IC0701 2nd Meeting, Madrid, Spain, December 2008. [ bib | .pdf ]

[HL08b]

Olivier Hermant and James Lipton. Cut elimination in the intuitionistic theory of types with axioms and rewriting cuts, constructively. In C. E. Benzmüller, C. E. Brown, J. Siekmann, and R. Statman, editors, Reasoning in Simple Type Theory. Festschrift in Honor of Peter B. Andrews on His 70th Birthday, volume 17 of Studies in Logic. Mathematical Logic and Foundations. College Publications, December 1 2008. [ bib ]

[PCMHS08]

Víctor Pablos-Ceruelo, Susana Muñoz-Hernández, and Hannes Strass. Rfuzzy framework. In Puri Arenas and Damiano Zanardini, editors, 18th Workshop on Logic-based methods in Programming Environments, WLPE 2008, volume abs/0903.2188, pages 62--76, Udine, Italy, December 2008. [ bib | http | http | http ]

Fuzzy reasoning is a very productive research field that during the last years has provided a number of theoretical approaches and practical implementation prototypes. Nevertheless, the classical implementations, like Fril, are not adapted to the latest formal approaches, like multi-adjoint logic semantics. Some promising implementations, like Fuzzy Prolog, are so general that the regular user/programmer does not feel comfortable because either representation of fuzzy concepts is complex or the results difficult to interpret. In this paper we present a modern framework, RFuzzy, that is modelling multi-adjoint logic. It provides some extensions as default values (to represent missing information, even partial default values) and typed variables. RFuzzy represents the truth value of predicates through facts, rules and functions. RFuzzy answers queries with direct results (instead of constraints) and it is easy to use for any person that wants to represent a problem using fuzzy reasoning in a simple way (by using the classical representation with real numbers).

[GM08b]

Murdoch J. Gabbay and Aad Mathijssen. The lambda-calculus is nominal algebraic. In C. E. Benzmüller, C. E. Brown, J. Siekmann, and R. Statman, editors, Reasoning in Simple Type Theory. Festschrift in Honor of Peter B. Andrews on His 70th Birthday, volume 17 of Studies in Logic. Mathematical Logic and Foundations. College Publications, December 1 2008. [ bib | .pdf ]

[MPMHL08]

Jesús Martinez, Iván Pérez, Susana Muñoz-Hernández, and Daniel Lancho. Thin client technology in the academic environment. In IV Congreso Universidad y Cooperación al Desarrollo, Barcelona, España, November 2008. [ bib ]

[EMHPS08]

Francisco Escudero, Susana Muñoz-Hernández, David Pérez, and Fernándo Suarez. c&d-learning: b-learning eficiente adaptado a paises en desarrollo con bajos recursos. In IV Congreso Universidad y Cooperación al Desarrollo, Barcelona, España, November 2008. [ bib ]

[GG08c]

Amaya García-Pérez and Álvaro García-Pérez. La afinación de la flauta tradicional de tres agujeros. In VII Congreso de la Sociedad Española de Musicología, Cáceres, España, November 2008. Sociedad Española de Musicología. [ bib ]

[GM08c]

Murdoch J. Gabbay and Aad Mathijssen. One-and-a-halfth-order logic (journal version). Journal of Logic and Computation, 18(4):521--562, November 2008. [ bib | .pdf ]

[MMC⁺08b]

Guillem Marpons, Julio Mariño, Manuel Carro, Ángel Herranz, Lars-Åke Fredlund, Juan José Moreno-Navarro, and Álvaro Polo. A coding rule conformance checker integrated into GCC. In Jesús M. Almendros Jiménez and María José Suárez-Cabal, editors, VIII Jornadas sobre Programación y Lenguajes, PROLE 2008, pages 245--249, Gijón, Spain, October 7--10 2008. [ bib | .pdf ]

Coding rules are often used in industry for codifying software best practices and avoiding the many hazardous constructions present in languages such as C or C++. Predictable and customisable tools are needed to automatically measure adherence to these practices. Many of the properties about software needed for rule conformance analysis are calculated by modern compilers. We present an extension of the GNU Compiler Collection (GCC) that flags those code fragments that do not conform to a given set of rules. The user can define coding rules using a high-level declarative language based on logic programming.

[PHMHM08]

Iván Pérez, Ángel Herranz, Susana Muñoz-Hernández, and Juan José Moreno-Navarro. Modelling mash-up resources. In 13th Conference on Software Engineering and Databases, JISBD'08, pages 135--146, Gijón, Spain, October 7--10 2008. [ bib | .pdf ]

[NM08]

Pablo Nogueira and Juan José Moreno-Navarro. Bialgebra views: A way for polytypic programming to cohabit with data abstraction. In Ralf Hinze and Don Syme, editors, Proceedings of the 2nd ACM SIGPLAN Workshop on Generic Programming - ICFP-WGP'08, pages 61--73, Victoria (BC), Canada, September 20 2008. ACM Press. [ bib | DOI | http ]

Polytypic programming and data abstraction are important concepts in designing functional programs, but they do not fit well together. Polytypic programming currently depends on making public a free data type representation, while data abstraction depends on hiding the representation. This paper proposes the bialgebra views mechanism as a means of reconciling this conflict. Bialgebra views enable the specification of type structure according to interfaces, not representations, thus combining the genericity of polytypic programming with the information hiding of data abstraction, and narrowing the gap between generic programming in the functional and object-oriented paradigms

[Mar08b]

Guillem Marpons. Tutorial: GGCC coding rules with CRISP. In Global GCC Project Seminar, 43 rue d'Aboukir, 75002 Paris, France, September 10 2008. MANDRIVA S.A. [ bib | .pdf ]

[GLMN08]

Emilio Jesús Gallego Arias, James Lipton, Julio Mariño, and Pablo Nogueira. First-order unification using variable-free relational algebra. In Mircea Marin, editor, Proceedings of the 22nd International Workshop on Unification - UNIF'08, Report Series 08-11, Hagenberg, Austria, July 18 2008. RISC-Linz. [ bib ]

We propose a new unification algorithm in the CET+OC+DC theory using the variable-free relational calculus, formalism in which first order logic programs are represented and executed. In this context, two terms are unifiable when their relational representations have a nonempty intersection. For this purpose a rewriting system for computing normal forms of those intersections has been defined from a standard theory of relations extended with an axiomatization of functorial term-formers. For this system, we characterize normal forms and prove confluence and termination of rewriting, thus resulting in a decision procedure. Substitution gets replaced by intersection propagation, term clashes are captured with a simple rewriting system and occurs check translates to compatibility of term sequences. The presented system suggests some interesting results, such as the posibility of developing a new rewriting technique and the algebraic formalization of all the meta-logical concepts involved in unification

[BFIL08]

Clara Benac Earle, Lars-Åke Fredlund, J. Iglesias, and A. Ledezma. Verifying robocup teams. In In Proceedings of the 2008 workshop on Model Checking and Artificial Intelligence (MochART), July 2008. [ bib ]

[MMP08]

Guillem Marpons, Julio Mariño, and Álvaro Polo. Adding coding rule checking capabilities to the GCC toolchain. In Andrew J. Hutton, C. Craig Ross, and John W. Lockhart, editors, Proceedings of the GCC Developers' Summit 2008, pages 43--54, Ottawa, Canada, June 17--19 2008. [ bib | .pdf ]

Coding rules, which codify software best practices by constraining the set of “admissible” programs, are often used in industry to increase program reliability and maintainability. We present a tool that seamlessly integrates coding rule checking capabilities into the main development work-flow. In the proposed framework, the necessary source code features are extracted from the GCC compilation process. In this way, both compiler infrastructure and compilation stages can be reused. The coding rules themselves are defined using a high-level declarative language.

[FM08]

Manuel Freire Morán and Julio Mariño. Voto útil. Novática, 1(193):74, May-June 2008. [ bib ]

[MMC⁺08a]

Guillem Marpons, Julio Mariño-Carballo, Manuel Carro, Ángel Herranz, Juan José Moreno-Navarro, and Lars-Åke Fredlund. Automatic coding rule conformance checking using logic programming. In Paul Hudak and David Scott Warren, editors, Practical Aspects of Declarative Languages, 10th International Symposium, PADL 2008, volume 4902 of Lecture Notes in Computer Science, pages 18--34, San Francisco CA, USA, January 7--8 2008. Springer. [ bib | http ]

An extended practice in the realm of Software Engineering and programming in industry is the application of coding rules. Coding rules are customarily used to constrain the use (or abuse) of certain programming language constructions. However, these rules are usually written using natural language, which is intrinsically ambiguous and which may complicate their use and hinder their automatic enforcement. This paper presents some early work aiming at defining a framework to formalise and check for coding rule conformance using logic programming. We show how a certain class of rules -- structural rules -- can be reformulated as logic programs, which provides both a framework for formal specification and also for automatic conformance checking using a Prolog engine. Some examples of rules belonging to actual, third-party coding rule sets are discussed, along with the corresponding Prolog code. Experimental data regarding the practicality and impact of their application to real-life software projects is presented and discussed.

[Pér08]

Iván Pérez. Formalización de gramáticas paramétricas independientes de contexto e implementación en mtp (formalization of parametric context free grammar and its implementation in mtp). Master's thesis, Universidad Politécnica de Madrid, 2008. To obtain the Computer Science Engineer degree. [ bib ]

[Gui08]

Daniel Guimaraes Santos. Distributed implementation of functional logic programming. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, 2008. Advisor: Julio Mariño Carballo, Calificación: Notable. [ bib ]

[Str08]

Hannes Strasse. Fuzzy reasoning via logic programming. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, 2008. Advisor: Susana Muñoz Hernández, Calificación: Sobresaliente cum laude. [ bib ]

[Yu08]

Miao Yu. Translation of erlang programs for model checking. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, 2008. Advisor: Lars-Ake Fredlund, Calificación: Sobresaliente cum laude. [ bib ]

[HL08a]

Olivier Hermant and James Lipton. A constructive semantic approach to cut elimination in type theories with axioms. In Computer Science Logic, volume 5213 of Lecture Notes in Computer Science, pages 169--183. Springer, 2008. [ bib ]

[KL08]

Danny Krizanc and James Lipton. Formal treatment of secure protocols. In Evangelos Kranakis, Evgueni Haroutunian, and Elisa Shahbazian, editors, Aspects of Network and Information Security, pages 74--91. IOS Press, 2008. [ bib ]

[MM08]

Julio Mariño and Óscar Martín Sánchez. Las luces de la escalera. Novática, 1(191):72--74, January-February 2008. [ bib ]

[GM08a]

Murdoch J. Gabbay and Aad Mathijssen. Capture-avoiding substitution as a nominal algebra. Formal Aspects of Computing, 20(4-5):451--479, January 2008. [ bib | .pdf ]

[GL08]

Murdoch J. Gabbay and Stéphane Lengrand. The lambda-context calculus. ENTCS, 196:19--35, 2008. [ bib | DOI | .pdf ]

[GG08b]

Murdoch J. Gabbay and Michael J. Gabbay. a-logic with arrows (journal version). Electronic Notes in Theoretical Computer Science, 216:3--29, 2008. [ bib | .pdf ]

[GG08a]

Murdoch J. Gabbay and Michael Gabbay. Substitution for Fraenkel-Mostowski foundations. In Proceedings of the 2008 AISB Symposium on Computing and Philosophy, pages 65--72, 2008. [ bib | .pdf ]

[GM08d]

Murdoch J. Gabbay and Dominic P. Mulligan. One-and-a-halfth order terms: Curry-Howard for incomplete derivations. In Wilfrid Hodges and Ruy J. G. B. de Queiroz, editors, Proceedings of Workshop on Logic, Language and Information in Computation (WoLLIC 2008), volume 5110 of Lecture Notes in Artificial Intelligence, pages 179--193, 2008. [ bib | .pdf ]

[GH08]

Murdoch J. Gabbay and Martin Hofmann. Nominal renaming sets. In LPAR'08, volume 5330 of Lecture Notes in Computer Science, pages 158--173. Springer, 2008. [ bib | .pdf ]

This file was generated by bibtex2html 1.98.