3658 search results - page 167 / 732 » The logic of proofs, semantically |
110
Voted
ICLP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this PhD project, we deal with the issue of code duplication in logic programs. In particular semantical duplication or redundancy is generally viewed as a possible se...
120
Voted
CADE
2004
Springer
15 years 6 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
PERVASIVE
2006
Springer
15 years 20 days ago
2006
Springer
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
131
click to vote
CSFW
2012
IEEE
13 years 3 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
125
click to vote
CADE
2004
Springer
16 years 1 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...