Sciweavers

45 search results - page 4 / 9
» Finding Witnesses by Peeling
Sort
View
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 10 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
IFIP
2010
Springer
13 years 4 months ago
Information Flow Analysis via Path Condition Refinement
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
Mana Taghdiri, Gregor Snelting, Carsten Sinz
HICSS
2006
IEEE
94views Biometrics» more  HICSS 2006»
14 years 3 months ago
Reporting On-Campus Crime Online: User Intention to Use
National surveys demonstrate that millions of crimes go unreported in the United States. Several reasons may contribute to this lack of reporting and we are investigating these po...
Alicia Iriberri, Gondy Leroy, Nathan Garrett
FMCAD
2008
Springer
13 years 11 months ago
Automatic Generation of Local Repairs for Boolean Programs
Automatic techniques for software verification focus on obtaining witnesses of program failure. Such counterexamples often fail to localize the precise cause of an error and usuall...
Roopsha Samanta, Jyotirmoy V. Deshmukh, E. Allen E...
CORR
2000
Springer
112views Education» more  CORR 2000»
13 years 9 months ago
Evolution of differentiated expression patterns in digital organisms
Abstract. We investigate the evolutionary processes behind the development and optimization of multiple threads of execution in digital organisms using the avida platform, a softwa...
Charles Ofria, Christoph Adami, Travis C. Collier,...