Sciweavers

1700 search results - page 99 / 340
» Specifying and implementing refactorings
Sort
View
PLDI
2012
ACM
13 years 7 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
123
Voted
IPPS
2006
IEEE
15 years 10 months ago
A case for exploit-robust and attack-aware protocol RFCs
A large number of vulnerabilities occur because protocol implementations failed to anticipate illegal packets. rfcs typically define what constitute “right” packets relevant ...
Venkat Pothamsetty, Prabhaker Mateti
ESAW
2009
Springer
15 years 11 months ago
Normative Multi-Agent Organizations
Multi-agent systems are viewed as consisting of individual agents whose behaviors are regulated by organization artifacts. This abstract presents a programming language, which is d...
Mehdi Dastani
ICIP
2002
IEEE
16 years 6 months ago
JPEG2000-matched MRC compression of compound documents
The Mixed Raster Content (MRC) ITU document compression standard (T.44) specifies a multilayer decomposition model for compound documents into two contone image layers and a binar...
Debargha Mukherjee, Christos Chrysafis, Amir Said
DAC
2003
ACM
16 years 5 months ago
Symbolic representation with ordered function templates
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
Amit Goel, Gagan Hasteer, Randal E. Bryant