Sciweavers

193 search results - page 24 / 39
» Reasoning about Memory Layouts
Sort
View
VMCAI
2007
Springer
16 years 4 hour ago
Invariant Synthesis for Combined Theories
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...
LICS
2005
IEEE
15 years 11 months ago
Mean-Payoff Parity Games
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin...
LICS
2005
IEEE
15 years 11 months ago
Certifying Compilation for a Language with Stack Allocation
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a ...
Limin Jia, Frances Spalding, David Walker, Neal Gl...
PASTE
2004
ACM
15 years 11 months ago
Validation of assembler programs for DSPs: a static analyzer
Digital Signal Processors are widely used in critical embedded systems to pilot low-level, often critical functionalities. We describe a static analyzer based on abstract interpre...
Matthieu Martel
CAV
2004
Springer
93views Hardware» more  CAV 2004»
15 years 11 months ago
Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures
—We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and pre...
Farn Wang