A Derivation Path Recording Method for Integrity Checking in Deductive Databases.
Matilde CelmaJuan Carlos CasamayorLaura Mota-HerranzMaría Ángeles Rubio PastorFrancisco Batel Marques
4
Citation
0
Reference
20
Related Paper
Keywords:
Deductive database
Data integrity
Cite
Summary Ontology formal model and ontology checking recently are still under hot discussion. In this paper, an ontology concept model is constructed using Description Logics. Based on model, the issue on Consistency checking of the extended ontology model is studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.
Satisfiability
Formal equivalence checking
Abstraction model checking
Cite
Citations (1)
Code (set theory)
Cite
Citations (7)
We describe a framework for symbolically evaluating iterative C code using a deductive approach that automatically discovers and proves program properties. Although verification is not performed, the method can infer detailed program behavior. Software engineering workflows could be enhanced by this type of analysis. Floyd-Hoare verification principles are applied to synthesize loop invariants, using a library of iteration-specific deductive knowledge. When needed, theorem proving is interleaved with evaluation and performed on the fly. Evaluation results take the form of inferred expressions and type constraints for values of program variables. An implementation using PVS (Prototype Verification System) is presented along with results for sample C functions.
Software verification
Code (set theory)
Cite
Citations (0)
Deductive database
Data integrity
Cite
Citations (12)
This thesis provides an efficient formal scheme for the tool-supported real-time system verification by combination of abstraction-based deductive and model checking techniques in order to handle the limitations of the applied verification techniques. This method is based on IAR (Iterative Abstract Refinement) to compute finite state abstractions. Given a transition system and a finite set of predicates, this method determines a finite abstraction, where each state of the abstract state space is a true assignment to the abstraction predicates. A theorem prover can be used to verify that the finite abstract model is a correct abstraction of a given system by checking conformance between an abstract and a concrete model by establishing/proving that a set of verification conditions are obtained during the IAR procedure. Then the safety/liveness properties are checked over the abstract model. If the verification condition holds successfully, IAR terminates its procedure. Otherwise more analysis is applied to identify if the abstract model needs to be more precise by adding extra predicates. As abstraction form, we adopt a class of predicate diagrams and define a variant of predicate diagram PDT (Predicate Diagram for Timed systems) that can be used to verify real-time and parameterized systems.
Predicate abstraction
Abstraction model checking
Liveness
Abstraction
Predicate (mathematical logic)
Gas meter prover
Cite
Citations (0)
IC3, a model checking algorithm for invariance properties, has inspired a fair amount of research since it was first noticed in 2011 and is now widely used in the EDA industry. It is rooted in the deductive approach to verification, central to which is the application of mathematical induction. IC3 applies induction in two ways: in the typical manner, to detect convergence to an inductive strengthening of the property, and in an incremental manner, to discover relatively inductive lemmas in response to concrete error states. Core ideas in IC3 have been lifted to algorithms for model checking LTL and CTL properties and for analyzing infinite-state systems.
Inductive Reasoning
CTL*
Cite
Citations (9)
Gas meter prover
Abstraction
Cite
Citations (92)
Predicate abstraction
Abstract Interpretation
Abstraction model checking
Cite
Citations (2)
Runtime Verification
Functional verification
Formal equivalence checking
Cite
Citations (1)