ConSpec

ConSpec - A formal language for policy specification The paper presents ConSpec, an automata-based policy specification language. The language trades off clean semantics to language expressiveness; a formal semantics for the language is provided as security automata. ConSpec specifications can be used at different stages of the application lifecycle, rendering possible the formalization of various policy enforcement techniques

This software is also peer reviewed by journal TOMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 5 articles , 1 standard article )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Grigore, Radu; Distefano, Dino; Petersen, Rasmus Lerchedahl; Tzevelekos, Nikos: Runtime verification based on register automata (2013)
  2. Costa, Gabriele; Matteucci, Ilaria: Gate automata-driven run-time enforcement (2012)
  3. Aktug, Irem; Dam, Mads; Gurov, Dilian: Provably correct runtime monitoring (2009)
  4. Bielova, N.; Dragoni, N.; Massacci, F.; Naliuka, K.; Siahaan, I.: Matching in security-by-contract for mobile code (2009)
  5. Aktug, Irem; Naliuka, Katsiaryna: ConSpec - A formal language for policy specification (2008)