2878 search results - page 289 / 576 » Model Checking FTA |
154
click to vote
IPPS
2005
IEEE
16 years 5 days ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
155
click to vote
APSEC
2007
IEEE
15 years 10 months ago
2007
IEEE
One major advantage of executable models is that once constructed, they can be run, checked, validated and improved in short incremental and iterative cycles. In the field of Soft...
181
click to vote
SPIN
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
188
click to vote
ISSTA
2004
ACM
16 years 23 hour ago
2004
ACM
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
192
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
e Abstraction of Programs With Non-linear Computation Songtao Xia1 Ben Di Vito2 Cesar Munoz3 1 NASA Postdoc at NASA Langley Research Center, Hampton, VA 2 NASA Langley Research Cen...