Sciweavers

624 search results - page 110 / 125
» Reasoning with Expressive Description Logics: Theory and Pra...
Sort
View
HYBRID
2010
Springer
14 years 3 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
POPL
2006
ACM
14 years 9 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands
JCST
2010
189views more  JCST 2010»
13 years 3 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
ELECTRONICMARKETS
2010
124views more  ELECTRONICMARKETS 2010»
13 years 6 months ago
The difficulty of studying inter-organisational IS phenomena on large scales: critical reflections on a research journey
We argue that certain theoretical commitments that underpin much existing Interorganisational Information Systems (IOIS) research at small scales become untenable when IOIS are st...
Kai Reimers, Robert B. Johnston, Stefan Klein
UML
2004
Springer
14 years 1 months ago
SoftContract: Model-Based Design of Error-Checking Code and Property Monitors
This paper discusses a model-based design flow for requirements in distributed embedded software development. Such requirements are specified using a language similar to Linear T...
Luciano Lavagno, Marco Di Natale, Alberto Ferrari,...