Search

Proving the security of masked implementations in theoretical models that are relevant to practice and match the best known attacks of the side-channel literature is a notoriously hard problem. The random probing model is a promising candidate to contribute to this challenge, due to its ability to capture the continuous nature of physical leakage (contrary to the threshold probing model), while also being convenient to manipulate in proofs and to automate with verification tools. Yet, despite recent progress in the design of masked circuits with good asymptotic security guarantees in this model, existing results still fall short when it comes to analyze the security of concretely useful circuits under realistic noise levels and with low number of shares. In this paper, we contribute to this issue by introducing a new composability notion, the Probe Distribution Table (PDT), and a new tool (called STRAPS, for the Sampled Testing of the RAndom Probing Security). Their combination allows us to significantly improve the tightness of existing analyses in the most practical (low noise, low number of shares) region of the design space. We illustrate these improvements by quantifying the random probing security of an AES S-box circuit, masked with the popular multiplication gadget of Ishai, Sahai and Wagner from Crypto 2003, with up to six shares.

Combat system modeling generally includes two aspects: structure and behavior. Structural modeling is to build the structure of entities and their internal and external static relationships. Behavioral modeling aims at the typical working processes. The simulation modeling definition language (SMDL) of Simulation Modeling Platform (SMP2) can describe system structure well, but it is difficult to support behavioral modeling. The modeling and simulation tool named Ptolemy is able to support the description of system behavior, but it lacks effective support for structural modeling. For this reason, the goal of the paper is to explore a mechanism to combine structural and behavioral modeling, which can not only effectively support the architecture design but also support the expression of system behaviors. As a proof of concept, we extend the SMDL by adding the synchronous data flow (SDF) elements, and use this new language, namely, the extended Simulation Model Definition Language (ESMDL), to specify a radar system for both of structural and behavioral modeling.

A significant aspect of software integrity is the ability to determine whether a system is correctly showing the information it is intended to show. This work combines abstract cryptographic composability principles with automated machine learning techniques to support a new methodology for software integrity checking, particularly in the intractable domain of interface validation. A subtle but often perilously overlooked cryptographic principle is the requirement that a sender be aware of the meaning of inputs, specifically of the cleartext behind encrypted messages. We propose using computer vision to evaluate whether interfaces exhibit technical awareness of information content, enabling automated development-time and real-time integrity checking that is far more efficient and extensive than manual analysis.

One oft-endeavored security property for cryptographic hash functions is collision resistance: it should be computationally infeasible to find distinct inputs \(x,x'\) such that \(H(x) = H(x')\), where H is the hash function. Unruh (EUROCRYPT 2016) proposed collapseability as its quantum equivalent. The Merkle-Damgard and sponge hashing modes have recently been proven to be collapseable under the assumption that the underlying primitive is collapseable. These modes are inherently sequential. In this work, we investigate collapseability of tree hashing. We first consider fixed length tree hashing modes, and derive conditions under which their collapseability can be reduced to the collapseability of the underlying compression function. Then, we extend the result to two methods for achieving variable length hashing: tree hashing with domain separation between message and chaining value, and tree hashing with length encoding at the end of the tree. The proofs are performed using the collapseability composability framework of Fehr (TCC 2018), that allows us to discard of deeply technical quantum details and to focus on proper composition of the tree hashes from their compression function.

In recent years, misinformation on the Web has become increasingly rampant. The research community has responded by proposing systems and challenges, which are beginning to be useful for (various subtasks of) detecting misinformation. However, most proposed systems are based on deep learning techniques which are fine-tuned to specific domains, are difficult to interpret and produce results which are not machine readable. This limits their applicability and adoption as they can only be used by a select expert audience in very specific settings. In this paper we propose an architecture based on a core concept of Credibility Reviews (CRs) that can be used to build networks of distributed bots that collaborate for misinformation detection. The CRs serve as building blocks to compose graphs of (i) web content, (ii) existing credibility signals –fact-checked claims and reputation reviews of websites–, and (iii) automatically computed reviews. We implement this architecture on top of lightweight extensions to Schema.org and services providing generic NLP tasks for semantic similarity and stance detection. Evaluations on existing datasets of social-media posts, fake news and political speeches demonstrates several advantages over existing systems: extensibility, domain-independence, composability, explainability and transparency via provenance. Furthermore, we obtain competitive results without requiring finetuning and establish a new state of the art on the Clef’18 CheckThat! Factuality task.

