Monads with merging

Monoids are one of the simplest theories in which we can compose elements of a set. Similarly, monads have been used extensively to treat composition of effectful code and its denotational semantics. During the last forty years the theory of monoids has been extended with diverse merge-like operators. In this article, we replicate several of these extensions at the level of monads. Building on a well-known relation between monads and monoids, we introduce monads with additional structure that account for merging. We show how monads with merging generalise and relate to models for well-known algebraic theories for concurrency such as classic process algebras and the more recent concurrent monoids. With these results, we aim to facilitate the generalisation and comparison of different approaches to concurrency

Proyecto de asistencia tecnológica al escrutinio provisorio en la provincia de Santa Fe

El Gobierno de la Provincia de Santa Fe ha decidido brindar asistencia tecnológica a los actores intervinientes en el proceso electoral. En este contexto, se ha suscrito un acuerdo con la Universidad Nacional de Rosario, a fin de recibir asistencia técnica en todo el proceso. Este trabajo presenta las características principales del proyecto, que será implementado mediante una prueba piloto en las elecciones del año 2017.Sociedad Argentina de Informática e Investigación Operativ

Proyecto de asistencia tecnológica al escrutinio provisorio en la provincia de Santa Fe

El Gobierno de la Provincia de Santa Fe ha decidido brindar asistencia tecnológica a los actores intervinientes en el proceso electoral. En este contexto, se ha suscrito un acuerdo con la Universidad Nacional de Rosario, a fin de recibir asistencia técnica en todo el proceso. Este trabajo presenta las características principales del proyecto, que será implementado mediante una prueba piloto en las elecciones del año 2017.Sociedad Argentina de Informática e Investigación Operativ

Proyecto de asistencia tecnológica al escrutinio provisorio en la provincia de Santa Fe

El Gobierno de la Provincia de Santa Fe ha decidido brindar asistencia tecnológica a los actores intervinientes en el proceso electoral. En este contexto, se ha suscrito un acuerdo con la Universidad Nacional de Rosario, a fin de recibir asistencia técnica en todo el proceso. Este trabajo presenta las características principales del proyecto, que será implementado mediante una prueba piloto en las elecciones del año 2017.Sociedad Argentina de Informática e Investigación Operativ

Securing Verified IO Programs Against Unverified Code in F*

We introduce SCIO*, a formally secure compilation framework for statically verified partial programs performing input-output (IO). The source language is an F* subset in which a verified program interacts with its IO-performing context via a higher-order interface that includes refinement types as well as pre- and post-conditions about past IO events. The target language is a smaller F* subset in which the compiled program is linked with an adversarial context that has an interface without refinement types, pre-conditions, or concrete post-conditions. To bridge this interface gap and make compilation and linking secure we propose a formally verified combination of higher-order contracts and reference monitoring for recording and controlling IO operations. Compilation uses contracts to convert the logical assumptions the program makes about the context into dynamic checks on each context-program boundary crossing. These boundary checks can depend on information about past IO events stored in the state of the monitor. But these checks cannot stop the adversarial target context before it performs dangerous IO operations. Therefore linking in SCIO* additionally forces the context to perform all IO actions via a secure IO library, which uses reference monitoring to dynamically enforce an access control policy before each IO operation. We prove in F* that SCIO* soundly enforces a global trace property for the compiled verified program linked with the untrusted context. Moreover, we prove in F* that SCIO* satisfies by construction Robust Relational Hyperproperty Preservation, a very strong secure compilation criterion. Finally, we illustrate SCIO* at work on a simple web server example.Comment: POPL'24 camera-ready versio

Dijkstra monads for all

This paper proposes a general semantic framework for verifying programs with arbitrary monadic side-effects using Dijkstra monads, which we define as monad-like structures indexed by a specification monad. We prove that any monad morphism between a computational monad and a specification monad gives rise to a Dijkstra monad, which provides great flexibility for obtaining Dijkstra monads tailored to the verification task at hand. We moreover show that a large variety of specification monads can be obtained by applying monad transformers to various base specification monads, including predicate transformers and Hoare-style pre- and postconditions. For defining correct monad transformers, we propose a language inspired by Moggi's monadic metalanguage that is parameterized by a dependent type theory. We also develop a notion of algebraic operations for Dijkstra monads, and start to investigate two ways of also accommodating effect handlers. We implement our framework in both Coq and F*, and illustrate that it supports a wide variety of verification styles for effects such as exceptions, nondeterminism, state, input-output, and general recursion

SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq

State-separating proofs (SSP) is a recent methodology for structuring game-based cryptographic proofs in a modular way, by using algebraic laws to exploit the modular structure of composed protocols. While promising, this methodology was previously not fully formalized and came with little tool support. We address this by introducing SSProve, the first general verification framework for machine-checked state-separating proofs. SSProve combines high-level modular proofs about composed protocols, as proposed in SSP, with a probabilistic relational program logic for formalizing the lower-level details, which together enable constructing machine-checked cryptographic proofs in the Coq proof assistant. Moreover, SSProve is itself fully formalized in Coq, including the algebraic laws of SSP, the soundness of the program logic, and the connection between these two verification styles. To illustrate SSProve we use it to mechanize the simple security proofs of ElGamal and PRF-based encryption. We also validate the SSProve approach by conducting two more substantial case studies: First, we mechanize an SSP security proof of the KEM-DEM public key encryption scheme, which led to the discovery of an error in the original paper proof that has since been fixed. Second, we use SSProve to formally prove security of the sigma-protocol zero-knowledge construction, and we moreover construct a commitment scheme from a sigma-protocol to compare with a similar development in CryptHOL. We instantiate the security proof for sigma-protocols to give concrete security bounds for Schnorr\u27s sigma-protocol

La Gestión Curricular y su Impacto en la Calidad Educativa en cinco Centros Escolares del distrito 09-05 del municipio de Tejutepeque, departamento de Cabañas.

Esta tesis pretende indagar e interpretar el papel de la gestión curricular y la relación con las responsabilidades del quehacer educativo, la vigilancia y control para el cumplimiento de normas, funciones que corresponden al director, subdirector y docentes en los centros escolares, ésta permite conocer los procesos de enseñanza aprendizaje, metodologías y estrategias que generen calidad educativa en los estudiantes, mediante la implementación de adecuaciones curriculares de acuerdo a las necesidades específicas de la comunidad educativa. Al conocer los efectos que la gestión curricular produce en el proceso de enseñanza aprendizaje de los estudiantes, resulta necesario hacer cambios que se vean reflejados en un óptimo rendimiento académico, lograrlo es uno de los múltiples retos que enfrenta la escuela salvadoreña, la cual exige docentes de calidad mediante la formación y actualización, para ofrecer un servicio educativo de calidad. This thesis aims to investigate and interpret the role of curricular management and the relationship with the responsibilities of educational work, monitoring and control for compliance with standards, functions that correspond to principal, vice principal and teachers in schools, this allows to know the teaching-learning processes, methodologies and strategies that generate educational quality in students, through the implementation of curricular adjustments according to the specific needs of the educational community. Knowing the effects that curricular management produces in the teaching-learning process of students, it is necessary to make changes that are reflected in optimal academic performance, achieving this is one of the many challenges facing the Salvadoran school, which requires teacher’s quality through training and updating, to offer a quality educational service