Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Advanced symbolic analysis for compilers. New techniques and algorithms for symbolic program analysis and optimization.

From MaRDI portal
Publication:1396163
Jump to:navigation, search

zbMath1042.68034MaRDI QIDQ1396163

Thomas Fahringer, Bernhard Scholz

Publication date: 30 June 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)


zbMATH Keywords

semanticsprogram analysisparallelizing compilersflow graph


Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)


Related Items (3)

Reflexive transitive invariant relations: A basis for computing loop functions ⋮ Mathematics for reasoning about loop functions ⋮ Real-time properties of indirect recursive procedures


Uses Software

  • PVM
  • FADAlib



This page was built for publication: Advanced symbolic analysis for compilers. New techniques and algorithms for symbolic program analysis and optimization.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1396163&oldid=13553583"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki