Sciweavers

52 search results - page 8 / 11
» Programmed Graph Rewriting with DEVS
Sort
View
PLDI
2011
ACM
12 years 10 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
CASES
2010
ACM
13 years 5 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
CCS
2005
ACM
14 years 1 months ago
Control-flow integrity
Current software attacks often build on exploits that subvert machine-code execution. The enforcement of a basic safety property, Control-Flow Integrity (CFI), can prevent such at...
Martín Abadi, Mihai Budiu, Úlfar Erl...
ICALP
2007
Springer
14 years 1 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
POPL
1997
ACM
13 years 11 months ago
Shape Types
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
Pascal Fradet, Daniel Le Métayer