3342 search results - page 288 / 669 » Automating Abstract Interpretation |
135
click to vote
TPHOL
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
152
click to vote
AISC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
157
click to vote
DEON
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Privacy policies are often defined in terms of permitted messages. Instead, in this paper we derive dynamically the permitted messages from static privacy policies defi...
164
click to vote
DEON
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We show that a recently developed theory of positive permission based on the notion of derogation is hampered by a triviality result that indicates a problem with the und...
147
click to vote
CSL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...