First Page | Document Content | |
---|---|---|
Date: 2014-09-03 04:27:20Formal methods Type theory Dependently typed programming Theoretical computer science Logic in computer science Coq Abstract interpretation CurryHoward correspondence Predicate transformer semantics Proof-carrying code Correctness Lines of Action | Proof-Carrying Code from Certied Abstract Interpretation and Fixpoint Compression Frédéric Besson and Thomas Jensen and David Pichardie Irisa, Campus de Beaulieu, FRennes, France AbstractAdd to Reading ListSource URL: people.rennes.inria.frDownload Document from Source WebsiteFile Size: 387,82 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |