Formalising and Verifying Reference Attribute Grammars in Coq.
Reference attribute grammars are a powerful formalism for concisely specifying and implementing static analyses. While they have proven their meritin practical applications, no attempt has so far been made to rigorously verify correctness properties of the resulting systems. We present a general met...
Huvudupphovsmän: | Schäfer, M, Ekman, T, Moor, O |
---|---|
Övriga upphovsmän: | Castagna, G |
Materialtyp: | Conference item |
Publicerad: |
Springer
2009
|
Liknande verk
-
Formalising and Verifying Reference Attribute Grammars in Coq
av: Schäfer, M, et al.
Publicerad: (2009) -
Verifying the correct composition of distributed components: Formalisation and Tool
av: Ludovic Henrio, et al.
Publicerad: (2015-02-01) -
A systematic derivation of the STG machine verified in Coq
av: Pirog, M, et al.
Publicerad: (2010) -
Formalising policies for insider-threat detection: A tripwire grammar
av: Agrafiotis, I, et al.
Publicerad: (2017) -
Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
av: Burak Ekici, et al.
Publicerad: (2019-08-01)