Command injection attacks, continuations, and the Lambek calculus

This paper shows connections between command injection attacks, continuations, and the Lambek calculus: certain command injections, such as the tautology attack on SQL, are shown to be a form of control effect that can be typed using the Lambek calculus, generalizing the double-negation typing of continuations. Lambek's syntactic calculus is a logic with two implicational connectives taking their arguments from the left and right, respectively. These connectives describe how strings interact with their left and right contexts when building up syntactic structures. The calculus is a form of propositional logic without structural rules, and so a forerunner of substructural logics like Linear Logic and Separation Logic.Comment: In Proceedings WoC 2015, arXiv:1606.0583

Mejora del aprendizaje de SQL con realimentación semántica

Depto. de Ingeniería de Software e Inteligencia Artificial (ISIA)Fac. de InformáticaFALSEsubmitte

Interval Neutrosophic Sets and Logic: Theory and Applications in Computing

A neutrosophic set is a part of neutrosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. The neutrosophic set is a powerful general formal framework that has been recently proposed. However, the neutrosophic set needs to be specified from a technical point of view. Here, we define the set-theoretic operators on an instance of a neutrosophic set, and call it an Interval Neutrosophic Set (INS). We prove various properties of INS, which are connected to operations and relations over INS. We also introduce a new logic system based on interval neutrosophic sets. We study the interval neutrosophic propositional calculus and interval neutrosophic predicate calculus. We also create a neutrosophic logic inference system based on interval neutrosophic logic. Under the framework of the interval neutrosophic set, we propose a data model based on the special case of the interval neutrosophic sets called Neutrosophic Data Model. This data model is the extension of fuzzy data model and paraconsistent data model. We generalize the set-theoretic operators and relation-theoretic operators of fuzzy relations and paraconsistent relations to neutrosophic relations. We propose the generalized SQL query constructs and tuple-relational calculus for Neutrosophic Data Model. We also design an architecture of Semantic Web Services agent based on the interval neutrosophic logic and do the simulation study

Normalization by Evaluation with Typed Abstract Syntax

We present a simple way to implement typed abstract syntax for thelambda calculus in Haskell, using phantom types, and we specify normalization by evaluation (i.e., type-directed partial evaluation) to yield thistyped abstract syntax. Proving that normalization by evaluation preserves types and yields normal forms then reduces to type-checking thespecification

Evaluación y mejora de la herramienta on-line DESweb para la enseñanza de bases de datos

El objetivo de este proyecto es evaluar en clase y mejorar la herramienta on-line DESweb para la enseñanza de bases de datos relacionales (con SQL) y deductivas (con Datalog y Prolog). Esta solicitud es continuación de un proyecto de la convocatoria anterior

Evaluación de la realimentación semántica de SQL en DES

El objetivo de este proyecto ha sido evaluar en clase la herramienta de realimentación semántica de consultas SQL, desarrollada sobre el sistema DES, ampliarla y mejorarla. Esta solicitud es continuación de un proyecto de la convocatoria anterior (curso 2017-2018). Se ha mejorado tanto el componente nuclear DES como la interfaz de usuario web. Los alumnos han usado y evaluado la herramienta en clases de bases de datos de varias facultades, completando las encuentas que se les han proporcionado

Evaluación y mejora de la herramienta on-line DESweb para la enseñanza de bases de datos (2)

El objetivo es la herramienta DESweb de apoyo a la docencia virtual y presencial para la enseñanza de bases de datos relacionales (SQL) y deductivas (Datalog). Esta solicitud es continuación de un proyecto de la convocatoria anterior

A new approach to the semantics of model diagrams

Sometimes, a diagram can say more than a thousand lines of code. But, sadly, most of the time, software engineers give up on diagrams after the design phase, and all real work is done in code. The supremacy of code over diagrams would be leveled if diagrams were code. This paper suggests that model and instance diagrams, or, which amounts to the same, class and object diagrams, become first level entities in a suitably expressive programming language, viz., type theory. The proposed semantics of diagrams is compositional and self-describing, i.e., reflexive, or metacircular. Moreover, it is well suited for metamodelling and model driven engineering, as it is possible to prove model transformations correct in type theory. The encoding into type theory has the additional benefit of making diagrams immediately useful, given an implementation of type theory