4460 search results - page 478 / 892 » Formal methods for interactive systems |
189
click to vote
FMCAD
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
189
click to vote
ISOLA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. This article deals with performance verifications of architecture models of real-time embedded systems. We focus on models verified with the real-time scheduling theory...
241
click to vote
FORTE
2011
14 years 10 months ago
2011
Analyzing Border Gateway Protocol (BGP) instances is a crucial step in the design and implementation of safe BGP systems. Today, the analysis is a manual and tedious process. Resea...
168
click to vote
WWW
2001
ACM
16 years 7 months ago
2001
ACM
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
175
click to vote
TASE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...