Composability and modularity in relation to physics are useful properties in the development of cyber-physical systems that interact with their environment. The bond-graph modeling language offers these properties. When systems structures conform to the bond-graph notation, all interfaces are defined as physical “power ports” which are guaranteed to exchange power. Having a single type of interface is a key feature when aiming for modular, composable systems. Furthermore, the facility to monitor energy flows in the system through power ports allows the definition of system-wide properties based on component properties. In this paper we present a metamodel of the bond-graph language aimed to facilitate the description and deployment of software components for cyber-physical systems. This effort provides a formalized description of standardized interfaces that enable physics-conformal interconnections. We present a use-case showing that the metamodel enables composability, reusability, extensibility, replaceability and independence of control software components.

Fairness in Secure Multiparty Computation (MPC) is known to be impossible to achieve in the presence of a dishonest majority. Previous works have proposed combining MPC protocols with cryptocurrencies in order to financially punish aborting adversaries, providing an incentive for parties to honestly follow the protocol. The focus of existing work is on proving that this approach is possible and unfortunately they present monolithic and mostly inefficient constructions. In this work, we put forth the first UC secure modular construction of “Insured MPC”, where either the output of the private computation (which describes how to distribute funds) is fairly delivered or a proof that a set of parties has misbehaved is produced, allowing for financial punishments. Moreover, both the output and the proof of cheating are publicly verifiable, allowing third parties to independently validate an execution. We present an efficient compiler that implements Insured MPC from an MPC protocol with certain properties, a standard (non-private) Smart Contract and a publicly verifiable homomorphic commitment scheme. As an intermediate step, we propose the first construction of a publicly verifiable homomorphic commitment scheme with composability guarantees.

We propose a heuristics-based social-sensor cloud service selection and composition model to reconstruct mosaic scenes. The proposed approach leverages crowdsourced social media images to create an image mosaic to reconstruct a scene at a designated location and an interval of time. The novel approach relies on the set of features defined on the bases of the image metadata to determine the relevance and composability of services. Novel heuristics are developed to filter out non-relevant services. Multiple machine learning strategies are employed to produce smooth service composition resulting in a mosaic of relevant images indexed by geolocation and time. The preliminary analytical results prove the feasibility of the proposed composition model.

The cloud computing paradigm allows ubiquitous access to resources and computational services. These shared assets can be accessed with limited administrative constraints, can rapidly be configured, and provide a huge shared pool of easily accessible information. Often, a significant portion of the computational services is provided by assets at the edge of these clouds, such as by the computational components of cyber physical systems, resulting in the closely related paradigm of edge computing. If smart devices are used to provide similar functionality at the edge of the cloud, these compositions are often referred to as fog computing. In all these cases, bringing data intensive systems with multi-modality together requires more than technical communications. A common information sphere must allow the homogenous access to heterogeneous information structures, often not simply manifested in different facets and viewpoints, but in conceptually different worldviews. This chapter provides an evaluation of the challenges and a survey of available concepts applicable to cope with these challenges. The central idea is the rigorous separation of propertied concepts and processes that are working on these concepts, allowing to unambiguously identify complementary and competitive views, both needed for the successful application of cyber physical systems in complex environments.

Smart government widely integrates heterogeneous business systems to provide intelligent applications, and improving interdepartmental government coordination capability is a key technical issue that needs to be solved urgently. Service composition technology based on SOA architecture is a good solution. However, due to the inherent heterogeneity and huge scale of smart government, the state space of service composition is very large, which is a great challenge to the efficiency and accuracy of problem solving. Based on analysis of the existing service composition research methods, combined with the domain characteristics of smart government, this paper studies and constructs an abstract government Web service template to reduce the scale of state space for service composition problem. Furthermore, a semantic-based service composability measurement is studied to select service solutions to improve the accuracy.

While many tailor made card game protocols are known, the vast majority of those lack three important features: mechanisms for distributing financial rewards and punishing cheaters, composability guarantees and flexibility, focusing on the specific game of poker. Even though folklore holds that poker protocols can be used to play any card game, this conjecture remains unproven and, in fact, does not hold for a number of protocols (including recent results). We both tackle the problem of constructing protocols for general card games and initiate a treatment of such protocols in the Universal Composability (UC) framework, introducing an ideal functionality that captures card games that use a set of core card operations. Based on this formalism, we introduce Royale, the first UC-secure general card games which supports financial rewards/penalties enforcement. We remark that Royale also yields the first UC-secure poker protocol. Interestingly, Royale performs better than most previous works (that do not have composability guarantees), which we highlight through a detailed concrete complexity analysis and benchmarks from a prototype implementation.

