Sciweavers

102 search results - page 18 / 21
» Symbolic Model Checking for Probabilistic Processes
Sort
View
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
15 years 6 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
100
Voted
IROS
2007
IEEE
176views Robotics» more  IROS 2007»
15 years 6 months ago
Handling uncertainty in semantic-knowledge based execution monitoring
— Executing plans by mobile robots, in real world environments, faces the challenging issues of uncertainty and environment dynamics. Thus, execution monitoring is needed to veri...
Abdelbaki Bouguerra, Lars Karlsson, Alessandro Saf...
BMCBI
2010
104views more  BMCBI 2010»
14 years 11 months ago
Formal reasoning on qualitative models of coinfection of HIV and Tuberculosis and HAART therapy
Background: Several diseases, many of which nowadays pandemic, consist of multifactorial pathologies. Paradigmatic examples come from the immune response to pathogens, in which ca...
Anil Sorathiya, Andrea Bracciali, Pietro Liò...
IJISEC
2008
119views more  IJISEC 2008»
14 years 11 months ago
Estimating the maximum information leakage
Preventing improper information leaks is a greatest challenge of the modern society. In this paper we present a technique for measuring the ability of several families of adversari...
Alessandro Aldini, Alessandra Di Pierro
CAV
2000
Springer
138views Hardware» more  CAV 2000»
15 years 3 months ago
Counterexample-Guided Abstraction Refinement
xample-Guided Abstraction Refinement for Symbolic Model Checking EDMUND CLARKE YUAN LU Carnegie Mellon University, Pittsburgh, Pennsylvania Broadcom Co., San Jose, California ORNA ...
Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan ...