Mining State-Based Models from Proof Corpora

Interactive theorem provers have been used extensively to reason about various software/hardware systems and mathematical theorems. The key challenge when using an interactive prover is finding a suitable sequence of proof steps that will lead to a successful proof requires a significant amount of human intervention. This paper presents an automated technique that takes as input examples of successful proofs and infers an Extended Finite State Machine as output. This can in turn be used to generate proofs of new conjectures. Our preliminary experiments show that the inferred models are generally accurate (contain few false-positive sequences) and that representing existing proofs in such a way can be very useful when guiding new ones.Comment: To Appear at Conferences on Intelligent Computer Mathematics 201

Transition from Passive Learner to Critical Evaluator through Peer-Testing of Programming Artefacts

Offering timely feedback on programming while encouraging learners to engage in critical evaluation of programs are the objectives of peer-testing. We report on a peer-testing experiment with students on distant campuses using a Web platform. The experiment shows the potential that peer-testing has to help students transition from passive learners to critical evaluators.  Keywords: Computer science education, peer testing, peer feedback, software testing, student transition

A pragmatic protocol for database replication in interconnected clusters

Multi-master update everywhere database replication, as achieved by protocols based on group communication such as DBSM and Postgres-R, addresses both performance and availability. By scaling it to wide area networks, one could save costly bandwidth and avoid large round-trips to a distant master server. Also, by ensuring that updates are safely stored at a remote site within transaction boundaries, disaster recovery is guaranteed. Unfortunately, scaling existing cluster based replication protocols is troublesome. In this paper we present a database replication protocol based on group communication that targets interconnected clusters. In contrast with previous proposals, it uses a separate multicast group for each cluster and thus does not impose any additional requirements on group communication, easing implementation and deployment in a real setting. Nonetheless, the protocol ensures one-copy equivalence while allowing all sites to execute update transactions. Experimental evaluation using the workload of the industry standard TPC-C benchmark confirms the advantages of the approach

Exploring Design Alternatives for RAMP Transactions through Statistical Model Checking

In this paper we explore and extend the design space of the recent RAMP (Read Atomic Multi-Partition) transaction system for large-scale partitioned data stores. Arriving at a mature distributed system design through implementation and experimental validation is a labor-intensive task, so that only a limited number of design alternatives can be explored in practice. The developers of RAMP did implement and validate three design alternatives for RAMP, and sketched three additional designs. This work addresses two questions: (1) How can the design space of a distributed transaction system such as RAMP be explored with modest effort, so that substantial knowledge about design alternatives can be gained before designs are implemented? and (2) How realistic and informative are the results of such design explorations? We answer the first question by: (i) formally modeling eight RAMP-like designs (five by the RAMP developers and three of our own) in Maude as probabilistic rewrite theories, and (ii) using statistical model checking of those models to analyze key performance metrics such as throughput, average latency, and degrees of strong consistency and read atomicity. We answer the second question by showing that our quantitative analyses: (i) are consistent with the experimental results obtained by the RAMP developers for their implemented designs; (ii) confirm the conjectures made by the RAMP developers for their other three unimplemented designs; and (iii) uncover some promising new designs that seem attractive for some applications.Ope

Formal Modeling and Analysis of the Walter Transactional Data Store

Walter is a distributed partially replicated data store providing Parallel Snapshot Isolation (PSI), an important consistency property that offers attractive performance while ensuring adequate guarantees for certain kinds of applications. In this work we formally model Walter's design in Maude and formally specify and verify PSI by model checking. To also analyze Walter's performance we extend the Maude specification of Walter to a probabilistic rewrite theory and perform statistical model checking analysis to evaluate Walter's throughput for a wide range of workloads. Our performance results are consistent with a previous experimental evaluation and throw new light on Walter's performance for different workloads not evaluated before.Ope

Automating Change of Representation for Proofs in Discrete Mathematics (Extended Version)

Representation determines how we can reason about a specific problem. Sometimes one representation helps us find a proof more easily than others. Most current automated reasoning tools focus on reasoning within one representation. There is, therefore, a need for the development of better tools to mechanise and automate formal and logically sound changes of representation. In this paper we look at examples of representational transformations in discrete mathematics, and show how we have used Isabelle's Transfer tool to automate the use of these transformations in proofs. We give a brief overview of a general theory of transformations that we consider appropriate for thinking about the matter, and we explain how it relates to the Transfer package. We show our progress towards developing a general tactic that incorporates the automatic search for representation within the proving process

Automatic Analysis of Consistency Properties of Distributed Transaction Systems in Maude

Many transaction systems distribute, partition, and replicate their data for scalability, availability, and fault tolerance. However, observing and maintaining strong consistency of distributed and partially replicated data leads to high transaction latencies. Since different applications require different consistency guarantees, there is a plethora of consistency properties---from weak ones such as read atomicity through various forms of snapshot isolation to stronger serializability properties---and distributed transaction systems (DTSs) guaranteeing such properties. This paper presents a general framework for formally specifying a DTS in Maude, and formalizes in Maude nine common consistency properties for DTSs so defined. Furthermore, we provide a fully automated method for analyzing whether the DTS satisfies the desired property for all initial states up to given bounds on system parameters. This is based on automatically recording relevant history during a Maude run and defining the consistency properties on such histories. To the best of our knowledge, this is the first time that model checking of all these properties in a unified, systematic manner is investigated. We have implemented a tool that automates our method, and use it to model check state-of-the-art DTSs such as P-Store, RAMP, Walter, Jessy, and ROLA.Ope

Semi-Automated Design Space Exploration for Formal Modelling

Refinement based formal methods allow the modelling of systems through incremental steps via abstraction. Discovering the right levels of abstraction, formulating correct and meaningful invariants, and analysing faulty models are some of the challenges faced when using this technique. We propose Design Space Exploration that aims to assist a designer by automatically providing high-level modelling guidance

Morbidity, life style and psychosocial situation in cancer survivors aged 60-69 years: results from The Nord-Trøndelag Health Study (The HUNT-II Study)

<p>Abstract</p> <p>Background</p> <p>Due to considerable health status differences in the elderly population, research limited to narrow age-spans might be an advantage. In this population-based controlled study we compare short-term (<5 years) (STS) and long-term (≥5 years) (LTS) cancer survivors and cancer-free controls aged 60-69 years from two Norwegian health registers; the Health Survey of North-Trøndelag County (HUNT-2 study) and the Cancer Registry of Norway (CRN). We examined possible factors associated with being cancer survivor.</p> <p>Methods</p> <p>Among 9,089 individuals aged 60-69 who participated in HUNT-2, 334 had been diagnosed with invasive primary cancer from 1 month to 42 years before HUNT-2 according to CRN and self-report. An overall random sample of controls without cancer five times larger than the sample of cases (N = 1,670) were drawn from the parent cohort.</p> <p>Results</p> <p>The cancer sample comprised 128 STS and 206 LTS. For most variables no significant differences were observed between LTS and STS. LTS were significantly more women, and cases with gynaecological cancer, with physical impairment and more thyroid diseases compared to STS. When comparing all the survivors with controls, the survivors showed significantly higher rate of pensioning, decreased self-rated health, more physical impairment and thyroid diseases, daily use of medication and psychotropics and higher level of anxiety and Framingham Risk score. Multivariate logistic regression analysis showed that increasing age, being female, physical impairment and thyroid diseases all were significantly associated with being survivor versus controls.</p> <p>Conclusion</p> <p>STS and LTS showed mostly similar situation. Compared to controls, the survivors reported somewhat poorer physical and mental health, but these differences were of doubtful clinical significance.</p