Sciweavers

838 search results - page 106 / 168
» From Natural Language to Formal Proof Goal
Sort
View
CCS
2005
ACM
15 years 11 months ago
A model and architecture for pseudo-random generation with applications to /dev/random
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
Boaz Barak, Shai Halevi
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 6 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
UML
2000
Springer
15 years 9 months ago
Using UML Collaboration Diagrams for Static Checking and Test Generation
Software testing can only be formalized and quanti ed when a solid basis for test generation can be de ned. Tests are commonly generated from program source code, graphical models ...
Aynur Abdurazik, A. Jefferson Offutt
ESOP
2010
Springer
16 years 3 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
PRICAI
2000
Springer
15 years 9 months ago
Towards a Next-Generation Search Engine
As more information becomes available on the World Wide Web, it has become an acute problem to provide effective search tools for information access. Previous generations of search...
Qiang Yang, Hai-Feng Wang, Ji-Rong Wen, Gao Zhang,...