150 search results - page 28 / 30 » Symbolic Model Checking for Simply-Timed Systems |
110
Voted
POPL
2011
ACM
14 years 8 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
164
click to vote
POPL
2005
ACM
15 years 9 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
ESOP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
CAV
2004
Springer
15 years 2 months ago
2004
Springer
SAL 2 augments the specification language and explicit-state model checker of SAL 1 with high-performance symbolic and bounded model checkers, and with novel infinite bounded and...
ICDCS
2007
IEEE
15 years 3 months ago
2007
IEEE
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...