601 search results - page 112 / 121 » Model Checking CTL Properties of Pushdown Systems |
125
click to vote
FSEN
2007
Springer
15 years 9 months ago
2007
Springer
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...
120
click to vote
WWW
2005
ACM
16 years 4 months ago
2005
ACM
We present a design for verification approach to developing reliable web services. We focus on composite web services which consist of asynchronously communicating peers. Our goal...
250
click to vote
POPL
2005
ACM
16 years 3 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
120
Voted
ISSTA
2009
ACM
15 years 10 months ago
2009
ACM
This paper presents techniques for analyzing channel contract specifications in Microsoft Research’s Singularity operating system. A channel contract is a state machine that sp...
150
click to vote
NGITS
1999
Springer
15 years 7 months ago
1999
Springer
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...