10899 search results - page 629 / 2180 » The GP Programming System |
305
click to vote
PLPV
2011
ACM
14 years 10 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
178
click to vote
SEKE
2001
Springer
15 years 11 months ago
2001
Springer
ct 7 Applying finite-state verification techniques to software systems looks attractive because they are capable of detecting very subtle 8 defects in the logic design of these s...
213
click to vote
CSMR
2000
IEEE
15 years 11 months ago
2000
IEEE
An alternative approach to developing reusable components from scratch is to recover them from existing systems. Although numerous techniques have been proposed to recover reusabl...
175
click to vote
FPCA
1987
15 years 10 months ago
1987
: Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Catego...
179
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...