Safe compositional network sketches: formal framework

A Bestavros, A Kfoury, A Lapets, MJ Ocean - Proceedings of the 13th …, 2010 - dl.acm.org
NetSketch is a tool for the specification of constrained-flow applications and the certification
of desirable safety properties imposed thereon. NetSketch assists system integrators in two …

[PDF][PDF] Safe Compositional Equation-based Modeling of Constrained Flow Networks.

N Soule, A Bestavros, AJ Kfoury, A Lapets - EOOLT, 2011 - academia.edu
Numerous domains exist in which systems can be modeled as networks with constraints that
regulate the flow of traffic. Smart grids, vehicular road travel, computer networks, and cloud …

A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report)

A Bestavros, A Kfoury - arXiv preprint arXiv:1109.0775, 2011 - arxiv.org
We define a domain-specific language (DSL) to inductively assemble flow networks from
small networks or modules to produce arbitrarily large ones, with interchangeable …

A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-time Systems

V Ishakian, A Bestavros, A Kfoury - 2010 IEEE 16th …, 2010 - ieeexplore.ieee.org
Desirable application performance is typically guaranteed through the use of Service Level
Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated …

[PDF][PDF] Verification with Natural Contexts: Soundness of Safe Compositional Network Sketches

A Lapets, A Kfoury - CS Dept., Boston University, Tech. Rep. BUCS-TR …, 2009 - lapets.io
In research areas involving mathematical rigor, there are numerous benefits to adopting a
formal representation of models and arguments: reusability, automatic evaluation of …

The syntax and semantics of a domain-specific language for flow-network design

A Kfoury - Science of Computer Programming, 2014 - Elsevier
Flow networks are inductively defined, assembled from small components to produce
arbitrarily large ones, with interchangeable functionally-equivalent parts. We carry out this …

[PDF][PDF] A different approach to the design and analysis of network algorithms

A Kfoury, S Mirzaei - 2013 - Citeseer
We review elements of a typing theory for flow networks, which we expounded in an earlier
report [19]. To illustrate the way in which this typing theory offers an alternative framework for …

[PDF][PDF] Safe Compositional Network Sketches: Reasoning with Automated Assistance

A Lapets, A Kfoury, A Bestavros - 2010 - academia.edu
NetSketch is a tool for the specification of constrained-flow networks (CFNs) and the
certification of desirable safety properties imposed thereon, conceived to assist system …

A compositional approach to network algorithms

A Kfoury - arXiv preprint arXiv:1805.07491, 2018 - arxiv.org
We present elements of a typing theory for flow networks, where" types"," typings", and" type
inference" are formulated in terms of familiar notions from polyhedral analysis and convex …

Algebraic characterizations of flow-network typings

A Kfoury - 2012 - open.bu.edu
A flow network N is a capacited finite directed graph, with multiple input ports/arcs and
multiple output ports/arcs. A flow f in N assigns a non-negative real number to every arc and …