Composing together the individual atomic methods of concurrent data-structures (cds) pose multiple design and consistency challenges. In this context composition provided by transactions in software transaction memory (STM) can be handy. However, most of the STMs offer read/write primitives to access shared cds. These read/write primitives result in unnecessary aborts. Instead, semantically rich higher-level methods of the underlying cds like lookup, insert or delete (in case of hash-table or lists) aid in ignoring unimportant lower level read/write conflicts and allow better concurrency.

Homomorphic signature schemes allow anyone to perform computation on signed data in such a way that the correctness of computation’s results is publicly certified. In this work we analyze the security notions for this powerful primitive considered in previous work, with a special focus on adaptive security. Motivated by the complications of existing security models in the adaptive setting, we consider a simpler and (at the same time) stronger security definition inspired to that proposed by Gennaro and Wichs (ASIACRYPT’13) for homomorphic MACs. In addition to strength and simplicity, this definition has the advantage to enable the adoption of homomorphic signatures in dynamic data outsourcing scenarios, such as delegation of computation on data streams. Then, since no existing homomorphic signature satisfies this stronger notion, our main technical contribution are general compilers which turn a homomorphic signature scheme secure under a weak definition into one secure under the new stronger notion. Our compilers are totally generic with respect to the underlying scheme. Moreover, they preserve three important properties of homomorphic signatures: composability, context-hiding (i.e. signatures on computation’s output do not reveal information about the input) and efficient verification (i.e. verifying a signature against a program \({\mathcal P}\) can be made faster, in an amortized, asymptotic sense, than recomputing \({\mathcal P}\) from scratch).

This chapter is on the construction of multi-writer multi-reader registers in asynchronous messagepassing systems prone to the crash of a minority of processes (system model CAMPn,t[t < n/2]). It first considers atomic registers for which it adopts an incremental presentation, with three constructions, each one extending the previous one. The first one builds a single-writer multi-reader (SWMR) regular register, which is extended by the second construction to obtain a single-writer multi-reader (SWMR) atomic register. The third one consists in a simple extension of the second one to obtain a multi-writer multi-reader (MWMR) atomic register. The chapter then addresses the construction of sequentially consistent registers.

Program analyses are an important tool to check if a system fulfills its specification. A typical implementation strategy for program analyses is to use an imperative, general-purpose language like Java; and access the program to be analyzed through libraries for manipulating intermediate code, such as ASM for Java bytecode. We show that this hampers composability, interoperability and reuse of analysis implementations. We propose a complete Ecore-metamodel for Java bytecode as a common basis for program analysis implementations, as well as an Eclipse plug-in to create bytecode metamodel instances from Java bytecode and vice versa. Code analyses can be defined as model transformations in a declarative, domain-specific language. As a consequence, the implementations of program analyses become more composable and more modular in general. We demonstrate the effectiveness of this approach with a case study.

In this chapter, we introduce the concept of quality as related to conceptual models and provide two non-exclusive approaches through which a model’s quality may be assessed: how well the model allows us to achieve our purpose and how well the model can be understood or modified. Each of these is fleshed out into various quality factors, including functional ones such as correctness and robustness as well as non-functional ones, such as usability or readability. Then, we introduce the notion of modularity as a way to achieve better quality in conceptual models, using Bertrand Meyer’s influential work in software languages. We define a module as a portion of a model that exhibits high internal cohesion and low external coupling and explore five quality criteria that can help us produce more modular models: decomposability, composability, understandability, proportion and protection. Finally, the chapter closes with a discussion on the cost of quality and the need to achieve a balance between quality, time and resources.

Biological regulatory networks depend upon chemical interactions to process information. Engineering such molecular computing systems is a major challenge for synthetic biology and related fields. The chemical reaction network (CRN) model idealizes chemical interactions, abstracting away specifics of the molecular implementation, and allowing rigorous reasoning about the computational power of chemical kinetics. Here we focus on function computation with CRNs, where we think of the initial concentrations of some species as the input and the eventual steady-state concentration of another species as the output. Specifically, we are concerned with CRNs that are rate-independent (the computation must be correct independent of the reaction rate law) and composable (\(f \circ g\) can be computed by concatenating the CRNs computing f and g). Rate independence and composability are important engineering desiderata, permitting implementations that violate mass-action kinetics, or even “well-mixedness”, and allowing the systematic construction of complex computation via modular design. We show that to construct composable rate-independent CRNs, it is necessary and sufficient to ensure that the output species of a module is not a reactant in any reaction within the module. We then exactly characterize the functions computable by such CRNs as superadditive, positive-continuous, and piecewise rational linear. Our results show that composability severely limits rate-independent computation unless more sophisticated input/output encodings are used.

