381 search results - page 32 / 77 » Model Checking Is Static Analysis of Modal Logic |
145
click to vote
LOGCOM
2008
15 years 3 months ago
2008
The Sum-and-Product riddle was first published in [Fre69]. We provide an overview on the history of the dissemination of this riddle through the academic and puzzle-math community...
110
Voted
SIGSOFT
2003
ACM
15 years 9 months ago
2003
ACM
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially di...
159
Voted
IGPL
2006
15 years 3 months ago
2006
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
125
Voted
FMSD
2006
15 years 3 months ago
2006
A Promela specification and a set of temporal properties are developed for a basic call service with a number of features. The properties are expressed in the logic LTL. Interactio...
164
Voted
ICST
2009
IEEE
15 years 1 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...