| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996386870403316 |
|
|
Autore |
L'Estrange Hamon <1605-1660.> |
|
|
Titolo |
The alliance of divine offices, exhibiting all the liturgies of the Church of England since the Reformation [[electronic resource] ] : as also the late Scotch service-book, with all their respective variations : and upon them all annotations, vindictating the Book of common-prayer from the main objections of its adversaries, explicating many parcels thereof hithereto not clearly understood, shewing the conformity it beareth with the primitive practice, and giving a faire prospect into the usages of the ancient church : to these is added at the end, The order of the communion set forth 2 Edward 6 / / by Hamon L'Estrange . |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
London, : Printed for Henry Broom, 1659 |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Addenda: p. 225-338. |
Errata: p. 341. |
Imperfect: stained. |
Reproduction of original in the Bodleian Library. |
|
|
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographic references. |
|
|
|
|
|
|
Sommario/riassunto |
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910346922603321 |
|
|
Autore |
Hammer Christian |
|
|
Titolo |
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
KIT Scientific Publishing, 2009 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (221 p. p.) |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Sommario/riassunto |
|
Information flow control (IFC) is a technique to assert the security of a given program with respect to a given security policy. The classical policy noninterference requires that public output of a program may not be influenced from secret input. This work leverages a technique called program slicing, which is closely connected to IFC and offers many dimensions for improving analysis precision, the most powerful are Path Conditions. Our evaluation shows scalability with a low annotation burden. |
|
|
|
|
|
|
|
| |