Computational logical frameworks and generic program analysis technologies

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The technologies developed to solve the verifying compiler grand challenge should be generic, that is, not tied to a particular language but widely applicable to many languages. Such technologies should also be semantics-based, that is, based on a rigorous formal semantics of the languages.

Original languageEnglish (US)
Title of host publicationVerified Software
Subtitle of host publicationTheories, Tools, Experiments - First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Revised Selected Papers and Discussions
Pages256-267
Number of pages12
DOIs
StatePublished - 2008
Event1st IFIP TC 2/WG 2.3 Conference on Verified Software: Theories, Tools, Experiments, VSTTE 2005 - Zurich, Switzerland
Duration: Oct 10 2005Oct 13 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4171 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st IFIP TC 2/WG 2.3 Conference on Verified Software: Theories, Tools, Experiments, VSTTE 2005
CountrySwitzerland
CityZurich
Period10/10/0510/13/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Computational logical frameworks and generic program analysis technologies'. Together they form a unique fingerprint.

Cite this