We demonstrate how methods in Functional Programming can be used to implement a computer algebra system. As a proof-of-concept, we present the computational-algebra package. It is a computer algebra system implemented as an embedded domain-specific language in Haskell, a purely functional programming language. Utilising methods in functional programming and prominent features of Haskell, this library achieves safety, composability, and correctness at the same time. To demonstrate the advantages of our approach, we have implemented advanced Grobner basis algorithms, such as Faugere’s \(F_4\) and \(F_5\), in a composable way.

We propose a novel CP-Net based composition approach to qualitatively select an optimal set of consumers for an IaaS provider. The IaaS provider’s and consumers’ qualitative preferences are captured using CP-Nets. We propose a CP-Net composability model using the semantic congruence property of a qualitative composition. A greedy-based and a heuristic-based consumer selection approaches are proposed that effectively reduce the search space of candidate consumers in the composition. Experimental results prove the feasibility of the proposed composition approach.

Domain-specific frameworks – including embedded domain-specific languages and libraries – increase programmer productivity by encapsulating proven manual optimization strategies into software modules or (semi-)automated tools. In such frameworks, optimizations and optimization strategies capitalize on knowledge of the requirements of a particular application domain to achieve high performance and architecture portability. While many strategies have been used to develop domain-specific frameworks, this position paper argues the importance of polyhedral compiler technology and autotuning for important classes of high-performance computing domains. Such an approach has the following advantages over other strategies: (1) composability; (2) software reuse; and, (3) facilitates performance portability.

It is often the case that models and simulations of subsystems such as the components making up a vehicle are created in isolation and must later be integrated with other models to create a model of the overall system. However, the reuse of existing models and simulations can be costly and time-consuming, and can yield uncertain results. Advances are needed to enable cost-effective reuse of models and simulations and to ensure that integrated models produce reliable results. Key findings discussed in this chapter include the need for advances in the theory of reuse to provide a firm theoretical foundation for producing robust and reliable reuse practices, the need for guides documenting best practices on reuse, and the need for research advances on the social, behavioral, and cultural aspects of reuse in addition to technical issues.

Today, many industrial products are defined by software, and therefore customizable by installing new applications on demand - their functionalities are implemented by software and can be modified and extended by software updates. This trend towards customizable products is extending into all domains of IT, including Cyber-Physical Systems (CPS) such as cars, robotics, and medical devices. However, these systems are often highly safety-critical. The current state-of-practice allows hardly any modifications once safety-critical systems are put in operation. This is due to the lack of techniques to preserve crucial safety conditions for the modified system, which severely restricts the benefits of software.

Humans out-perform contemporary robots despite vastly slower ‘wetware’ (e.g. neurons) and ‘hardware’ (e.g. muscles). The basis of human sensory-motor performance appears to be quite different from that of robots. Human haptic perception is not compatible with Riemannian geometry, the foundation of classical mechanics and robot control. Instead, evidence suggests that human control is based on dynamic primitives, which enable highly dynamic behavior with minimal high-level supervision and intervention. Motion primitives include submovements (discrete actions) and oscillations (rhythmic behavior). Adding mechanical impedance as a class of dynamic primitives facilitates controlling physical interaction. Both motion and interaction primitives may be combined by re-purposing the classical equivalent electric circuit and extending it to a nonlinear equivalent network. It highlights the contrast between the dynamics of physical systems and the dynamics of computation and information processing. Choosing appropriate task-specific impedance may be cast as a stochastic optimization problem, though its solution remains challenging. The composability of dynamic primitives, including mechanical impedances, enables complex tasks, including multi-limb coordination, to be treated as a composite of simpler tasks, each represented by an equivalent network. The most useful form of nonlinear equivalent network requires the interactive dynamics to respond to deviations from the motion that would occur without interaction. That suggests some form of underlying geometric structure but which geometry is induced by a composition of motion and interactive dynamic primitives? Answering that question might pave the way to achieve superior robot control and seamless human-robot collaboration.

The objective of this chapter is to provide a gentle introduction to High Level Architecture (HLA). HLA is a standard architectural framework for distributed simulation. It is an enabler for simulation reuse, interoperability and composability. In this chapter, various aspects of the standard will be reviewed to furnish user with a comprehensive introduction. Furthermore, a case study that demonstrates how to develop an object model for an HLA federation will be presented.

