A Formalism for Scattering of Complex Composite Structures. 2 Distributed Reference Points

Recently we developed a formalism for the scattering from linear and acyclic branched structures build of mutually non-interacting sub-units.{[}C. Svaneborg and J. S. Pedersen, J. Chem. Phys. 136, 104105 (2012){]} We assumed each sub-unit has reference points associated with it. These are well defined positions where sub-units can be linked together. In the present paper, we generalize the formalism to the case where each reference point can represent a distribution of potential link positions. We also present a generalized diagrammatic representation of the formalism. Scattering expressions required to model rods, polymers, loops, flat circular disks, rigid spheres and cylinders are derived. and we use them to illustrate the formalism by deriving the generic scattering expression for micelles and bottle brush structures and show how the scattering is affected by different choices of potential link positions.Comment: Paper no. 2 of a serie

Refinement Types for Secure Implementations

We present the design and implementation of a typechecker for verifying security properties of the source code of cryptographic protocols and access control mechanisms. The underlying type theory is a λ-calculus equipped with refinement types for expressing pre- and post-conditions within first-order logic. We derive formal cryptographic primitives and represent active adversaries within the type theory. Well-typed programs enjoy assertion-based security properties, with respect to a realistic threat model including key compromise. The implementation amounts to an enhanced typechecker for the general purpose functional language F#; typechecking generates verification conditions that are passed to an SMT solver. We describe a series of checked examples. This is the first tool to verify authentication properties of cryptographic protocols by typechecking their source code. © 2008 IEEE

Concurrent constraint programming with process mobility

We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purpose, we first investigate a "pure " paradigm for process migration, namely a paradigm where the only actions are those dealing with transmissions of processes. Our goal is to give a structural definition of the semantics of migration; namely, we want to describe the behaviour of the system, during the transmission of a process, in terms of the behaviour of the components. We achieve this goal by using a labeled transition system where the effects of sending a process, and requesting a process, are modeled by symmetric rules (similar to handshaking-rules for synchronous communication) between the two partner nodes in the network. Next, we extend our paradigm with the primitives of concurrent constraint programming, and we show how to enrich the semantics to cope with the notions of environment and constraint store. Finally, we show how the operational semantics can be used to define an interpreter for the basic calculus.