9626 search results - page 424 / 1926 » Invariant Based Programming |
170
click to vote
GPEM
2006
15 years 6 months ago
2006
A novel method for solving ordinary and partial differential equations, based on grammatical evolution is presented. The method forms generations of trial solutions expressed in an...
147
click to vote
ENTCS
2002
15 years 6 months ago
2002
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
179
click to vote
FLOPS
2010
Springer
15 years 5 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
207
click to vote
ITICSE
2005
ACM
16 years 10 days ago
2005
ACM
concepts more concrete. The method has two main learning outcomes: • Language Specification – The goal of the assignment is to be able to build LEGO® creations on a standard g...
181
click to vote
ERLANG
2008
ACM
15 years 8 months ago
2008
ACM
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...