Sciweavers

899 search results - page 139 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
LPAR
2000
Springer
15 years 4 months ago
Efficient Structural Information Analysis for Real CLP Languages
We present the rational construction of a generic domain for structural information analysis of real CLP languages called Pattern(D ), where the parameter D is an abstract domain s...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
111
Voted
ICISS
2010
Springer
14 years 10 months ago
ValueGuard: Protection of Native Applications against Data-Only Buffer Overflows
Abstract. Code injection attacks that target the control-data of an application have been prevalent amongst exploit writers for over 20 years. Today however, these attacks are gett...
Steven Van Acker, Nick Nikiforakis, Pieter Philipp...
102
Voted
MICS
2010
81views more  MICS 2010»
14 years 11 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
FOSSACS
2008
Springer
15 years 2 months ago
Footprints in Local Reasoning
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Mohammad Raza, Philippa Gardner
116
Voted
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
15 years 9 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard