Sciweavers

5084 search results - page 111 / 1017
» Proving Possibility Properties
Sort
View
CSFW
2004
IEEE
15 years 9 months ago
Modelling Downgrading in Information Flow Security
Information flow security properties such as noninterference ensure the protection of confidential data by strongly limiting the flow of sensitive information. However, to deal wi...
Annalisa Bossi, Carla Piazza, Sabina Rossi
ICALP
2004
Springer
15 years 10 months ago
Extensional Theories and Rewriting
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...
Grigore Rosu
RTA
1993
Springer
15 years 9 months ago
Total Termination of Term Rewriting
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
Maria C. F. Ferreira, Hans Zantema
JSC
2007
60views more  JSC 2007»
15 years 5 months ago
An elementary proof of Sylvester's double sums for subresultants
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester’s formula was also r...
Carlos D'Andrea, Hoon Hong, Teresa Krick, Á...
JSYML
2000
54views more  JSYML 2000»
15 years 5 months ago
Stationary Sets and Infinitary Logic
Let K0 be the class of structures , <, A , where A is disjoint from a club, and let K1 be the class of structures , <, A , where A contains a club. We prove that if = &...
Saharon Shelah, Jouko A. Väänänen