Sciweavers

5 search results - page 1 / 1
» Two Attempts to Formalize Counterpossible Reasoning in Deter...
Sort
View
ECSQARU
2009
Springer
13 years 11 months ago
Supporting Fuzzy Rough Sets in Fuzzy Description Logics
Abstract. Classical Description Logics (DLs) are not suitable to represent vague pieces of information. The attempts to achieve a solution have lead to the birth of fuzzy DLs and r...
Fernando Bobillo, Umberto Straccia
TIP
2010
176views more  TIP 2010»
12 years 11 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
IFIP
2010
Springer
12 years 11 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
LICS
1999
IEEE
13 years 8 months ago
Proving Security Protocols Correct
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
Lawrence C. Paulson
ISSTA
2012
ACM
11 years 7 months ago
ViewPoints: differential string analysis for discovering client- and server-side input validation inconsistencies
Since web applications are easily accessible, and often store a large amount of sensitive user information, they are a common target for attackers. In particular, attacks that foc...
Muath Alkhalaf, Shauvik Roy Choudhary, Mattia Fazz...