Desarrollo de la competencia “Pensamiento Analítico” mediante tácticas de arquitecturas software

La competencia “Pensamiento Analítico” se define como el comportamiento mental que permite distinguir y separar las partes de un todo hasta llegar a conocer sus principios o elementos. La inferencia de una arquitectura software a partir de la documentación (normalmente escasa) de un sistema real y de su código fuente es una actividad intelectual compleja que requiere un entrenamiento avanzado de esta competencia en el alumno (niveles superiores en la escala propuesta por los profesores Villa y Poblete de la Universidad de Deusto). Este artículo analiza el empleo de un catálogo de tácticas arquitectónicas como guía para los alumnos en dicha tarea y señala las ventajas e inconvenientes de esta aproximación. El uso de catálogos de tácticas puede generalizarse al contexto de otras asignaturas.Peer Reviewe

Seasonal Variation of Essential Oil Yield and Composition of Sage (Salvia officinalis L.) Grown in Castilla - La Mancha (Central Spain)

Links between phenology, yield and composition of the essential oil of common sage, Salvia officinalis L., grown in Guadalajara (Central Spain) were determined in the different phases of the biological cycle during one year. Data showed an average yield about 1.0%. The analysis of the oil components was carried out by GC-FID and GC/MS. The main oil constituent was alpha thujone (40.1 - 46.5%). Other identified compounds are beta pinene (2.6 - 4.5%), cineole (3.5 - 8.7%), beta thujone (4.1 - 5.6%), camphor (4.1 - 8.0%), borneol (1.3 - 3.7%), alpha humulene (3.8 - 7.3%), viridiflorol (3.4-12.6%) and manool (0.1-4.5%). The highest yield of oil was obtained in the period of full flowering and the highest concentration of alpha thujone in the period of initial flowering

Folding by Similarity

A formal specification can describe software models which are di±cult to program. Transformational methods based on fold/unfold strategies have been proposed to palliate this problem. The objective of applying transfor- mations is to filter out a new version of the specification where recursion may be introduced by a folding step. Among many problems, the "eureka" about when and how to define a new predicate is di±cult to find automatically. We propose a new version of the folding rule which decides automatically how to introduce new predicates in a specification. Our method is based on finding similarities between formulas represented as parsing trees and it constitutes an assistance to the complex problem of deriving recursive specifications from non recursive ones

Synthesis of positive logic programs for checking a class of definitions with infinite quantification

We describe a method based on unfold/fold transformations that synthesizes positive logicprograms P(r)with the purpose of checking mechanically definitions of the form D(r) =∀X(r(X) ⇔QYR(X, Y))where ris the relation defined by the formula QYR(X, Y), Xis a set of variables to be instantiated at runtime by ground terms, QYis a set of quantifiedvariables on infinite domains (Qis the quantifier) and R(X, Y)a quantifier-free formulain the language of a first-order logic theory. This work constitutes a first step towards theconstruction of a new type of assertion checkers with the ability of handling restrictedforms of infinite quantification

Towards a Theory on the Role of Ontologies in Software Engineering Problem Solving: Conclusions from a Theoretical Model of Methodological Works

We present and validate a theoretical model of methodological works in Software Engineering that, without claiming for completeness, allows us to investigate the role of ontologies in the problem solving process related with the development of software. Our main conclusion is the potential of ontologies as resources for an individual to think during problem solving. We argument that suitable ontologies can support solving strategies as well as motivate their invention. We also conclude the importance of accompany an ontology with knowledge that guides the engineer in reasoning with its concepts. The model regards a methodological work as an heterogeneous theory about a class of problems and about a number of conceptual elements. Some of the elements are ontologies, which play the role of identifying and relating aspects of the knowledge about the class of problems, making up novel perspectives on the problems that may promote solving strategies. For illustration purposes, we take Jackson’s “Problem Frames” as a case study. We analyse this work through the former model, identifying the ontologies, guides, and promoted strategies. Then we propose an alternative ontology, based on that used in the KAOS approach; we reformulate some parts of Jackson’s work through this ontology and propose a strategy as well as some guides.Comisión Interministerial de Ciencia y Tecnología TIC 2003-02737-C02-0

Executing Assertions via Synthesized Logic Programs

Programming with assertions constitutes an effective tool to detect and correct programming errors. The ability of executing for- mal specifications is essential in order to test automatically an imple mentation against its assertions. However, formal assertions may de scribe recursive models which are di±cult to identify so current assertion checkers limit, in a considerable way, the expressivity of the assertion language. In this paper, we are interested in showing how transforma- tional synthesis can help to execute \expressive" assertions r of the form 8¹x(r(¹x) , Q¹yR(¹x; ¹y)) where Q is either an existential or universal quan- tifier and R a quantifier free formula in the language of a formal theory C we call assertion context. This sort of theories is interesting because it presents a balance between expressiveness for writing assertions and existence of effective methods for compiling and executing them

Una Experiencia en el diseño y la impartición de una asignatura en torno a la metodología del aprendizaje basado en proyectos

En este artículo presentamos nuestra experiencia en la creación e impartición de una asignatura sobre Arquitecturas Software que aplica la metodología del aprendizaje basado en proyectos. La asignatura pertenece a una joven titulación de Máster Oficial creada bajo los principios del Espacio Europeo de Educación Superior (EEES) y actualmente ofrecida por la Universidad de Sevilla como parte de su oferta de estudios de postgrado. Las decisiones tomadas en el diseño de la asignatura en torno a una metodología activa y las conclusiones extraídas de su impartición pueden ser de ayuda a otros profesores durante el proceso de adaptación de las diferentes titulaciones al EEES.Peer Reviewe

Quasi-filiform Leibniz algebras of maximum length

The n-dimensional p-filiform Leibniz algebras of maximum length have already been studied with 0 p 2. For Lie algebras whose nilindex is equal to n − 2 there is only one characteristic sequence, (n − 2, 1, 1), while in Leibniz theory we obtain two possibilities: (n−2, 1, 1) and (n−2, 2). The first case (the 2-filiform case) is already known. The present paper deals with the second case, i.e., quasi-filiform non Lie Leibniz algebras of maximum length. Therefore this work completes the study of maximum length of Leibniz algebras with nilindex n − p with 0 p 2.Junta de Andalucía FQM-14

3-filiform Leibniz algebras of maximum length

This work completes the study of the solvable Leibniz algebras, more precisely, it completes the classi cation of the 3- liform Leibniz algebras of maximum length [4]. Moreover, due to the good structure of the algebras of maximum length, we also tackle some of their cohomological properties. Our main tools are the previous result of Cabezas and Pastor [3], the construction of appropriate homogeneous basis in the considered connected gradation and the computational support provided by the two programs implemented in the software Mathematica.Ministerio de Economía y Competitividad MTM2013–43687–

p-Filiform Leibniz algebras of maximum length

The descriptions (up to isomorphism) of naturally graded p-filiform Leibniz algebras and p-filiform (p 3) Leibniz algebras of maximum length are known. In this paper we study the gradation of maximum length for p-filiform Leibniz algebras. The present work aims at the classification of complex p-filiform (p 4) Leibniz algebras of maximum length