Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: decision procedures

Sortuj według:

Ogranicz wyniki do:

Tableaux approach for contact logics interpreted over intervals

Özdemir Zafer

Reports on Mathematical Logic

2023

Vol. 58

3--13

Contact logics are modal logic that is developed for reasoning about region-based theories of space. We develope a tableaux approach for contact logics interpreted over intervals (CLIOI) on the reals. For obtaining sound and complete tableaux-based decision procedures, the main technical tool is the semantic tableaux approach. We use intensively the following concepts: tableaux methods, termination of tableaux methods, saturated tableaux, termination theorem, soundness theorem, truth lemma, and completeness theorem.

Refutations in wansing's logic

Skura T.

Reports on Mathematical Logic

2017

Vol. 52

83--99

A refutation system for Wansing's logicW(which is an expansion of Nelson's logic) is given. The refutation system provides an ecient decision procedure for W. The procedure consists in constructing for any normal form afinite syntactic tree with the property that the origin is non-valid iff some end node is non-valid. The finite model property is also established.

Is it possible to decide whether a cryptographic protocol is secure or not?

Comon H., Shmatikov V.

Journal of Telecommunications and Information Technology

2002

nr 4

5-15

We consider the so called "cryptographic protocols" whose aim is to ensure some security properties when communication channels are not reliable. Such protocols usually rely on cryptographic primitives. Even if it is assumed that the cryptographic primitives are perfect, the security goals may not be achieved: the protocol itself may have weaknesses which can be exploited by an attacker. We survey recent work on decision techniques for the cryptographic protocol analysis.