2875 search results - page 389 / 575 » Model checking agentspeak |
240
click to vote
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
137
click to vote
TOOLS
2009
IEEE
15 years 9 months ago
2009
IEEE
A software product line (SPL) is a family of related program variants in a well-defined domain, generated from a set of features. A fundamental difference from classical applicati...
103
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
119
click to vote
KBSE
2008
IEEE
15 years 9 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...
131
click to vote
DBPL
2007
Springer
15 years 9 months ago
2007
Springer
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...