Sciweavers

3552 search results - page 323 / 711
» Proof theory in the abstract
Sort
View
PLILP
1993
Springer
15 years 10 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
JUCS
2000
76views more  JUCS 2000»
15 years 6 months ago
Mixed Relations as Enriched Semiringal Categories
Abstract: A study of the classes of nite relations as enriched strict monoidal categories is presented in CaS91]. The relations there are interpreted as connections in owchart sche...
Radu Grosu, Dorel Lucanu, Gheorghe Stefanescu
KBSE
2005
IEEE
16 years 9 days ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
CSFW
2009
IEEE
15 years 10 months ago
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
Ralf Küsters, Tomasz Truderung
JCT
1998
193views more  JCT 1998»
15 years 6 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman