1127 search results - page 104 / 226 » Theory Extension in ACL2(r) |
184
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
183
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
139
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
165
click to vote
PEPM
2010
ACM
16 years 3 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
170
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...