Sciweavers

103 search results - page 17 / 21
» Approximate Symbolic Model Checking for Incomplete Designs
Sort
View
DAC
2000
ACM
14 years 8 months ago
To split or to conjoin: the question in image computation
Image computation is the key step in fixpoint computations that are extensively used in model checking. Two techniques have been used for this step: one based on conjunction of the...
In-Ho Moon, James H. Kukula, Kavita Ravi, Fabio So...
POPL
2010
ACM
13 years 10 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...
DAC
1998
ACM
13 years 11 months ago
OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
NIPS
2000
13 years 9 months ago
Processing of Time Series by Neural Circuits with Biologically Realistic Synaptic Dynamics
Experimental data show that biological synapses behave quite differently from the symbolic synapses in common artificial neural network models. Biological synapses are dynamic, i....
Thomas Natschläger, Wolfgang Maass, Eduardo D...
FTCS
1998
114views more  FTCS 1998»
13 years 9 months ago
Verification of a Safety-Critical Railway Interlocking System with Real-Time Constraints
Ensuring the correctness of computer systems used in lifecritical applications is very difficult. The most commonly used verification methods, simulation and testing, are not exha...
Vicky Hartonas-Garmhausen, Sérgio Vale Agui...