| 1. |
- Adams, Robin, 1978, et al.
(författare)
-
Constructing Independently Verifiable Privacy-Compliant Type Systems for Message Passing between Black-Box Components
- 2018
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Cham : Springer International Publishing. - 1611-3349 .- 0302-9743. ; 11294, s. 196-214
-
Konferensbidrag (refereegranskat)abstract
- Privacy by design (PbD) is the principle that privacy should be considered at every stage of the software engineering process. It is increasingly both viewed as best practice and required by law. It is therefore desirable to have formal methods that provide guarantees that certain privacy-relevant properties hold. We propose an approach that can be used to design a privacy-compliant architecture without needing to know the source code or internal structure of any individual component. We model an architecture as a set of agents or components that pass messages to each other. We present in this paper algorithms that take as input an architecture and a set of privacy constraints, and output an extension of the original architecture that satisfies the privacy constraints.
|
|
| 2. |
|
|
| 3. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
A comparison of C++ concepts and Haskell type classes
- 2008
-
Ingår i: ACM SIGPLAN Workshop on Generic Programming 2008. Victoria, Canada, 20th September 2008. - 9781605580609 ; , s. 37-48
-
Konferensbidrag (refereegranskat)abstract
- Earlier studies have introduced a list of high-level evaluation criteria to assess how well a language supports generic programming. Since each language that meets all criteria is considered generic, those criteria are not fine-grained enough to differentiate between two languages for generic programming.We refine these criteria into a taxonomy that capturesdifferences between type classes in Haskell and concepts inC++, and discuss which differences are incidental and whichones are due to other language features. The taxonomy allows for an improved understanding of language support for generic programming, and the comparison is useful for the ongoing discussions among language designers and users of both languages.
|
|
| 4. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Generic programming with C++ concepts and Haskell type classes—a comparison
- 2010
-
Ingår i: Journal of Functional Programming. - 1469-7653 .- 0956-7968. ; 20:3-4, s. 271-302
-
Tidskriftsartikel (refereegranskat)abstract
- Earlier studies have introduced a list of high-level evaluation criteria to assess how well a language supports generic programming. Languages that meet all criteria include Haskell, because of its type classes, and C++ with the concept feature. We refine these criteria into a taxonomy that captures commonalities and differences between type classes in Haskell and concepts in C++, and discuss which differences are incidental and which ones are due to other language features. The taxonomy allows for an improved understanding of language support for generic programming, and the comparison is useful for the ongoing discussions among language designers and users of both languages.
|
|
| 5. |
|
|
| 6. |
- Buvendiek, Kai, et al.
(författare)
-
Privacy-Preserving Architectures with Probabilistic Guaranties
- 2018
-
Ingår i: 2018 16th Annual Conference on Privacy, Security and Trust, PST 2018. - 9781538674932 ; , s. 38-47
-
Konferensbidrag (refereegranskat)abstract
- Violations of the privacy of users can happen if data protection is not a fundamental part of the development process of a software system. The principle of Privacy by Design (PbD) therefore stipulates the consideration of privacy as a default feature. We have developed an integrated tool environment called CAPVerDE that provides a formal description language of software architectures and helps a designer by automatically verifying data minimization properties the architectural level. Our logic includes probabilistic properties that introduce uncertainty into the architectures. These properties can be used to model attack scenarios that rely on chance. This paper presents the logic of the description language of CAPVerDE and illustrates the reasoning by applying it to a smart energy metering case study.
|
|
| 7. |
|
|
| 8. |
- Gregor, Douglas, et al.
(författare)
-
Retaining Path-Sensitive Relations Across Control-Flow Merges
- 2003
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
- We present a new value range merge operation that, unlike traditional value range merge operations, preserves arbitrary ordering relationships between program variables. We guide this new algorithm with two data structures that model interobject field relationships, enabling better precision in the analysis of object-oriented programs without prohibitive implementation or run-time costs. We discuss our own implementation of this algorithm in the STLlint static checker, which is able to verify C++ iterator loops that otherwise would require path-sensitive analysis.
|
|
| 9. |
|
|
| 10. |
- Järvi, Jaako, et al.
(författare)
-
Generic Programming and High-Performance Libraries
- 2004
-
Ingår i: 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM); Santa Fe, NM; United States; 26 April 2004 through 30 April 2004. - 9780769521329 ; 18, s. 2767-2774
-
Konferensbidrag (refereegranskat)abstract
- Generic programming is an attractive paradigm for developing libraries for high-performance computing because of the simultaneous emphases placed on generality and efficiency. In this approach, interfaces are based on sets of specified requirements on types, rather than on any particular type, allowing algorithms to inter-operate with any data type meeting the necessary requirements. These sets of requirements, known as concepts, can specify syntactic as well as semantic requirements. Although concepts are fundamental to generic programming, they are not supported as first-class entities in mainstream programming languages, thus limiting the degree to which generic programming can be effectively applied. In this paper we advocate better syntactic and semantic support for concepts and describe some straightforward language features that could better support them. We also briefly discuss uses for concepts beyond their use in constraining polymorphism.
|
|
