442 search results - page 35 / 89 » Proof Abstraction for Imperative Languages |
ICLP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
STOC
1998
ACM
14 years 28 days ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
ICTAC
2004
Springer
14 years 2 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
ICTCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Non-interference is a desirable property of systems in a multilevel security architecture, stating that confidential information is not disclosed in public output. The c...
ESOP
1999
Springer
14 years 1 months ago
1999
Springer
Control Flow Analysis is a widely used approach for analysing functional and object oriented programs. Once the applications become more demanding also the analysis needs to be mor...