911 search results - page 108 / 183 » Combining programs and state machines |
130
Voted
ISSTA
2004
ACM
15 years 9 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
128
Voted
ICFP
2007
ACM
15 years 7 months ago
2007
ACM
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
110
Voted
IFM
2004
Springer
15 years 9 months ago
2004
Springer
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
112
Voted
IRI
2008
IEEE
15 years 10 months ago
2008
IEEE
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
126
Voted
ISOLA
2007
Springer
15 years 9 months ago
2007
Springer
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...