Specifications are not (necessarily) executable

Hayes, Ian J.; Jones, Cliff B.

doi:10.1049/sej.1989.0045

Cited by 143 publications

(44 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hoare [10] acknowledges the benefits that such technology would have, but also predicts that computers would never be powerful enough to carry out any interesting computation in this way. Hayes and Jones [9] argue that direct execution of specifications would inevitably lead to a decrease in the expressive power of the specification language. On the other side, Fuchs [8] claims that declarative specifications can be made executable by intuitive (manual) translation to either a functional programming language (such as ML) or a logic programming language (like Prolog).…”

Section: Related Workmentioning

confidence: 99%

Unifying execution of imperative and declarative code

Milićević

Rayside

Yessenov

et al. 2011

Proceedings of the 33rd International Conference on Software Engineering

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

Section: Related Workmentioning

confidence: 99%

Unifying execution of imperative and declarative code

Milićević

Rayside

Yessenov

et al. 2011

Proceedings of the 33rd International Conference on Software Engineering

View full text Add to dashboard Cite

show abstract

“…In general, specification comprehension is analogous to program understanding. But the former is more complicated than program understanding because programs are executable, while specifications are not necessarily to be so [10]. Thus it is desirable for a specification tool to provide means for the users to enhance the understanding of the static properties of a formal model it represents.…”

Section: Model Queryingmentioning

confidence: 99%

SVG Web Environment for Z Specification Language

Sun

Wang

Athauda

et al. 2005

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. This paper presents a web environment for the Z formal specification language using the Scalable Vector Graphics (SVG) technology. The Z Specification Web Editor (ZSWE) is the first prototype of a web based graphical editor for the Z specification language. It not only supports graphical editing and global accessibility for the Z formal specifications, but also provides model comprehension facilities such as schema expansion, specification navigation and model querying. This paper outlines the requirement, design and implementation of the tool and its future improvements.

show abstract

“…In formal methods, the ability to execute abstract models was initially considered counter-productive because the models would become less abstract [13,15], but recently abstract executable models have gained substantial attention and also been applied industrially in many different domains [30]. Specification languages range from design-oriented notations including UML structural diagrams, which are concerned with structural models of architectural deployment, to programming language close specification languages such as JML [6], which are best suited to express functional properties.…”

Section: Introductionmentioning

confidence: 99%

Validating Timed Models of Deployment Components with Parametric Concurrency

Johnsen

Owe

Schlatte

et al. 2011

Formal Verification of Object-Oriented Software

View full text Add to dashboard Cite

Abstract. Software today is often developed for deployment on varying architectures. In order to model and analyze the consequences of such deployment choices at an early stage in software development, it seems desirable to capture aspects of low-level deployment concerns in high-level models. In this paper, we propose an integration of a generic cost model for resource consumption with deployment components in Timed ABS, an abstract behavioral specification language for executable object-oriented models. The actual cost model may be user-defined and specified by means of annotations in the executable Timed ABS model, and can be used to capture specific resource requirements such as processing capacity or memory usage. Architectural variations are specified by resource-restricted deployment scenarios with different capacities. For this purpose, the models have deployment components which are parametric in their assigned resources. The approach is demonstrated on an example of multimedia processing servers with a user-defined cost model for memory usage. We use our simulation tool to analyze deadline misses for given usage and deployment scenarios.

show abstract

Specifications are not (necessarily) executable

Cited by 143 publications

References 4 publications

Unifying execution of imperative and declarative code

Unifying execution of imperative and declarative code

SVG Web Environment for Z Specification Language

Validating Timed Models of Deployment Components with Parametric Concurrency

Contact Info

Product

Resources

About