1111 search results - page 93 / 223 » Program Analysis as Model Checking of Abstract Interpretatio... |
142
click to vote
FMCAD
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
129
Voted
FMCAD
2009
Springer
15 years 10 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
140
Voted
LCPC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Partitioned Global Address Space (PGAS) languages offer an attractive, high-productivity programming model for programming large-scale parallel machines. PGAS languages, ...
FMSD
2006
15 years 3 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
153
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...