462 search results - page 29 / 93 » Symbolic Bounded Synthesis |
140
click to vote
ASPDAC
2005
ACM
15 years 11 months ago
2005
ACM
- Many high-level description languages, such as C/C++ or Java, lack the capability to specify the bitwidth information for variables and operations. Synthesis from these specifica...
170
click to vote
CONCUR
2001
Springer
15 years 10 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
167
click to vote
EUROSYS
2011
ACM
14 years 9 months ago
2011
ACM
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
178
click to vote
FM
2009
Springer
16 years 11 days ago
2009
Springer
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
228
Voted
FOSAD
2009
Springer
16 years 11 days ago
2009
Springer
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...