BACK TO INDEX

Publications of year 2007
Thesis
  1. Ulf Norell. Towards a Practical Programming Language Based on Dependent Type Theory. PhD Thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-412 96 Göteborg, Sweden, September 2007. Keyword(s): Agda.
    Abstract:
    Dependent type theories [ML72] have a long history of being used for theorem proving. One aspect of type theory which makes it very powerful as a proof language is that it mixes deduction with computation. This also makes type theory a good candidate for programming extemdash the strength of the type system allows properties of programs to be stated and established, and the computational properties provide semantics for the programs.

    @phdthesis{norellPracticalProgrammingLanguage2007,
    title = {Towards a Practical Programming Language Based on Dependent Type Theory},
    author = {Norell, Ulf},
    year = {2007},
    month = sep,
    address = {{SE-412 96 G\"oteborg, Sweden}},
    abstract = {Dependent type theories [ML72] have a long history of being used for theorem proving. One aspect of type theory which makes it very powerful as a proof language is that it mixes deduction with computation. This also makes type theory a good candidate for programming	extemdash the strength of the type system allows properties of programs to be stated and established, and the computational properties provide semantics for the programs.},
    url = {https://wcl.cs.rpi.edu/pilots/library/papers/TAGGED/4230-Norell (2007) - Towards a practical programming language based on dependent type theory.pdf},
    keywords = {Agda},
    school = {Department of Computer Science and Engineering, Chalmers University of Technology},
    type = {{{PhD Thesis}}} 
    }
    


Articles in journal, book chapters
  1. Yannick Moy and Claude Marché. Inferring Local (Non-) Aliasing and Strings for Memory Safety. Heap Analysis and Verification (HAV'07), pp 35-51, 2007. Keyword(s): abstract interpretation.
    @article{moyInferringLocalNon2007,
    title = {Inferring Local (Non-) Aliasing and Strings for Memory Safety},
    author = {Moy, Yannick and March{\'e}, Claude},
    year = {2007},
    pages = {35--51},
    url = {https://wcl.cs.rpi.edu/pilots/library/papers/TAGGED/4708-Moy_Marche (2007) - Inferring local (non-) aliasing and strings for memory safety.pdf},
    journal = {Heap Analysis and Verification (HAV'07)},
    keywords = {abstract interpretation} 
    }
    


  2. Sumit Gulwani and Ashish Tiwari. An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software. In Werner Damm and Holger Hermanns, editors, Computer Aided Verification, volume 4590, pages 379-392. Springer Berlin Heidelberg, Berlin, Heidelberg, 2007. ISBN: 978-3-540-73367-6. Keyword(s): abstract interpretation.
    @incollection{gulwaniAbstractDomainAnalyzing2007,
    title = {An {{Abstract Domain}} for {{Analyzing Heap}}-{{Manipulating Low}}-{{Level Software}}},
    booktitle = {Computer {{Aided Verification}}},
    author = {Gulwani, Sumit and Tiwari, Ashish},
    editor = {Damm, Werner and Hermanns, Holger},
    year = {2007},
    volume = {4590},
    pages = {379--392},
    publisher = {{Springer Berlin Heidelberg}},
    address = {{Berlin, Heidelberg}},
    doi = {10.1007/978-3-540-73368-3_42},
    url = {https://wcl.cs.rpi.edu/pilots/library/papers/TAGGED/4702-Gulwani_Tiwari (2007) - An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software.pdf},
    isbn = {978-3-540-73367-6},
    keywords = {abstract interpretation} 
    }
    


  3. Osman Hasan and Sofiène Tahar. Formalization of Continuous Probability Distributions. In Frank Pfenning, editor, Automated Deduction - CADE-21, volume 4603, pages 3-18. Springer Berlin Heidelberg, Berlin, Heidelberg, 2007. ISBN: 978-3-540-73594-6 978-3-540-73595-3. ISSN: 0302-9743, 1611-3349. Keyword(s): HOL, probability.
    Abstract:
    In order to overcome the limitations of state-of-the-art simulation based probabilistic analysis, we propose to perform probabilistic analysis within the environment of a higher-order-logic theorem prover. The foremost requirement for conducting such analysis is the formalization of probability distributions. In this report, we present a methodology for the formalization of continuous probability distributions for which the inverse of the cumulative distribution function can be expressed in a closed mathematical form. Our methodology is primarily based on the formalization of the Standard Uniform random variable, cumulative distribution function properties and the Inverse Transform method. The report presents all this formalization using the HOL theorem prover. In order to illustrate the practical effectiveness of our methodology, the formalization of a few continuous probability distributions has also been included.

    @incollection{hasanFormalizationContinuousProbability2007,
    title = {Formalization of {{Continuous Probability Distributions}}},
    booktitle = {Automated {{Deduction}} -{} {{CADE}}-21},
    author = {Hasan, Osman and Tahar, Sofi{\`e}ne},
    editor = {Pfenning, Frank},
    year = {2007},
    volume = {4603},
    pages = {3--18},
    publisher = {{Springer Berlin Heidelberg}},
    address = {{Berlin, Heidelberg}},
    issn = {0302-9743, 1611-3349},
    doi = {10.1007/978-3-540-73595-3_2},
    abstract = {In order to overcome the limitations of state-of-the-art simulation based probabilistic analysis, we propose to perform probabilistic analysis within the environment of a higher-order-logic theorem prover. The foremost requirement for conducting such analysis is the formalization of probability distributions. In this report, we present a methodology for the formalization of continuous probability distributions for which the inverse of the cumulative distribution function can be expressed in a closed mathematical form. Our methodology is primarily based on the formalization of the Standard Uniform random variable, cumulative distribution function properties and the Inverse Transform method. The report presents all this formalization using the HOL theorem prover. In order to illustrate the practical effectiveness of our methodology, the formalization of a few continuous probability distributions has also been included.},
    url = {https://wcl.cs.rpi.edu/pilots/library/papers/TAGGED/4309-Hasan_Tahar (2007) - Formalization of Continuous Probability Distributions.pdf},
    isbn = {978-3-540-73594-6 978-3-540-73595-3},
    keywords = {HOL,probability},
    
    }
    



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.




Last modified: Wed Mar 5 16:20:33 2025
Author: varelc.


This document was translated from BibTEX by bibtex2html