Sciweavers

2873 search results - page 277 / 575
» Model Checking and the Mu-calculus
Sort
View
LOGCOM
2010
96views more  LOGCOM 2010»
15 years 2 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
PLDI
2011
ACM
14 years 7 months ago
A case for an SC-preserving compiler
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
RTCSA
1999
IEEE
15 years 8 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
RTAS
2006
IEEE
15 years 10 months ago
Scalable Modeling and Performance Evaluation of Wireless Sensor Networks
A notable features of many proposed Wireless Sensor Networks (WSNs) deployments is their scale: hundreds to thousands of nodes linked together. In such systems, modeling the state...
YoungMin Kwon, Gul Agha
BMCBI
2010
104views more  BMCBI 2010»
15 years 4 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ò...