Finite Countermodel Based Verification for Program Transformation (A Case Study)

Both automatic program verification and program transformation are based on program analysis. In the past decade a number of approaches using various automatic general-purpose program transformation techniques (partial deduction, specialization, supercompilation) for verification of unreachability properties of computing systems were introduced and demonstrated. On the other hand, the semantics based unfold-fold program transformation methods pose themselves diverse kinds of reachability tasks and try to solve them, aiming at improving the semantics tree of the program being transformed. That means some general-purpose verification methods may be used for strengthening program transformation techniques. This paper considers the question how finite countermodels for safety verification method might be used in Turchin's supercompilation method. We extract a number of supercompilation sub-algorithms trying to solve reachability problems and demonstrate use of an external countermodel finder for solving some of the problems.Comment: In Proceedings VPT 2015, arXiv:1512.0221

Distilling programs for verification

In this paper, we show how our program transformation algorithm called distillation can not only be used for the optimisation of programs, but can also be used to facilitate program verification. Using the distillation algorithm, programs are transformed into a specialised form in which functions are tail recursive, and very few intermediate structures are created. We then show how properties of this specialised form of program can be easily verified by the application of inductive proof rules. We therefore argue that the distillation algorithm is an ideal candidate for inclusion within compilers as it facilitates the two goals of program optimization and verification

Systems Theory Based Architecture Framework for Complex System Governance

The purpose of this research was to develop a systems theory based framework for complex system governance using grounded theory approach. Motivation for this research includes: 1) the lack of research that identifies modeling characteristics for complex system governance, 2) the lack of a framework rooted in systems theory to support performance of complex system governance functions for maintaining system viability. This research focused on answering: What systems theoretic framework can be developed to inform complex system governance and enable articulation of governance function performance? The grounded theory research approach utilized three phases. First, the literature in systems theory, management cybernetics, governance and enterprise architecture was synthesized and open-coded to generalize main themes using broad analysis in NVivo software, researcher note taking in EndNote, and cataloging in Excel spreadsheets. Second, the literature underwent axial-coding to identify interconnections and relevance to systems theory and complex system governance, primarily using Excel spreadsheets. Finally, selective coding and interrelationships were identified and the complex system governance architecture framework was shaped, reviewed, and validated by qualified experts. This research examined a grounded theory approach not traditionally used in systems theory research. It produced a useful systems theory based framework for practical application, bridging the gap between theory and practice in the emerging field of complex system governance. Theoretical implications of this research include identifying the state of knowledge in each literature domain and the production of a unique framework for performing metasystem governance functions that is analytically generalizable. Management cybernetics, governance, and systems theory are expanded through a testable tool for meta-level organizational and system governance theories. Enterprise architecture is advanced with a multi-disciplinary framework that coherently presents and facilitates new use for architecture at the metasystem level. Methodological implications of this research include using grounded theory approach for systems theory research, where it is atypical. Although a non-traditional method, it provides an example for conducting fruitful research that can contribute knowledge. Practical implications of this research include a useable framework for complex system governance which has never before existed and a living structure adaptable to evolutionary change coming from any related domain or future practical application feedback

Простой алгоритм решения задачи покрытия для монотонных счетчиковых систем

