481 search results - page 53 / 97 » Model Checking Abstract State Machines and Beyond |
144
click to vote
SIGSOFT
2006
ACM
16 years 5 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
131
click to vote
ATVA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
149
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
130
click to vote
KBSE
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—We describe BPELCheck, a tool for statically analyzing interactions of composite web services implemented in BPEL. Our algorithm is compositional, and checks each proces...
137
click to vote
SIGOPSE
1998
ACM
15 years 8 months ago
1998
ACM
Modern virtual machines, such as Java and Inferno, are emerging as network computing s. While these virtual machines provide higher-level abstractions and more sophisticated servi...