Deductive rules are useful for proving properties with fairness constraints and there have been many studies on such rules with justice and compassion constraints. This paper focuses on system specifications with strengthened compassion that impose constraints on transitions involving states and their successors. A deductive rule for proving liveness properties under strengthened compassion is ...

Deductive object bases (DOBs) attempt to combine the advantages of de-ductive relational databases with those of object-oriented databases. From an application perspective it is often not clear for what kind of applications this combination yields signiicant advantages. We argue for supporting distributed design environments by deductive object bases as repositories and summarize experiences ma...

This paper presents a deductive system in which one can prove total correctness of pure Prolog programs with negation. Total correctness of logic programs means two things: termination and partial correctness with respect to a specification. The deductive system we use is a Clark-like completion augmented with induction. It is called the inductive extension of a logic program. The connections b...

Contracts specifying a procedure’s behavior in terms of pre- and postconditions are essential for scalable software verification, but cannot express any constraints on the events occurring during execution procedure. This necessitates to annotate code with intermediate assertions, preventing full specification abstraction. We propose logic over symbolic traces able specify recursive procedures ...

The aim of this paper is solving the predicate calculus formal system based on 1-level universal AND operator. Firstly, universal logic and propositional calculus formal deductive system (0 1] h UL∈ , are introduced. Secondly, a predicate calculus formal deductive system (0 1] h UL∈ , ∀ based on 1-level universal AND operator is built. Thirdly, the soundness theorem and deduction theorem of sys...

Deep inference deductive systems for classical logic provide exponentially shorter proofs than the sequent calculus systems, however with the cost of higher nondeterminism and larger search space in proof search. We report on our ongoing work on proof search with deep inference deductive systems. We present systems for classical logic where nondeterminism in proof search is reduced by constrain...

As security policies get larger and more complex, analysis tools that help users understand and validate security policies are becoming more important. This paper explores the use of deductive spreadsheets for security policy analysis. Deductive spreadsheets combine the power of deductive rules (for specifying policies and analyses) with the usability of spreadsheets. This approach is introduce...

In the paper, the authors discuss two kinds of consequence operations characterized axiomatically. The first one are consequence operations of the type Cn that, in the intuitive sense, are infallible operations, always leading from accepted (true) sentences of a deductive system to accepted (true) sentences of the deductive system (see Tarski in Monatshefte für Mathematik und Physik 37:361–404,...