Sciweavers

31 search results - page 6 / 7
» Dependent Types, Theorem Proving, and Applications for a Ver...
Sort
View
TLCA
2009
Springer
14 years 9 days ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer
ICFEM
2010
Springer
13 years 4 months ago
Automating Cut-off for Multi-parameterized Systems
Abstract. Verifying that a parameterized system satisfies certain desired properties amounts to verifying an infinite family of the system instances. This problem is undecidable ...
Youssef Hanna, David Samuelson, Samik Basu, Hrides...
ESOP
2005
Springer
13 years 11 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
POPL
2004
ACM
14 years 6 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
INFOCOM
2012
IEEE
11 years 8 months ago
A theory of cloud bandwidth pricing for video-on-demand providers
—Current-generation cloud computing is offered with usage-based pricing, with no bandwidth capacity guarantees, which is however unappealing to bandwidth-intensive applications s...
Di Niu, Chen Feng, Baochun Li