Sciweavers

421 search results - page 48 / 85
» CSL
Sort
View
CSL
2004
Springer
15 years 1 months ago
A Functional Scenario for Bytecode Verification of Resource Bounds
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
Roberto M. Amadio, Solange Coupet-Grimal, Silvano ...
CSL
2004
Springer
15 years 1 months ago
Pfaffian Hybrid Systems
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
Margarita V. Korovina, Nicolai Vorobjov
CSL
2006
Springer
15 years 1 months ago
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
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...
Vincent Atassi, Patrick Baillot, Kazushige Terui
CSL
2006
Springer
15 years 1 months ago
Reasoning About States of Probabilistic Sequential Programs
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...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
CSL
2006
Springer
15 years 1 months ago
Universality Results for Models in Locally Boolean Domains
Abstract. In [6] J. Laird has shown that an infinitary sequential extenPCF has a fully abstract model in his category of locally boolean domains (introduced in [8]). In this paper ...
Tobias Löw, Thomas Streicher