Pasar al contenido principal

METODOS RIGUROSOS PARA EL DESARROLLO DE SISTEMAS SOFTWARE DE CALIDAD Y FIABILIDAD CERTIFICADAS (SUBPROYECTO IMDEA)

PID2019-108528RB-C21

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2019
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario FUNDACION IMDEA SOFTWARE

Resultados relacionados

Resultados totales (Incluyendo duplicados): 5
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Some Thoughts on How to Teach Prolog

  • Hermenegildo, Manuel V.
  • Morales, José F.
  • López-García, Pedro
Lecture Notes in Computer Science (LNCS, volume 13900) 13 páginas, 5 figuras, Prolog, and (Constraint) Logic Programming in general, represent a unique programming paradigm. Prolog has many characteristics that are not present in other styles of programming, and this is one of the reasons why it is taught. At the same time, and precisely because of this uniqueness, teaching Prolog presents some special challenges. In this paper we present some lessons learned over many years of teaching Prolog, and (C)LP in general, mostly to CS college students, at several universities. We address how to show the beauty and usefulness of the language, and also how to avoid some common pitfalls, misconceptions, and myths about it. The emphasis of our discussion is on how, rather than what. Despite some focus on CS college students, we believe that many of the ideas that we propose also apply to teaching Prolog at any other education level., Partially funded by MICINN projects PID2019-108528RB-C21 ProCode, TED2021-132464B-I00 PRODIGY, and FJC2021-047102-I, by the Comunidad de Madrid program P2018/TCS-4339 BLOQUES-CM, and by the Tezos foundation.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

A Rule-Based Approach for Designing and Composing Abstract Domains

  • Jurjo, Daniel
  • Morales, José F.
  • López-García, Pedro
  • Hermenegildo, Manuel V.
Logic-Based Program Synthesis and Transformation. 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings Logic-Based Program Synthesis and Transformation. LOPSTR 2023. Lecture Notes in Computer Science, vol 14330. 19 páginas, Abstract interpretation allows constructing sound static analysis tools by safely approximating program semantics. Frameworks for abstract interpretation typically provide an implementation of a specialized iteration strategy to compute an abstract fixpoint, as well as a number of abstract domains in order to approximate different program properties. However, the design and implementation of additional domains, as well as their combinations, is eventually necessary to successfully prove arbitrary program properties. We propose a rule-based methodology for rapid design and prototyping of new domains and combining existing ones, with a focus on the analysis of logic programs. We provide several examples for domains combining numerical properties and data types and apply them to proving complex program properties., Partially funded by MICINN projects PID2019-108528RB-C21 ProCode, TED2021-132464B-I00 PRODIGY, and FJC2021-047102-I, and by the Tezos foundation.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation

  • Gallagher, John P.
  • Hermenegildo, Manuel V.
  • Morales, José F.
  • López-García, Pedro
International Symposium on Logic-Based Program Synthesis and Transformation, Cascais, Portugal, October 23-24, 2023 LOPSTR 2023. Lecture Notes in Computer Science, vol 14330, Natural semantics (big-step) and structural operational semantics (small-step) each have advantages, so it can be useful to produce both semantic forms for a language. Previous work has shown that big-step semantics can be transformed to small-step semantics. This is also the goal of our work, but our main contribution is to show that this can be done by specialisation of an interpreter that imposes a small-step execution on big-step transition rules. This is arguably more direct, transparent and flexible than previous methods. The paper contains two examples and further examples are available in an online repository., Partially funded by MICINN projects PID2019-108528RB-C21 ProCode, TED2021-132464B-I00 PRODIGY, and FJC2021-047102-I, and by the Tezos foundation.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Types, Modes and so Much More - The Prolog Way

  • Hermenegildo, Manuel V.
  • Morales, José F.
  • López-García, Pedro
  • Carro, Manuel
Prolog: The Next 50 Years. Lecture Notes in Computer Science, vol 13900, We present in a tutorial way some ideas developed in the context of the Ciao Prolog system that we believe could be useful for the future evolution of Prolog. We concentrate primarily on one area: the use of assertions with types, modes, and other properties, and how the unique characteristics of Prolog have made early advances possible in the area of combining static and dynamic language features. However, we also address briefly some other issues related to extending the expressiveness and functionality of the language., Partially funded by MICINN projects PID2019-108528RB-C21 ProCode, TED2021-132464B-I00 PRODIGY, and FJC2021-047102-I, by the Comunidad de Madrid program P2018/TCS-4339 BLOQUES-CM, and by the Tezos foundation.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

An Order Theory Framework of Recurrence Equations for Static Cost Analysis - Dynamic Inference of Non-Linear Inequality Invariants

  • Rustenholz, Louis
  • López-García, Pedro
  • Morales, José F.
  • Hermenegildo, Manuel V.
30 páginas, 5 figuras, 3 tablas, Recurrence equations have played a central role in static cost analysis, where they can be viewed as abstractions of programs and used to infer resource usage information without actually running the pro- grams with concrete data. Such information is typically represented as functions of input data sizes. More generally, recurrence equations have been increasingly used to automatically obtain non-linear numerical in- variants. However, state-of-the-art recurrence solvers and cost analysers suffer from serious limitations when dealing with the (complex) features of recurrences arising from cost analyses. We address this challenge by developing a novel order-theoretical framework where recurrences are viewed as operators and their solutions as fixpoints, which allows lever- aging powerful pre/postfixpoint search techniques. We prove useful prop- erties and provide principles and insights that enable us to develop tech- niques and combine them to design new solvers. We have also imple- mented and experimentally evaluated an optimisation-based instantia- tion of the proposed approach. The results are quite promising: our pro- totype outperforms state-of-the-art cost analysers and recurrence solvers, and can infer tight non-linear lower/upper bounds, in a reasonable time, for complex recurrences representing diverse program behaviours., This work has been partially supported by the Tezos foundation and by MICINN projects PID2019-108528RB-C21 ProCode and TED2021-132464B-I00 PRODIGY.