442 search results - page 56 / 89 » Proof Abstraction for Imperative Languages |
268
click to vote
POPL
2007
ACM
16 years 5 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
154
click to vote
LATA
2009
Springer
16 years 9 days ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
164
click to vote
ECOOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Component software means reuse and separate marketing of pre-manufactured binary components. This requires components from different vendors to be composed very late, pos...
149
Voted
CRYPTO
2009
Springer
16 years 3 days ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
155
click to vote
ISOLA
2007
Springer
15 years 11 months ago
2007
Springer
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...