632 search results - page 90 / 127 » Combining programming with theorem proving |
LICS
2003
IEEE
14 years 1 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
DAGSTUHL
2008
13 years 9 months ago
2008
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
ICWS
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
GG
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...