Sciweavers

783 search results - page 23 / 157
» Compositional Reasoning in Model Checking
Sort
View
ER
2004
Springer
90views Database» more  ER 2004»
14 years 1 months ago
Semantic Interpretation and Matching of Web Services
A major issue in the study of semantic Web services concerns the matching problem of Web services. Various techniques for this problem have been proposed. Typical ones include FSM ...
Chang Xu, Shing-Chi Cheung, Xiangye Xiao
TIME
2009
IEEE
14 years 2 months ago
Model Checking CTL is Almost Always Inherently Sequential
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
FAC
2008
117views more  FAC 2008»
13 years 7 months ago
Model checking Duration Calculus: a practical approach
Abstract. Model checking of real-time systems against Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. The existing algo...
Roland Meyer, Johannes Faber, Jochen Hoenicke, And...
QEST
2006
IEEE
14 years 1 months ago
Compositional Performability Evaluation for STATEMATE
Abstract— This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed...
Eckard Böde, Marc Herbstritt, Holger Hermanns...
ENTCS
2010
130views more  ENTCS 2010»
13 years 7 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...