Test-Suite Prioritisation by Application Navigation Tree Mining

2016 ◽  
Author(s):  
Muhammad Muzammal
Keyword(s):  
Test Suite ◽  
Tree Mining

Determining the coverage of a test suite

1991 ◽  
Vol IV (4) ◽  
pp. 33-43
Author(s):  
Richard C. Waters
Keyword(s):  
Test Suite

scholarly journals A Computational Treatment of Anaphora and Its Algorithmic Implementation

2020 ◽  
Author(s):  
Jean-Philippe Bernardy ◽  
Stergios Chatzikyriakidis ◽  
Aleksandre Maskharashvili
Keyword(s):  
Dynamic Semantics ◽  
Test Suite ◽  
Abstract Syntax ◽  
Computational Approaches ◽  
Complex Cases

AbstractIn this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects using a monad structure. Second we treat scopes flexibly, extending them as needed. We additionally implement this framework as an algorithm which translates abstract syntax to logical formulas. We argue that this framework can provide a unified account of a large number of anaphoric phenomena. Specifically, we show its effectiveness in dealing with pronominal and VP-anaphora, strict and lazy pronouns, lazy identity, bound variable anaphora, e-type pronouns, and cataphora. This means that in particular we can handle complex cases like Bach–Peters sentences, which require an account dealing simultaneously with several phenomena. We use Haskell as a meta-language to present the theory, which also consitutes an implementation of all the phenomena discussed in the paper. To demonstrate coverage, we propose a test suite that can be used to evaluate computational approaches to anaphora.

Sign in / Sign up

Export Citation Format

Share Document