3552 search results - page 628 / 711 » Proof theory in the abstract |
136
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
160
click to vote
ICCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for da...
148
click to vote
ITRUST
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This research aims to develop a model of trust and reputation that will ensure good interactions amongst software agents in large scale open systems in particular. The fo...
142
click to vote
IWINAC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Due to the lot of different Genetic Algorithm variants, encodings, and attacked problems, very little general theory is available to explain the internal functioning of ...
174
click to vote
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
15 years 12 months ago
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....