1463 search results - page 187 / 293 » Model Checking Implicit-Invocation Systems |
120
click to vote
BIRTHDAY
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
119
click to vote
AC
2000
Springer
15 years 1 months ago
2000
Springer
nvented abstract representations of value. As time passed, representations of value became more abstract, progressing from barter through bank notes, payment orders, checks, credit...
117
click to vote
CAV
2004
Springer
15 years 6 months ago
2004
Springer
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
134
click to vote
DAC
1996
ACM
15 years 5 months ago
1996
ACM
We present a formal verification methodology that we have used on a computer system design project. The methodology integrates a temporal logic model checker with a conventional pr...
104
click to vote
QEST
2007
IEEE
15 years 7 months ago
2007
IEEE
—Performance Trees are a recently-proposed mechanism for the specification of performance properties and measures. They represent an attractive alternative to stochastic logics,...