PKind: A parallel k-induction based model checker

PKind is a novel parallel k-induction-based model checker of invariant properties for finite- or infinite-state Lustre programs. Its architecture, which is strictly message-based, is designed to minimize synchronization delays and easily accommodate the incorporation of incremental invariant generators to enhance basic k-induction. We describe PKind's functionality and main features, and present experimental evidence that PKind significantly speeds up the verification of safety properties and, due to incremental invariant generation, also considerably increases the number of provable ones.Comment: In Proceedings PDMC 2011, arXiv:1111.006

SyGuS Techniques in the Core of an SMT Solver

We give an overview of recent techniques for implementing syntax-guided synthesis (SyGuS) algorithms in the core of Satisfiability Modulo Theories (SMT) solvers. We define several classes of synthesis conjectures and corresponding techniques that can be used when dealing with each class of conjecture.Comment: In Proceedings SYNT 2017, arXiv:1711.1022

What, who and when? Incorporating a discrete choice experiment into an economic evaluation

Acknowledgements The Medman study was funded by the Department of Health for England and Wales and managed by a collaboration of the National Pharmaceutical Association, the Royal Pharmaceutical Society of Great Britain, the Company Chemist Association and the Co-operative Pharmacy Technical Panel, led by the Pharmaceutical Services Negotiating Committee. The research in this paper was undertaken while the lead author MT was undertaking a doctoral research fellowship jointly funded by the Economic and Social Research Council (ESRC) and the Medical Research Council (MRC). The Health Economics Research Unit (HERU), University of Aberdeen is funded by the Chief Scientific Office of the Scottish Government Health and Social Care Directorate.Peer reviewedPublisher PD

Constraint Solving for Finite Model Finding in SMT Solvers

SMT solvers have been used successfully as reasoning engines for automated verification and other applications based on automated reasoning. Current techniques for dealing with quantified formulas in SMT are generally incomplete, forcing SMT solvers to report "unknown" when they fail to prove the unsatisfiability of a formula with quantifiers. This inability to return counter-models limits their usefulness in applications that produce queries involving quantified formulas. In this paper, we reduce these limitations by integrating finite model finding techniques based on constraint solving into the architecture used by modern SMT solvers. This approach is made possible by a novel solver for cardinality constraints, as well as techniques for on-demand instantiation of quantified formulas. Experiments show that our approach is competitive with the state of the art in SMT, and orthogonal to approaches in automated theorem proving.Comment: Under consideration for publication in Theory and Practice of Logic Programming (TPLP

La Antártida - por Santos Alazraqui - Revista Geográfica Americana, XXVII (Buenos Aires, 1947), 71-86.

Fil: Tinelli, Anna. Universidad Nacional de Cuyo. Facultad de Filosofía y Letra

Complex networks and public funding: the case of the 2007-2013 Italian program

In this paper we apply techniques of complex network analysis to data sources representing public funding programs and discuss the importance of the considered indicators for program evaluation. Starting from the Open Data repository of the 2007-2013 Italian Program Programma Operativo Nazionale 'Ricerca e Competitivit\`a' (PON R&C), we build a set of data models and perform network analysis over them. We discuss the obtained experimental results outlining interesting new perspectives that emerge from the application of the proposed methods to the socio-economical evaluation of funded programs.Comment: 22 pages, 9 figure

The “question of the technique”: from the designing idea to the realized form

This work aims at focusing the inner relationship between the formal intuition of the design process and the structural/technological boundaries behind the creation of any architectural constructed form. Through the analysis of some noteworthy architectural examples, we highlight the reasons for which their designers achieved a virtuous equilibrium between shape, design and constructive awareness. In a contemporary era in which the major architectural production seems more interested to show off and amaze the spectators with huge scales and charming contaminations from the entertainment industry, a call for the need of the Vitruvian lesson appears essentials: the more we push our creativity as designers, the more we need to keep it firmly stick to the principles of firmitas, utilitas and venusta

Implementing the Directive on patients’ rights in cross-border healthcare: are we ready?

On Friday 25 October 2013 European Union countries will bring into force their regulations necessary to comply with the Directive on patients’ rights in cross-border healthcare. On the same day at LSE, policymakers will join academics from the 13 partner institutions in the European Union Cross Border Care Collaboration (EUCBCC) project to discuss international experiences (for more information about the event or to book a place please see here)

Extending SMTCoq, a Certified Checker for SMT (Extended Abstract)

This extended abstract reports on current progress of SMTCoq, a communication tool between the Coq proof assistant and external SAT and SMT solvers. Based on a checker for generic first-order certificates implemented and proved correct in Coq, SMTCoq offers facilities both to check external SAT and SMT answers and to improve Coq's automation using such solvers, in a safe way. Currently supporting the SAT solver zChaff, and the SMT solver veriT for the combination of the theories of congruence closure and linear integer arithmetic, SMTCoq is meant to be extendable with a reasonable amount of effort: we present work in progress to support the SMT solver CVC4 and the theory of bit vectors.Comment: In Proceedings HaTT 2016, arXiv:1606.0542