2012
DOI: 10.1007/978-3-642-28525-7_7
|View full text |Cite
|
Sign up to set email alerts
|

A Logical Approach to Data-Aware Automated Sequence Generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 36 publications
0
1
0
Order By: Relevance
“…In an earlier work [2], it was argued that a "universal stub" could be built, driven from a declarative specification of the service to simulate. Given a formula ϕ expressing the service's behaviour in some logical language L, the universal stub produces valid messages simulating the original service by finding a satisfying solution to ϕ.…”
Section: Introductionmentioning
confidence: 99%
“…In an earlier work [2], it was argued that a "universal stub" could be built, driven from a declarative specification of the service to simulate. Given a formula ϕ expressing the service's behaviour in some logical language L, the universal stub produces valid messages simulating the original service by finding a satisfying solution to ϕ.…”
Section: Introductionmentioning
confidence: 99%