Specification and verification of data-driven Web applications

Deutsch, Alin; Sui, Liying; Vianu, Victor

doi:10.1016/j.jcss.2006.10.006

Cited by 87 publications

(106 citation statements)

References 29 publications

Supporting

Mentioning

103

Contrasting

Order By: Relevance

“…The computation on a single node of a network is formalized by means of relational transducers [Abiteboul et al 2000;Ameloot et al 2011;Deutsch et al 2009;Deutsch et al 2007;Deutsch et al 2006;Spielmann 2003]. A transducer schema Υ is a tuple Υ in , Υ out , Υ msg , Υ mem , Υ sys of database schemas, called respectively "input", "output", "message", "memory" and "system".…”

Section: Transducersmentioning

confidence: 99%

Relational transducers for declarative networking

Ameloot

Neven

Bussche

2013

J. ACM

View full text Add to dashboard Cite

Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for "eventually consistent" distributed querying, based on relational transducers. A tight link has been conjectured between coordination-freeness of computations, and monotonicity of the queries expressed by such computations. Indeed, we propose a formal definition of coordinationfreeness and confirm that the class of monotone queries is captured by coordination-free transducer networks. Coordination-freeness is a semantic property, but the syntactic class of "oblivious" transducers we define also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.

show abstract

Section: Transducersmentioning

confidence: 99%

Relational transducers for declarative networking

Ameloot

Neven

Bussche

2013

J. ACM

View full text Add to dashboard Cite

show abstract

“…Properties to be verified are specified using extensions of the classical temporal logics LTL, CTL and CTL*, in which propositions are interpreted as existential FO formulas on the tuple artifact and the underlying database. This yields the logics LTL-FO, CTL-FO and CTL*-FO [17,11,20]. It can be shown that regularity of the linear or branching-time service views for a class of artifact systems, with effectively constructible specifications, implies decidability of LTL-FO, resp.…”

Section: Examplementioning

confidence: 99%

Process-centric views of data-driven business artifacts

Koutsos

Vianu

2017

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

Declarative, data-aware workflow models are becoming increasingly pervasive. While these have numerous benefits, classical process-centric specifications retain certain advantages. Workflow designers are used to development tools such as BPMN or UML diagrams, that focus on control flow. Views describing valid sequences of tasks are also useful to provide stake-holders with highlevel descriptions of the workflow, stripped of the accompanying data. In this paper we study the problem of recovering process-centric views from declarative, data-aware workflow specifications in a variant of IBM's business artifact model. We focus on the simplest and most natural processcentric views, specified by finite-state transition systems, and describing regular languages. The results characterize when process-centric views of artifact systems are regular, using both linear and branching-time semantics. We also study the impact of data dependencies on regularity of the views.

show abstract

“…Deutsch, Sui and Vianu in [18] introduced an approach that models data-driven web applications. This approach used Abstract State Machine to model the transitions between pages, determined by the input provided to the application.…”

Section: Related Workmentioning

confidence: 99%

Model Driven Testing of Web Applications Using Domain Specific Language

Nguyen¹

2015

ijacsa

View full text Add to dashboard Cite

Abstract-As more and more systems move to the cloud, the importance of web applications has increased recently. Web applications need more strict requirements in order to sup-port higher availability. The techniques in quality assurance of these applications hence become essential, the role of testing for web application becomes more significant. Model-driven testing is a promising paradigm for the automation of software testing. In the web domain, the challenge however remains in the creation of models and the complexity of configuring, launching, and testing big number of valid configuration and testing cases. This paper proposes a solution towards this challenge with an approach using Domain Specific Language (DSL) for model driven testing of web application. Our techniques are based on building abstractions of web pages using domain specific language. We introduce WTML -a domain specific language for modeling web pages and provide automatic code generation with a web-testing framework. This methodology and techniques aim at helping software developers as well as testers to become more productive and reduce the time-to-market, while maintaining high standards of web application quality.

show abstract

Specification and verification of data-driven Web applications

Cited by 87 publications

References 29 publications

Relational transducers for declarative networking

Relational transducers for declarative networking

Process-centric views of data-driven business artifacts

Model Driven Testing of Web Applications Using Domain Specific Language

Contact Info

Product

Resources

About