923 search results - page 64 / 185 » Proving the value of formal methods |
147
click to vote
FMCAD
2007
Springer
16 years 8 days ago
2007
Springer
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...
172
click to vote
PRL
2011
15 years 1 months ago
2011
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
167
click to vote
MEMOCODE
2008
IEEE
16 years 15 days ago
2008
IEEE
We present a component-based description language for heterogeneous systems composed of several data flow processing components and a unique eventbased controller. Descriptions a...
165
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
151
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...