923 search results - page 85 / 185 » Proving the value of formal methods |
170
click to vote
CAV
2005
Springer
15 years 11 months ago
2005
Springer
Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer “stack-qualified queries”, which answer the question “what data...
149
click to vote
CAV
2004
Springer
15 years 11 months ago
2004
Springer
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
173
click to vote
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
160
click to vote
FMCAD
2007
Springer
16 years 10 days ago
2007
Springer
Time-triggered systems are distributed systems in which the nodes are independently-clocked but maintain synchrony with one another. Time-triggered protocols depend on the synchro...
150
click to vote
IMA
2005
Springer
15 years 11 months ago
2005
Springer
In recent years much research has been devoted to producing formal models of security for cryptographic primitives and to designing schemes that can be proved secure in such models...