CSL
2006
Springer
15 years 7 months ago
2006
Springer
145
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
127
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
CSL
2006
Springer
15 years 7 months ago
2006
Springer
We define a hierarchy of term systems Tk by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove Tk NCk Tk+1 , for ...
100
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...