911 search results - page 108 / 183 » Combining programs and state machines |
ISSTA
2004
ACM
14 years 2 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...
ICFP
2007
ACM
14 years 19 days 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...
IFM
2004
Springer
14 years 2 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...
IRI
2008
IEEE
14 years 3 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...
ISOLA
2007
Springer
14 years 2 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...