Sciweavers

1382 search results - page 94 / 277
» Formal Analysis of Online Algorithms
Sort
View
CL
2007
Springer
15 years 6 months ago
A bulk-synchronous parallel process algebra
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
Armelle Merlin, Gaétan Hains
ICSE
2008
IEEE-ACM
16 years 6 months ago
Static detection of cross-site scripting vulnerabilities
Web applications support many of our daily activities, but they often have security problems, and their accessibility makes them easy to exploit. In cross-site scripting (XSS), an...
Gary Wassermann, Zhendong Su
CHARME
2005
Springer
176views Hardware» more  CHARME 2005»
15 years 11 months ago
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P...
CSE
2009
IEEE
16 years 24 days ago
Web Science 2.0: Identifying Trends through Semantic Social Network Analysis
—We introduce a novel set of social network analysis based algorithms for mining the Web, blogs, and online forums to identify trends and find the people launching these new tren...
Peter A. Gloor, Jonas Krauss, Stefan Nann, Kai Fis...
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 9 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli