2000 search results - page 154 / 400 » Program Transformation and Proof Transformation |
142
Voted
ENTCS
2002
15 years 3 months ago
2002
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
123
Voted
IEEEPACT
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
130
Voted
PASTE
1998
ACM
15 years 7 months ago
1998
ACM
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...
128
Voted
TCS
2010
15 years 2 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
121
click to vote
CAV
2012
Springer
13 years 6 months ago
2012
Springer
elor Thesis: Demand Driven Abstraction Refinement Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, May 2004 • Secured 97.6 % marks in...