595 search results - page 81 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
131
Voted
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
129
click to vote
JNSM
2008
15 years 3 months ago
2008
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
ECRTS
1999
IEEE
15 years 7 months ago
1999
IEEE
Scheduling time impact on system performance increases especially when using dynamic priority algorithms, because of the enlarged computational effort at runtime. This overhead ca...
115
click to vote
ESOP
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
126
click to vote
ISCC
2005
IEEE
15 years 8 months ago
2005
IEEE
—A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optim...