Sciweavers

437 search results - page 39 / 88
» Proving Termination by Divergence
Sort
View
CSFW
1999
IEEE
15 years 10 months ago
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
David Monniaux
FAC
2006
79views more  FAC 2006»
15 years 6 months ago
A formal relationship between program slicing and partial evaluation
A formal relationship between program slicing and partial evaluation is established. It is proved that for terminating programs, a residual program produced by partial evaluation i...
David Binkley, Sebastian Danicic, Mark Harman, Joh...
IPL
2006
109views more  IPL 2006»
15 years 6 months ago
Knuth-Bendix completion of theories of commuting group endomorphisms
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
Aaron Stump, Bernd Löchner
MFCS
2010
Springer
15 years 4 months ago
Semi-linear Parikh Images of Regular Expressions via Reduction
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...
Bahareh Badban, Mohammad Torabi Dashti
PODS
1999
ACM
153views Database» more  PODS 1999»
15 years 10 months ago
Consistent Query Answers in Inconsistent Databases
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. Thi...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki