104 research outputs found

    Certificates for decision problems in temporal logic using context-based tableaux and sequent calculi.

    Get PDF
    115 p.Esta tesis trata de resolver problemas de Satisfactibilidad y Model Checking, aportando certificados del resultado. En ella, se trabaja con tres lógicas temporales: Propositional Linear Temporal Logic (PLTL), Computation Tree Logic (CTL) y Extended Computation Tree Logic (ECTL). Primero se presenta el trabajo realizado sobre Certified Satisfiability. Ahí se muestra una adaptación del ya existente método dual de tableaux y secuentes basados en contexto para satisfactibilidad de fórmulas PLTL en Negation Normal Form. Se ha trabajado la generación de certificados en el caso en el que las fórmulas son insactisfactibles. Por último, se aporta una prueba de soundness del método. Segundo, se ha optimizado con Sat Solvers el método de Certified Satisfiability para el contexto de Certified Model Checking. Se aportan varios ejemplos de sistemas y propiedades. Tercero, se ha creado un nuevo método dual de tableaux y secuentes basados en contexto para realizar Certified Satisfiability para fórmulas CTL yECTL. Se presenta el método y un algoritmo que genera tanto el modelo en el caso de que las fórmulas son satisfactibles como la prueba en el caso en que no lo sean. Por último, se presenta una implementación del método para CTL y una experimentación comparando el método propuesto con otro método de similares características

    Proofs about Network Communication: For Humans and Machines

    Full text link
    Many concurrent and distributed systems are safety-critical and therefore have to provide a high degree of assurance. Important properties of such systems are frequently proved on the specification level, but implementations typically deviate from specifications for practical reasons. Machine-checked proofs of bisimilarity statements are often useful for guaranteeing that properties of specifications carry over to implementations. In this paper, we present a way of conducting such proofs with a focus on network communication. The proofs resulting from our approach are not just machine-checked but also intelligible for humans.Comment: In Proceedings ICE 2023, arXiv:2308.0892

    Italian Proteomics Association, 5th Annual National Conference Abstract Volume

    Get PDF
    Abstract volume of the Italian Proteomics Association 5th Annual national conferenc

    A Cultural History of Chemistry in Antiquity

    Get PDF
    This open access bookA Cultural History of Chemistry in Antiquity covers the period from 3000 BCE to 600 CE, ranging across the civilizations of the Mediterranean and Near East. Over this long period, chemical artisans, recipes, and ideas were exchanged between Mesopotamia, Egypt, Phoenicia, Greece, Rome, and Byzantium. The flowering of alchemy in the Middle and Early Modern Ages had its roots in the chemical arts of antiquity. This study presents the first synthesis of this epoch, examining the centrality of intense exchange and interconnectivity to the discovery and development of sources, techniques, materials, and instruments. The 6 volume set of the Cultural History of Chemistry presents the first comprehensive history from the Bronze Age to today, covering all forms and aspects of chemistry and its ever-changing social context. The themes covered in each volume are theory and concepts; practice and experiment; laboratories and technology; culture and science; society and environment; trade and industry; learning and institutions; art and representation. Marco Beretta is Professor of History of Science at the University of Bologna, Italy. Volume 1 in the Cultural History of Chemistry set. General Editors: Peter J. T. Morris, University College London, UK, and Alan Rocke, Case Western Reserve University, USA. The open access edition of this book is available under a CC BY-NC-ND 4.0 license on www.bloomsburycollections.com. Open access was funded by the European Research Council

    Automated Deduction – CADE 28

    Get PDF
    This open access book constitutes the proceeding of the 28th International Conference on Automated Deduction, CADE 28, held virtually in July 2021. The 29 full papers and 7 system descriptions presented together with 2 invited papers were carefully reviewed and selected from 76 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience. The papers are organized in the following topics: Logical foundations; theory and principles; implementation and application; ATP and AI; and system descriptions

    Programming Languages and Systems

    Get PDF
    This open access book constitutes the proceedings of the 29th European Symposium on Programming, ESOP 2020, which was planned to take place in Dublin, Ireland, in April 2020, as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The actual ETAPS 2020 meeting was postponed due to the Corona pandemic. The papers deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems

    Intuitionistic fixed point logic

    Get PDF
    The logical system IFP introduced in this paper supports program extraction from proofs, unifying theoretical and practical advantages: Based on first-order logic and powerful strictly positive inductive and coinductive definitions, IFP support abstract axiomatic mathematics with a large amount of classical logic. The Haskell-like target programming language has a denotational and an operational semantics which are linked through a computational adequacy theorem that extends to infinite data. Program extraction is fully verified and highly optimised, thus extracted programs are guaranteed to be correct and free of junk. A case study in exact real number computation underpins IFP's effectiveness
    corecore