Sciweavers

171 search results - page 13 / 35
» Improving Computer Security Using Extended Static Checking
Sort
View
ICALP
2009
Springer
15 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
15 years 3 months ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
CCS
2007
ACM
15 years 3 months ago
The geometry of innocent flesh on the bone: return-into-libc without function calls (on the x86)
sion of an extended abstract published in Proceedings of ACM CCS 2007, ACM Press, 2007. We present new techniques that allow a return-into-libc attack to be mounted on x86 executa...
Hovav Shacham
NPAR
2004
ACM
15 years 2 months ago
Interactive rendering of suggestive contours with temporal coherence
Line drawings can convey shape using remarkably minimal visual content. Suggestive contours, which are lines drawn at certain types of view-dependent surface inflections, were pr...
Douglas DeCarlo, Adam Finkelstein, Szymon Rusinkie...
ICISS
2010
Springer
14 years 7 months ago
Stamp-It: A Method for Enhancing the Universal Verifiability of E2E Voting Systems
Existing proposals for end-to-end independently-verifiable (E2E) voting systems require that voters check the presence of a "receipt" on a secure bulletin board. The tall...
Mridul Nandi, Stefan Popoveniuc, Poorvi L. Vora