This paper discusses the problem of teaching provable security in cryptography when studying information security. The concept of provable security is one of the most important in modern cryptography, soit is necessary to integrate it into the syllabus on cryptographic protocols. Now provable security is not rare thing in basic cryptography courses. However, security proofs for cryptographic protocols are far more complicated than for primitives. We suggest the way of embedding Sequence of Games technique, Universally Composability framework, module design of protocols and other techniques into the cryptography protocols course. Our experience of teaching formal security proofs for cryptographic protocols brings quite positive effect for students’ research and development.

In our work we aim at a composable and consistent specification and verification of contracts for extra-functional properties, such as power consumption or temperature. To this end, a necessary precondition for the semantical correctness of such properties is to ensure the structurally correct modeling of their interdependences.

Wireless sensor networks (WSN) are recognized key enablers for the Internet of Things (IoT) paradigm since its inception. WSNs are a resilient and effective distributed data collection technology, but issues related to reliability, autonomy, cost, and accessibility to application domain experts still limit their wide scale use. Commercial solutions can effectively address vertical application domains, but they often lead to technology lock-ins that limit horizontal composability and reuse. We review some important barriers that hinder WSN use in IoT applications and highlight the main effort and cost components. With these elements in mind, we propose an open hardware–software development platform that can optimize the value flow between technologies and actors with stakes in WSN applications. To reach its objectives, the platform fosters reuse, low-effort low-risk fast prototyping accessible to application domain experts, easy integration of new technology and IP blocks, and simplifies the permeation of research results in commercial applications.

The use of Physically Unclonable Functions PUFs in cryptographic protocols attracted an increased interest over recent years. Since sound security analysis requires a concise specification of the alleged properties of the PUF, there have been numerous trials to provide formal security models for PUFs. However, all these approaches have been tailored to specific types of applications or specific PUF instantiations. For the sake of applicability, composability, and comparability, however, there is a strong need for a unified security model for PUFs to satisfy, for example, a need to answer whether a future protocol requirements match a new and coming PUF realization properties. In this work, we propose a PUF model which generalizes various existing PUF models and includes security properties that have not been modeled so far. We prove the relation between some of the properties, and also discuss the relation of our model to existing ones.

This article presents our interaction design for DataChopin, based on an extensive survey and classification of visualisation software for exploratory data analysis. Its distinctive characteristics are the use of a large-scale display wall as a shared desktop, as well as flexible composition mechanisms for incremental and piece-wise construction of visualisations. We chose composability as a guiding principle in our design, since it is essential to open-ended exploration, as well as collaborative analysis. For one, it enables truly exploratory inquiry by letting users freely examine different combinations of data, rather than offering a predetermined set of choices. Perhaps more importantly, it provides a foundation for data analysis through collaborative interaction with visualisations. If data and visualisations are composable, they can split into independent parts and recombined during the analytical process, allowing analysts to seamlessly transition between closely- and loosely-coupled work.

This paper develops a theory of node composition in a formal framework for cognitive hierarchies. It builds on an existing model for the integration of symbolic and sub-symbolic representations in a robot architecture consisting of nodes in a hierarchy. A notion of behaviour equivalence between cognitive hierarchies is introduced and node composition operators that preserve this equivalence are defined. This work is significant in two respects. Firstly, it opens the way for a formal comparison between cognitive robotic systems. Secondly, composition, more precisely decomposition, has been shown to be important to many fields, and may therefore prove of practical benefit in the context of cognitive systems.

Interface theories allow systems designers to reason about the composability and compatibility of concurrent system components. Such theories often extend both de Alfaro and Henzinger's Interface Automata and Larsen's Modal Transition Systems, which leads, however, to several issues that are undesirable in practice: an unintuitive treatment of specified unwanted behaviour, a binary compatibility concept that does not scale to multi-component assemblies, and compatibility guarantees that are insufficient for software product lines. In this paper we show that communication mismatches are central to all these problems and, thus, the ability to represent such errors semantically is an important feature of an interface theory. Accordingly, we present the error-aware interface theory EMIA, where the above shortcomings are remedied by introducing explicit fatal error states. In addition, we prove via a Galois insertion that EMIA is a conservative generalisation of the established MIA Modal Interface Automata theory.

