1882 search results - page 201 / 377 » Transformational Programming and Forests |
170
click to vote
SIGSOFT
2003
ACM
15 years 10 months ago
2003
ACM
1 Step-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number...
157
click to vote
PROVSEC
2007
Springer
15 years 11 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
164
click to vote
MOMPES
2006
IEEE
15 years 11 months ago
2006
IEEE
In this era of intense liking to automation in almost all time-critical fields, real-time systems have got widespread utilization in industrial, commercial, medical, space and mil...
168
click to vote
HASKELL
2006
ACM
15 years 11 months ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
150
click to vote
LOPSTR
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...