691 search results - page 52 / 139 » Automatically Proving Linearizability |
TACAS
2010
Springer
14 years 4 months ago
2010
Springer
STRANGER is an automata-based string analysis tool for finding and eliminating string-related security vulnerabilities in PHP applications. STRANGER uses symbolic forward and back...
TABLEAUX
2009
Springer
14 years 4 months ago
2009
Springer
We are interested in automatically proving safety properties of infinite state systems. We present a technique for invariant synthesis which can be incorporated in backward reacha...
TPHOL
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
SOFSEM
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
SSS
2005
Springer
14 years 3 months ago
2005
Springer
Dijkstra’s concept of self-stabilization assumes that faults can only affect the variables of a program. We study the notion of selfstabilization if faults can also affect (i.e...