Sciweavers

488 search results - page 3 / 98
» Compositional Verification of Probabilistic Systems Using Le...
Sort
View
FMSD
2008
110views more  FMSD 2008»
13 years 6 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
SIGSOFT
2009
ACM
14 years 7 months ago
Probabilistic environments in the quantitative analysis of (non-probabilistic) behaviour models
System specifications have long been expressed through automata-based languages, enabling verification techniques such as model checking. These verification techniques can assess ...
Esteban Pavese, Sebastián Uchitel, Ví...
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
13 years 10 months ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...
TOPLAS
1998
55views more  TOPLAS 1998»
13 years 5 months ago
Compositional Verification of Concurrent Systems Using Petri-Net-Based Condensation Rules
Eric Y. T. Juan, Jeffrey J. P. Tsai, Tadao Murata
CSAC
2006
13 years 7 months ago
Toward a Pi-Calculus Based Verification Tool for Web Services Orchestrations
Abstract. Web services constitute a dynamic field of research about technologies of the Internet. WS-BPEL 2.0, is in the way for becoming a standard for defining Web services orche...
Faisal Abouzaid