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