We define information leakage in terms of a "difference" between the a priori distribution over some remote behavior and the a posteriori distribution of the remote behavior conditioned on a local observation from a protocol run. Either a maximum or an average may be used. We identify a set of notions of "difference;" we show that they reduce our general leakage notion to various definitions in the literature. We also prove general composability theorems analogous to the data-processing inequality for mutual information, or cascading channels for channel capacities.

We present a generic computational soundness result for interactive cryptographic primitives. Our abstraction of interactive primitives leverages the Universal Composability UC framework, and thereby offers strong composability properties for our computational soundness result: given a computationally sound Dolev-Yao model for non-interactive primitives, and given UC-secure interactive primitives, we obtain computational soundness for the combined model that encompasses both the non-interactive and the interactive primitives. Our generic result is formulated in the CoSP framework for computational soundness proofs and supports any equivalence property expressible in CoSP such as strong secrecy and anonymity. In a case study, we extend an existing computational soundness result by UC-secure blind signatures. We obtain computational soundness for blind signatures in uniform bi-processes in the applied $$\pi $$-calculus. This enables us to verify the untraceability of Chaum's payment protocol in ProVerif in a computationally sound manner.

The need to manage embedded systems, brought forward by the wider adoption of pervasive computing, is particularly vital in the context of secure and safety-critical applications. This work presents RT-SPDM, a framework for the real-time management of devices populating ambient environments. The proposed framework utilizes a formally validated approach to reason the composability of heterogeneous embedded systems, evaluate their current security, privacy and dependability levels based on pre-defined metrics, and manage them in real-time. An implementation of Event Calculus is used in the Jess rule engine in order to model the ambient environment context and the rule-based management procedure. The reasoning process is modeled as an agent's behavior and applied on an epistemic multi-agent reasoner for ambient intelligence applications. Agents monitor distinct embedded systems and are deployed as OSGi bundles to enhance the real-time management of embedded devices. A Service Oriented Architecture is adopted, through the use of the Devices Profile for Web Services standard, in order to provide seamless interaction between the framework's entities, which exchange well-formed information, determined by the OASIS CAP standard. Proof-of-concept implementations of all entities are developed, also investigating user-friendly GUIs for both the front-end and back-end of the framework. A preliminary performance evaluation on typical embedded devices confirms the viability of the proposed approach.

In this paper, we consider the following question: Does composing protocols having game-theoretic security result in a secure protocol in the sense of game-theoretic security? In order to discuss the composability of game-theoretic properties, we study security of cryptographic protocols in terms of the universal composability UC and game theory simultaneously. The contribution of this paper is the following: i We propose a compiler of two-party protocols in the local universal composability LUC framework such that it transforms any two-party protocol secure against semi-honest adversaries into a protocol secure against malicious adversaries in the LUC framework; ii We consider the application of our compiler to oblivious transfer OT protocols, by which we obtain a construction of OT meeting both UC security and game-theoretic security.

Modeling and Simulation is highly important to robotics. Modeling is creating a conceptualization that is implemented by the simulation. As such the insights are directly applicable to planning and decision logic of autonomous systems for complex situations. When autonomous systems collaborate, they not only need to be interoperable, i.e. able to exchange data and utilize service calls, but also composable, i.e. provide a consistent interpretation of truth. The collaboration of autonomous systems can happen in a multi-, inter-, or trans-disciplinary context, depending on the maturity level of interoperability that is defined in this chapter using the Levels of Conceptual Interoperability Model (LCIM). The results are coherent with the NATO Net-enabled Capability Command and Control Maturity Model (N2C2M2) that can show the degree of interoperation with and among autonomous systems. Finally, several computational constraints are discussed that limit the ability of autonomous systems: incompleteness, decidability, computational complexity, and their implications for the applicability of self-organizing command and control for autonomous systems.

Imprecise manipulation of source code (semi-parsing) is useful for tasks such as robust parsing, error recovery, lexical analysis, and rapid development of parsers for data extraction. An island grammar precisely defines only a subset of a language syntax (islands), while the rest of the syntax (water) is defined imprecisely. Usually, water is defined as the negation of islands. Albeit simple, such a definition of water is naive and impedes composition of islands. When developing an island grammar, sooner or later a programmer has to create water tailored to each individual island. Such an approach is fragile, however, because water can change with any change of a grammar. It is time-consuming, because water is defined manually by a programmer and not automatically. Finally, an island surrounded by water cannot be reused because water has to be defined for every grammar individually. In this paper we propose a new technique of island parsing - bounded seas. Bounded seas are composable, robust, reusable and easy to use because island-specific water is created automatically. We integrated bounded seas into a parser combinator framework as a demonstration of their composability and reusability.