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