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 |
---|---|
מחברים אחרים: | Castagna, G |
פורמט: | Conference item |
יצא לאור: |
Springer
2009
|
פריטים דומים
-
Formalising and Verifying Reference Attribute Grammars in Coq
מאת: Schäfer, M, et al.
יצא לאור: (2009) -
Verifying the correct composition of distributed components: Formalisation and Tool
מאת: Ludovic Henrio, et al.
יצא לאור: (2015-02-01) -
A systematic derivation of the STG machine verified in Coq
מאת: Pirog, M, et al.
יצא לאור: (2010) -
Formalising policies for insider-threat detection: A tripwire grammar
מאת: Agrafiotis, I, et al.
יצא לאור: (2017) -
Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
מאת: Burak Ekici, et al.
יצא לאור: (2019-08-01)