An algorithm for solving the coverability problem for monotonic counter systems is presented. The solvability of this problem is well-known, but the algorithm is interesting due to its simplicity. The algorithm has emerged as a simplification of a certain procedure of a supercompiler application (a program specializer based on V.F. Turchin's supercompilation) to a program encoding a monotonic counter system along with initial and target sets of states and from the proof that under some conditions the procedure terminates and solves the coverability problem.Предложен алгоритм решения задачи покрытия для монотонных счетчиковых систем. Разрешимость этой задачи хорошо известна, но данный алгоритм интересен своей простотой. Он возник из упрощения некоторой итеративной процедуры применения суперкомпилятора (специализатора программ, основанного на методе суперкомпиляции В.Ф. Турчина) к программе, кодирующей счетчиковую систему и начальное и целевое множества состояний, и из доказательства, что при определенных условиях эта процедура завершается и решает задачу покрытия

Systems Theory-Based Construct for Identifying Metasystem Pathologies for Complex System Governance

The purpose of this research was to develop a systems theory-based construct for metasystem pathologies identification in support of the problem formulation phase of systems-based methodologies using an inductive research design. Problem formulation has been identified as one of the most critical stages in complex system development since it influences later stages in complex system understanding. In modern society where the operating landscape is characteristically ambiguous, mired by complexity, emergence. interdependence, and uncertainty, the concept of problem formulation is used to ensure right issues affecting complex systems surface and addressed to meet expected system performance and viability. In this research, this role of problem formulation is examined in systems-based methodologies in connection with systems theory. While the literature indicates the importance of problem formulation phase in systems-based methodologies. the conceptual foundations of systems theory that form the basis for \u27systemic\u27 thinking in these methodologies is not clearly inculcated into the problem formulation phase. This research addresses this gap by providing the necessary detailed discussion linking systems theory to problem formulation. The research focused on the lack of explicit use of systems theory in problem formulation and metasystemic issues of a higher logical order beyond single system of interest. A rigorous approach employing grounded theory method was used to analyze systems theory (laws, principles, and theorems) in terms of problem formulation to develop a construct – Metasystem Pathologies Identification and derived systems theory-based pathologies (circumstances. conditions, factors, or patterns) that act to limit system performance. A case study was then undertaken to face validate the applicability of emerging systems-theory pathologies in an operational setting were possible utility were developed. Fundamentally, this research presents a new approach to problem formulation where systemic thinking is at the foundation of identifying systemic issues affecting system performance. A significant promise for those interested in problem formulation is the inclusion of systems theory-based pathologies during problem formulation phase of systems-based approaches

On the engineering of crucial software

The various aspects of the conventional software development cycle are examined. This cycle was the basis of the augmented approach contained in the original grant proposal. This cycle was found inadequate for crucial software development, and the justification for this opinion is presented. Several possible enhancements to the conventional software cycle are discussed. Software fault tolerance, a possible enhancement of major importance, is discussed separately. Formal verification using mathematical proof is considered. Automatic programming is a radical alternative to the conventional cycle and is discussed. Recommendations for a comprehensive approach are presented, and various experiments which could be conducted in AIRLAB are described

Measuring the Propagation of Information in Partial Evaluation

We present the first measurement-based analysis of the information propagated by a partial evaluator. Our analysis is based on measuring implementations of string-matching algorithms, based on the observation that the sequence of character comparisons accurately reflects maintained information. Notably, we can easily prove matchers to be different and we show that they display more variety and finesse than previously believed. As a consequence, we are able to pinpoint differences and inaccuracies in many results previously considered equivalent. Our analysis includes a framework that lets us obtain string matchers - notably the family of Boyer-Moore algorithms - in a systematic formalism-independent way from a few information-propagation primitives. By leveraging the existing research in string matching, we show that the landscape of information propagation is non-trivial in the sense that small changes in information propagation may dramatically change the properties of the resulting string matchers. We thus expect that this work will prove useful as a test and feedback mechanism for information propagation in the development of advanced program transformations, such as GPC or Supercompilation

Proceedings of the Automated Reasoning Workshop (ARW 2019)

Preface This volume contains the proceedings of ARW 2019, the twenty sixths Workshop on Automated Rea- soning (2nd{3d September 2019) hosted by the Department of Computer Science, Middlesex University, England (UK). Traditionally, this annual workshop which brings together, for a two-day intensive pro- gramme, researchers from different areas of automated reasoning, covers both traditional and emerging topics, disseminates achieved results or work in progress. During informal discussions at workshop ses- sions, the attendees, whether they are established in the Automated Reasoning community or are only at their early stages of their research career, gain invaluable feedback from colleagues. ARW always looks at the ways of strengthening links between academia, industry and government; between theoretical and practical advances. The 26th ARW is affiliated with TABLEAUX 2019 conference. These proceedings contain forteen extended abstracts contributed by the participants of the workshop and assembled in order of their presentations at the workshop. The abstracts cover a wide range of topics including the development of reasoning techniques for Agents, Model-Checking, Proof Search for classical and non-classical logics, Description Logics, development of Intelligent Prediction Models, application of Machine Learning to theorem proving, applications of AR in Cloud Computing and Networking. I would like to thank the members of the ARW Organising Committee for their advice and assis- tance. I would also like to thank the organisers of TABLEAUX/FroCoS 2019, and Andrei Popescu, the TABLEAUX Conference Chair, in particular, for the enormous work related to the organisation of this affiliation. I would also like to thank Natalia Yerashenia for helping in preparing these proceedings. London Alexander Bolotov September 201