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...
Main Authors: | Schäfer, M, Ekman, T, Moor, O |
---|---|
Other Authors: | Castagna, G |
Format: | Conference item |
Published: |
Springer
2009
|
Similar Items
-
Formalising and Verifying Reference Attribute Grammars in Coq
by: Schäfer, M, et al.
Published: (2009) -
Verifying the correct composition of distributed components: Formalisation and Tool
by: Ludovic Henrio, et al.
Published: (2015-02-01) -
A systematic derivation of the STG machine verified in Coq
by: Pirog, M, et al.
Published: (2010) -
Formalising policies for insider-threat detection: A tripwire grammar
by: Agrafiotis, I, et al.
Published: (2017) -
Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
by: Burak Ekici, et al.
Published: (2019-08-01)