1,815 research outputs found

    Automated Specification Inference in a Combined Domain via User-Defined Predicates

    Get PDF
    Discovering program specifications automatically for heap-manipulating programs is a challenging task due\ud to the complexity of aliasing and mutability of data structures. This task is further complicated by an\ud expressive domain that combines shape, numerical and bag information. In this paper, we propose a compositional analysis framework that would derive the summary for each method in the expressive abstract\ud domain, independently from its callers. We propose a novel abstraction method with a bi-abduction technique in the combined domain to discover pre-/post-conditions that could not be automatically inferred\ud before. The analysis does not only infer memory safety properties, but also finds relationships between pure\ud and shape domains towards full functional correctness of programs. A prototype of the framework has been\ud implemented and initial experiments have shown that our approach can discover interesting properties for\ud non-trivial programs

    Space exploration: The interstellar goal and Titan demonstration

    Get PDF
    Automated interstellar space exploration is reviewed. The Titan demonstration mission is discussed. Remote sensing and automated modeling are considered. Nuclear electric propulsion, main orbiting spacecraft, lander/rover, subsatellites, atmospheric probes, powered air vehicles, and a surface science network comprise mission component concepts. Machine, intelligence in space exploration is discussed

    Invariant Synthesis for Incomplete Verification Engines

    Full text link
    We propose a framework for synthesizing inductive invariants for incomplete verification engines, which soundly reduce logical problems in undecidable theories to decidable theories. Our framework is based on the counter-example guided inductive synthesis principle (CEGIS) and allows verification engines to communicate non-provability information to guide invariant synthesis. We show precisely how the verification engine can compute such non-provability information and how to build effective learning algorithms when invariants are expressed as Boolean combinations of a fixed set of predicates. Moreover, we evaluate our framework in two verification settings, one in which verification engines need to handle quantified formulas and one in which verification engines have to reason about heap properties expressed in an expressive but undecidable separation logic. Our experiments show that our invariant synthesis framework based on non-provability information can both effectively synthesize inductive invariants and adequately strengthen contracts across a large suite of programs

    Formal verification of AI software

    Get PDF
    The application of formal verification techniques to Artificial Intelligence (AI) software, particularly expert systems, is investigated. Constraint satisfaction and model inversion are identified as two formal specification paradigms for different classes of expert systems. A formal definition of consistency is developed, and the notion of approximate semantics is introduced. Examples are given of how these ideas can be applied in both declarative and imperative forms

    The role of abduction in production of new ideas in design

    Get PDF
    The pragmatist philosopher Peirce insisted that besides deduction and induction there is a third main form of inference, abduction, which is the only type of inference capable of producing new ideas. Also he defined abduction as a stage of the methodological process in science, where hypotheses are formed to explain anomalies. Basing on these seminal ideas, scholars have proposed modified, widened or alternative definitions of abduction and devised taxonomies of abductive inferences. Influenced by Peirce’s seminal writings and subsequent treatments on abduction in philosophy of science, design scholars have in the last 40 years endeavoured to shed light on design by means of the concept of abduction. The first treatment was provided by March in 1976. He viewed that abduction, which he called “productive reasoning”, is the key mode of reasoning in design. He also presented a three-step cyclic design process, similar to Peirce’s methodological process in science. Among the many other later treatments of design abduction, Roozenburg’s definition of explanatory and innovative abduction is noteworthy. However, an evaluation of the related literature suggests that research into abduction in design is still in an undeveloped stage. This research shows gaps in coverage, lack of depth and diverging outcomes. By focusing on the differences between science and design as well as on empirical knowledge of different phenomena comprising design, new conceptions of abduction in design are derived. Given the differences of context, abduction in design shows characteristics not yet found or identified in science. For example, abduction can occur in connection to practically all inference types in design; it is a property of an inference besides an inference itself. A number of the most important abductive inference types as they occur in design are identified and discussed in more detail.Peer reviewe
    • …
    corecore