Sciweavers

1063 search results - page 30 / 213
» Programming Methodologies in GCLA
Sort
View
ATAL
2004
Springer
14 years 29 days ago
The Insufficiency of Formal Design Methods - The Necessity of an Experimental Approach - for the Understanding and Control of Co
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
Bruce Edmonds, Joanna Bryson
VL
2007
IEEE
132views Visual Languages» more  VL 2007»
14 years 1 months ago
A Study on Applying Roles of Variables in Introductory Programming
Expert programmers possess programming knowledge, which is language independent and abstract. Still, programming is mostly taught only via constructs of a programming language and...
Pauli Byckling, Jorma Sajaniemi
ECAI
2000
Springer
13 years 12 months ago
Logic Programs with Compiled Preferences
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
James P. Delgrande, Torsten Schaub, Hans Tompits
ESOP
2006
Springer
13 years 11 months ago
A Verification Methodology for Model Fields
Model fields are specification-only fields that encode abstractions of the concrete state of a data structure. They allow specifications to describe the behavior of object-oriented...
K. Rustan M. Leino, Peter Müller
MPC
1998
Springer
100views Mathematics» more  MPC 1998»
13 years 11 months ago
An Application of Program Derivation Techniques to 18th-Century Mathematics
Program derivation methodology is applied to reconstruct Euler's proof that every prime congruent to 1 modulo 4 is the sum of two squares.
A. Bijlsma