Abstract | ||
---|---|---|
Flow networks are inductively defined, assembled from small components to produce arbitrarily large ones, with interchangeable functionally-equivalent parts. We carry out this induction formally using a domain-specific language (DSL). Associated with our DSL are a semantics and a typing theory. The latter gives rise to a system of formal annotations that enforce desirable properties of flow networks as invariants across their interfaces. A prerequisite for a typing theory is a formal semantics, i.e., a rigorous characterization of flows that are safe for the network (limited to the notion of feasible flows in this paper, unfeasible flows being considered unsafe). We give a detailed presentation of a denotational semantics only, but also point out the elements that an equivalent operational semantics must include. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1016/j.scico.2012.12.009 | Science of Computer Programming |
Keywords | Field | DocType |
flow conservation,vector space | Flow network,Domain-specific language,Operational semantics,Programming language,Digital subscriber line,Computer science,Denotational semantics,Theoretical computer science,Syntax,Arbitrarily large,Semantics | Journal |
Volume | Issue | ISSN |
93 | 1 | 0167-6423 |
Citations | PageRank | References |
2 | 0.42 | 18 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
A. J. Kfoury | 1 | 461 | 47.34 |