122 search results - page 17 / 25 » Computing Properties of Numerical Imperative Programs by Sym... |
100
click to vote
LPKR
1997
Springer
15 years 3 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
117
Voted
ESOP
2005
Springer
15 years 5 months ago
2005
Springer
The notion of control dependence underlies many program analysis and transformation techniques used in numerous applications. Despite wide application, existing definitions and ap...
120
click to vote
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
100
Voted
ACNS
2005
Springer
15 years 5 months ago
2005
Springer
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...