English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

An important problem that arises during the execution of service-basedapplications concerns the ability to determine whether a running service can besubstituted with one with a different interface, for example if the former isno longer available. Standard Bounded Model Checking techniques can be used toperform this check, but they must be able to provide answers very quickly, lestthe check hampers the operativeness of the application, instead of aiding it.The problem becomes even more complex when conversational services areconsidered, i.e., services that expose operations that have Input/Output datadependencies among them. In this paper we introduce a formal verificationtechnique for an extension of Linear Temporal Logic that allows users toinclude in formulae constraints on integer variables. This technique applied tothe substitutability problem for conversational services is shown to beconsiderably faster and with smaller memory footprint than existing ones.

SMT-based Verification of LTL Specifications with Integer Constraints and its Application to Runtime Checking of Service Substitutability