1821 search results - page 74 / 365 » Security-Aware Program Transformations |
104
Voted
APLAS
2009
ACM
15 years 8 months ago
2009
ACM
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
125
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
The polyhedral model is extensively used for analyses and transformations of regular loop programs, one of the most important being automatic parallelization. The model, however, ...
136
Voted
APLAS
2011
ACM
14 years 2 months ago
2011
ACM
The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to co...
139
Voted
ESOP
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
116
Voted
MPC
1995
Springer
15 years 5 months ago
1995
Springer
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...