4257 search results - page 66 / 852 » The Logical Modularity of Programs |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
109
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
CEE
2007
14 years 12 months ago
2007
We present a compact FPGA implementation of a modular exponentiation accelerator suited for cryptographic applications. The implementation efficiently exploits the properties of m...
OOPSLA
2010
Springer
14 years 10 months ago
2010
Springer
General purpose object-oriented programs typically aren’t embarrassingly parallel. For these applications, finding enough concurrency remains a challenge in program design. To ...
APSEC
2003
IEEE
15 years 3 months ago
2003
IEEE
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...