6167 search results - page 144 / 1234 » Can Refinement be Automated |
142
click to vote
ECWEB
2000
Springer
15 years 8 months ago
2000
Springer
In this paper we propose an e-commerce protocol with the following features: (1) ensures true fair exchange, (2) does not require manual dispute resolution in case of unfair behavi...
135
click to vote
AUSAI
1998
Springer
15 years 8 months ago
1998
Springer
We present the rst implementation of a theorem prover which runs on a smart card. The prover is written in Java and implements a dual tableau calculus.1 Due to the limited resource...
145
click to vote
AIPS
2006
15 years 5 months ago
2006
Composition of stateful web services expressed in BPEL4WS can be recasted as a problem of planning in asynchronous domains. In (PTB05), this is pursued by encoding the asynchronou...
137
click to vote
AAAI
1990
15 years 5 months ago
1990
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...
140
click to vote
TCAD
2008
15 years 4 months ago
2008
The quality and the correctness of software is often the greatest concern in electronic systems. Formal verification tools can provide a guarantee that a design is free of specific...