Sciweavers

963 search results - page 86 / 193
» Formal Analysis of BPMN Models Using Event-B
Sort
View
CLA
2004
15 years 2 months ago
A Semi-automatic Method to Ontology Design by Using FCA
Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-autom...
Hele-Mai Haav
TACAS
2007
Springer
158views Algorithms» more  TACAS 2007»
15 years 7 months ago
Automatic Analysis of the Security of XOR-Based Key Management Schemes
We describe a new algorithm for analysing security protocols that use XOR, such as key-management APIs. As a case study, we consider the IBM 4758 CCA API, which is widely used in t...
Véronique Cortier, Gavin Keighren, Graham S...
SAS
2007
Springer
112views Formal Methods» more  SAS 2007»
15 years 7 months ago
Taming the Wrapping of Integer Arithmetic
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent ...
Axel Simon, Andy King
IGPL
2010
111views more  IGPL 2010»
14 years 12 months ago
A logic of trust and reputation
Reputation and trust are useful instruments in multi-agent systems to evaluate agent behaviour. Most of the works on trust and reputation adopt a quantitative representation of the...
Andreas Herzig, Emiliano Lorini, Jomi Fred Hü...
PODC
2010
ACM
15 years 3 months ago
Brief announcement: revisiting the power-law degree distribution for social graph analysis
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
Alessandra Sala, Haitao Zheng, Ben Y. Zhao, Sabrin...