Agile specifications

Rayside, Derek; Milićević, Aleksandar; Yessenov, Kuat; Dennis, Greg; Jackson, Daniel

doi:10.1145/1639950.1640070

Cited by 17 publications

(17 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The actual use of different testing practices and the combination of those in the software industry needs further observation. Modern agile development processes and traditional processes are often perceived as being opposed [7]. Traditional approaches tend to emphasize specifications and verification.…”

Section: Introductionmentioning

confidence: 99%

The Focus on Usability in Testing Practices in Industry

Lárusdóttir

Bjarnadottir

Gulliksen

2010

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract.A study exploring the focus on usability in testing practices in software development teams in Iceland using the agile software process Scrum is described in this paper. A survey was conducted to describe how testing is conducted and to what extent testing techniques are used. The results show that unit, integration, system and acceptance testing are the most frequent testing techniques used, but usability testing is not that common. Neither are alpha, beta, performance/load and security testing. Interviews were conducted to exemplify how practitioners conduct usability testing and what they describe as the difference of usability and acceptance testing. Some examples from the interviews show that practitioners are willing to do formal usability testing on extensive parts of the system, but because the iterations in Scrum are short and the changes to the system in each iteration are small, formal usability testing does not fit into the project work.

show abstract

Section: Introductionmentioning

confidence: 99%

The Focus on Usability in Testing Practices in Industry

Lárusdóttir

Bjarnadottir

Gulliksen

2010

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

show abstract

“…The expressive power of JFSL makes it easy to succinctly write complex relational properties in terms of a program's data structures and reachable objects on the heap. As we shall show, in some cases, this form of execution is competitive with handwritten imperative code; in others, it is not, but there are still contexts in which it makes sense to trade performance for other benefits [17].…”

Section: Introductionmentioning

confidence: 88%

“…In this section we demonstrate how our framework is efficient enough to be used -at least in some cases -as a primary implementation mechanism, where, in contrast, previous uses of solving during execution have focused on specialized applications (such as redundant computation as a fallback [18], or for exploring behavior in the early stages of the development process [17]). …”

Section: Examples and Evaluationmentioning

confidence: 99%

“…In our previous paper [17], we suggested how executing specifications might play a useful role in an agile development process [3] (for fast prototyping, test input generation, creation of mock objects directly from interfaces, etc. ), generalizing an idea that originally appeared in TestEra [13] in which test cases generated by solving a representation invariant were concretized into heap structures.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Unifying execution of imperative and declarative code

Milićević

Rayside

Yessenov

et al. 2011

Proceedings of the 33rd International Conference on Software Engineering

Self Cite

View full text Add to dashboard Cite

We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, written in first-order relational logic with transitive closure, and the imperative language is Java. By being able to mix imperative code with executable declarative specifications, the user can easily express constraint problems in place, i.e., in terms of the existing data structures and objects on the heap. After a solution is found, the heap is updated to reflect the solution, so the user can continue to manipulate the program heap in the usual imperative way. We show that this approach is not only convenient, but, for certain problems can also outperform a standard imperative implementation. We also present an optimization technique that allowed us to run our tool on heaps with almost 2000 objects.

show abstract

“…Jeeves differs from existing work in executing specifications [16,21] in our goal of propagating nondeterminism alongside the core program rather than executing isolated nondeterministic sub-procedures. Program repair approaches such as Demsky's data structure repair [6], the Plan B [22] system for dynamic contract checking, and Kuncak et al's synthesis approach [13] also target local program expressions.…”

Section: Related Workmentioning

confidence: 99%

A language for automatically enforcing privacy policies

Yang

Yessenov

Solar-Lezama

2012

Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Self Cite

View full text Add to dashboard Cite

It is becoming increasingly important for applications to protect sensitive data. With current techniques, the programmer bears the burden of ensuring that the application's behavior adheres to policies about where sensitive values may flow. Unfortunately, privacy policies are difficult to manage because their global nature requires coordinated reasoning and enforcement. To address this problem, we describe a programming model that makes the system responsible for ensuring adherence to privacy policies. The programming model has two components: 1) core programs describing functionality independent of privacy concerns and 2) declarative, decentralized policies controlling how sensitive values are disclosed. Each sensitive value encapsulates multiple views; policies describe which views are allowed based on the output context. The system is responsible for automatically ensuring that outputs are consistent with the policies. We have implemented this programming model in a new functional constraint language named Jeeves. In Jeeves, sensitive values are introduced as symbolic variables and policies correspond to constraints that are resolved at output channels. We have implemented Jeeves as a Scala library using an SMT solver as a model finder. In this paper we describe the dynamic and static semantics of Jeeves and the properties about policy enforcement that the semantics guarantees. We also describe our experience implementing a conference management system and a social network.

show abstract

Agile specifications

Cited by 17 publications

References 31 publications

The Focus on Usability in Testing Practices in Industry

The Focus on Usability in Testing Practices in Industry

Unifying execution of imperative and declarative code

A language for automatically enforcing privacy policies

Contact Info

Product

Resources

About