Specification and Verification of Dynamic Communication Systems

Bauer, Jörg; Schaefer, Ina; Toben, Tobe; Westphal, Bernd

doi:10.1109/acsd.2006.29

Cited by 11 publications

(16 citation statements)

References 28 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The value of an integrated methodology for specifying and verifying network protocols has long been recognized [5] and research continues for today's protocols [6]. The methodology advocated in this thesis defines an analogous tool set to that described above for the composition of layered network simulations.…”

Section: Chapter II Toolsmentioning

confidence: 99%

Specifying, Implementing and Verifying Layered Network Protocols

Cwikla

2017

Preprint

View full text Add to dashboard Cite

As computing power increases, software is developed to make use of the increased capacity. A transition is currently in progress as the growth of higher level scripting languages enables a larger number of programmers to develop programs in larger and more diverse domains. The world of software program development is becoming readily accessible to a larger audience.Concurrently, digital communication has revolutionized the way that people interact.Protocols are established to enable new types of communication. Successful protocols are built in layers; each layer makes use of the one below it and providing services to the layer directly above it. As new uses are discovered for digital communications, new protocols will need to be developed to support them.Simulations are useful when communication protocols are developed. The simulation can be specified, implemented and its runtime behavior verified against the specification.This thesis proposes and demonstrates that there exists a set of software development tools that are readily accessible and end to end to address the problem of specifying, implementing and verifying layered communication protocol simulations.

show abstract

Section: Chapter II Toolsmentioning

confidence: 99%

Specifying, Implementing and Verifying Layered Network Protocols

Cwikla

2017

Preprint

View full text Add to dashboard Cite

show abstract

“…It is also possible to model "dynamic access control" by other methods such as using pushdown systems [40], graph grammars [5], or frameworks such as "formal concept analysis and concept lattices" [21] but we will only discuss the access control problem on the Internet that can be modelled using pushdown systems. …”

Section: "Dynamic" Access Controlmentioning

confidence: 99%

Static Program Analysis for Security

Gopinath¹

2007

The Compiler Design Handbook

View full text Add to dashboard Cite

Mutation analysis is one of the most effective, but costly means of assessing the ability of software test suites to prevent bugs. Traditional mutation analysis involves producing and evaluating syntactic variants of the original to check whether the test suite under evaluation is capable of distinguishing between the variant and the original in terms of behavior.Evaluating each mutant separately means a large amount of redundant computation, both between the original program and mutants, and also between different mutants.Previous work explored numerous means of removing redundancy. However, some amount of redundancy has remained especially in the post-mutation phase.In this paper, we propose execution taints -A novel technique that repurposes dynamic data-flow taints for mutation analysis. Our technique is the only technique that can remove the redundancy in post-mutation phase, achieving better efficiency in mutation analysis. We further leverage memoization to eliminate redundant execution between program variants.

show abstract

“…In this work, we elaborate on an automated procedure for checking whether a DCS protocol satisfies a given Mett property. A manual procedure was briefly sketched in [3]. By bridging the technical gap between different analysis techniques with different strengths and weaknesses, we obtain a fully automated, integrated implementation, which benefits from synergetical effects.…”

Section: Introductionmentioning

confidence: 99%

“…In particular, there are neither process creation, destruction, nor evolving communication topologies. In fact, in preliminary work [3], we manually discovered (and remedied) severe flaws in the original specification. With our proposed technique we are able to do so automatically.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Mind the Shapes: Abstraction Refinement Via Topology Invariants

Bauer

Toben

Westphal

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. Dynamic Communication Systems (DCS) are infinite state systems where an unbounded number of processes operate in an evolving communication topology. For automated verification of properties of DCS, finitary abstractions based on exploiting symmetry can be employed. However, these abstractions give rise to spurious behaviour that often inhibits to successfully prove relevant properties. In this paper, we propose to combine a particular finitary abstraction with global system invariants obtained by abstract interpretation. These system invariants establish an over-approximation of possible communication topologies occurring at runtime, which can be used to identify and exclude spurious behaviour introduced by the finitary abstraction, which is thereby refined. Based on a running example of car platooning, we demonstrate that our approach allows to verify temporal DCS properties that no technique in isolation is able to prove.

show abstract

Specification and Verification of Dynamic Communication Systems

Abstract: Dynamic communication systems (DCS)

Cited by 11 publications

References 28 publications

Specifying, Implementing and Verifying Layered Network Protocols

Specifying, Implementing and Verifying Layered Network Protocols

Static Program Analysis for Security

Mind the Shapes: Abstraction Refinement Via Topology Invariants

Contact Info

Product

Resources

About