Sciweavers

1914 search results - page 67 / 383
» Verification by Abstract Interpretation
Sort
View
ASPDAC
1999
ACM
98views Hardware» more  ASPDAC 1999»
15 years 4 months ago
Generation of Interpretive and Compiled Instruction Set Simulators
Abstract Due to the large variety of di erent embedded processor types, retargetable software development tools, such as compilers and simulators, have received attention recently....
Rainer Leupers, Johann Elste, Birger Landwehr
96
Voted
ESOP
1990
Springer
15 years 4 months ago
From Interpreting to Compiling Binding Times
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
Charles Consel, Olivier Danvy
79
Voted
DAC
2004
ACM
16 years 1 months ago
Abstraction refinement by controllability and cooperativeness analysis
ion Refinement by Controllability and Cooperativeness Analysis Freddy Y.C. Mang and Pei-Hsin Ho Advanced Technology Group, Synopsys, Inc. {fmang, pho}@synopsys.com nt a new abstrac...
Freddy Y. C. Mang, Pei-Hsin Ho
112
Voted
REX
1990
15 years 4 months ago
Object-Oriented Programming Versus Abstract Data Types
Data Types William R. Cook Hewlett-Packard Laboratories 1501 Page Mill Road, Palo Alto, CA, 94303-0969, USA Abstract: This tutorial collects and elaborates arguments for distinguis...
William R. Cook
107
Voted
CAV
2006
Springer
141views Hardware» more  CAV 2006»
15 years 4 months ago
SMT Techniques for Fast Predicate Abstraction
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oli...