On the aggregation problem for synthesized web services

DOI10.1016/j.jcss.2013.01.007zbMath1408.68029OpenAlexW2165210114WikidataQ57495363 ScholiaQ57495363MaRDI QIDQ389232

Ting Deng, Wenfei Fan, Yinghui Wu, Leonid O. Libkin

Publication date: 20 January 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.01.007

zbMATH Keywords

static analysissynthesis problemtransducersweb servicesartifacts

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Internet topics (68M11)

Related Items (1)

On the aggregation problem for synthesized web services

Uses Software

• WSAT

Cites Work

• On the aggregation problem for synthesized web services
• Conversation protocols: a formalism for specification and verification of reactive electronic services
• Specification and verification of data-driven Web applications
• Verification of relational transducers for electronic commerce
• Relational transducers for electronic commerce
• A probabilistic approach to modeling and estimating the QoS of web-services-based workflows
• Synthesis from Component Libraries
• Undecidable diophantine equations
• A Lower Bound on Web Services Composition
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the aggregation problem for synthesized web services