Sciweavers

381 search results - page 60 / 77
» Model Checking Is Static Analysis of Modal Logic
Sort
View
ICFP
2004
ACM
15 years 11 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
RV
2010
Springer
220views Hardware» more  RV 2010»
14 years 9 months ago
Runtime Verification with the RV System
The RV system is the first system to merge the benefits of Runtime Monitoring with Predictive Analysis. The Runtime Monitoring portion of RV is based on the successful Monitoring O...
Patrick O'Neil Meredith, Grigore Rosu
POPL
2011
ACM
14 years 2 months ago
Making prophecies with decision predicates
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...
Byron Cook, Eric Koskinen
ISSTA
2006
ACM
15 years 5 months ago
The case for analysis preserving language transformation
Static analysis has gained much attention over the past few years in applications such as bug finding and program verification. As software becomes more complex and componentize...
Xiaolan Zhang, Larry Koved, Marco Pistoia, Sam Web...
ISSTA
2000
ACM
15 years 4 months ago
Finding bugs with a constraint solver
A method for finding bugs in code is presented. For given small numbers j and k, the code of a procedure is translated into a relational formula whose models represent all executi...
Daniel Jackson, Mandana Vaziri