1716 search results - page 65 / 344 » Proving Conditional Termination |
CSFW
1999
IEEE
14 years 1 months ago
1999
IEEE
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...
IPL
2006
13 years 8 months ago
2006
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...
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
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...
PODS
1999
ACM
14 years 1 months ago
1999
ACM
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...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....