2137 search results - page 51 / 428 » Proving Abstract Non-interference |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
AMAST
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we give an operational and denotational semantics for a 3APL meta-language, with which various 3APL interpreters can be programmed. We moreover prove equiv...
CL
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
LOPSTR
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. We present an approach to a coherent program synthesis system which integrates a variety of interactively controlled and automated techniques from theorem proving and alg...