3546 search results - page 442 / 710 » A Causal Logic of Logic Programming |
125
click to vote
SPIN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In the classic approach to logic model checking, software verification requires a manually constructed artifact (the model) to be written in the language that is accepted...
119
click to vote
TCC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
115
click to vote
BIRTHDAY
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
110
click to vote
ITC
1999
IEEE
15 years 5 months ago
1999
IEEE
A new synthesis technique for designing finite state machines with on-line parity checking is presented. The output logic and the next-state logic of the finite state machines are...
150
click to vote
FLOPS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...