Sciweavers

1882 search results - page 129 / 377
» Transformational Programming and Forests
Sort
View
ASM
2003
ASM
15 years 3 months ago
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
Egon Börger, Tommaso Bolognesi
ECOOP
2007
Springer
15 years 1 months ago
Automation of Refactoring and Refactoring Suggestions for TTCN-3 Test Suites. The TRex TTCN-3 Refactoring and Metrics Tool
Refactoring is not only useful for source code of implementations, but as well for test specifications. The open source TRex tool automates the application of refactorings and the ...
Helmut Neukirchen, Benjamin Zeiss
ICSQP
1994
14 years 11 months ago
Using Strongest Postconditions to Improve Software Quality
: The cost of developing and maintaining high quality software remains at a premium. In this paper we introduce a practical approach for enhancement of software quality, based on c...
Si Pan, R. Geoff Dromey
SIGCSE
2010
ACM
121views Education» more  SIGCSE 2010»
15 years 4 months ago
Using strategies for assessment of programming exercises
Programming exercise assessment tools alleviate the task of teachers, and increase consistency of markings. Many programming exercise assessment tools are based on testing. A test...
Alex Gerdes, Johan Jeuring, Bastiaan Heeren
WCFLP
2005
ACM
15 years 3 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal