Building on the work of Burstall, this paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are ma...
详细信息
ISBN:
(纸本)3540405593;9783540405597
Building on the work of Burstall, this paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are mapped to higher-level data types for verification. the programming language is embedded in higher-order logic. Its Hoare logic is derived. the whole development is purely definitional and thus sound. Apart from some smaller examples, the viability of this approach is demonstrated with a non-trivial case study. We show the correctness of the Schorr-Waite graph marking algorithm and present part of its readable proof in Isabelle/HOL. (c) 2005 Elsevier Inc. All rights reserved.
It is well known by Inductive logicprogramming (ILP) practioners that ILP systems usually take a long time to find valuable models (theories). the problem is specially critical for large datasets, preventing ILP syst...
详细信息
this paper motivates and presents a nonmonotonic version of Contextual Intensional logic, a type-theoretic logic intended as a general formalism for reasoning about context. In developing this logic, it is necessary t...
详细信息
the proceedings contain 33 papers. the topics discussed include: reflecting proofs in first-order logic with equality;tabling for higher-order logicprogramming;simulating reachability using first-order logic with app...
详细信息
ISBN:
(纸本)3540280057
the proceedings contain 33 papers. the topics discussed include: reflecting proofs in first-order logic with equality;tabling for higher-order logicprogramming;simulating reachability using first-order logic with applications to verification of linked data structures;privacy-sensitive information flow with JML;temporal logics over transitive states;hierarchical reasoning in local theory extensions;decision procedures customized for formal verification;connecting many-sorted theories;a proof-producing decision procedure for real arithmetic;the MathSAT 3 system;deduction with XOR constraints in security API modelling;on the complexity of equational horn clauses;and a combination method for generating interpolants.
the ability to express "derived predicates" in the formalization of a planning domain is both practically and theoretically important. In this paper, we propose an approach to planning with derived predicate...
详细信息
the proceedings contain 115 papers. the topics discussed include: a description logic based ontology language;preference reasoning;symmetry definitions for constraint satisfaction problems;dynamic ordering for asynchr...
详细信息
ISBN:
(纸本)3540292381
the proceedings contain 115 papers. the topics discussed include: a description logic based ontology language;preference reasoning;symmetry definitions for constraint satisfaction problems;dynamic ordering for asynchronous backtracking on DisCSPs;incremental algorithms for local search from existential second-order logic;mind the gaps: a new splitting strategy for consistency techniques;a linear-logic semantics for constraint handling rules;ad-hoc global constraints for life;interval analysis in scheduling;planning and scheduling to minimize tardiness;applying constraint programming to rigid body protein docking;generating corrective explanations for interactive constraint satisfaction;and depth-first mini-bucket elimination.
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input program before the actual reasoning sta...
详细信息
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input program before the actual reasoning starts. this prevents ASP to be effective on several classes of problems. In this paper we integrate answer set generation and constraint solving to reduce the memory requirements for a class of multi-sorted logic programs with cardinality constraints. We prove some theoretical results, introduce a provably sound and complete algorithm, and report experimental results showing that our approach can solve problem instances with significantly larger domains.
暂无评论