Program Analysis (an Appetizer)
by Flemming Nielson, Hanne Riis Nielson
Publisher: arXiv.org 2020
Number of pages: 208
Description:
This book is an introduction to program analysis that is meant to be elementary. Rather than using flow charts as the model of programs, the book uses program graphs as the model of programs. In our experience this makes the underlying ideas more accessible to our computer science and computer engineering students.
Download or read it online for free here:
Download link
(4.6MB, PDF)
Similar books
Formal Language Theory for Natural Language Processing
by Shuly Wintner - ESSLLI
This text is a mild introduction to Formal Language Theory for students with little or no background in formal systems. The motivation is Natural Language Processing, and the presentation is geared towards NLP applications, with extensive examples.
(11146 views)
by Shuly Wintner - ESSLLI
This text is a mild introduction to Formal Language Theory for students with little or no background in formal systems. The motivation is Natural Language Processing, and the presentation is geared towards NLP applications, with extensive examples.
(11146 views)
Understanding Programming Languages
by Monti Ben-Ari - John Wiley & Sons
The book explains what alternatives are available to the language designer, how language constructs should be used for safety and readability, how language constructs are implemented, the role of language in expressing and enforcing abstractions.
(17289 views)
by Monti Ben-Ari - John Wiley & Sons
The book explains what alternatives are available to the language designer, how language constructs should be used for safety and readability, how language constructs are implemented, the role of language in expressing and enforcing abstractions.
(17289 views)
The Theory of Languages and Computation
by Jean Gallier, Andrew Hicks - University of Pennsylvania
From the table of contents: Automata; Formal Languages (A Grammar for Parsing English, Context-Free Grammars, Derivations and Context-Free Languages, Normal Forms for Context-Free Grammars, Chomsky Normal Form, ...); Computability; Current Topics.
(9488 views)
by Jean Gallier, Andrew Hicks - University of Pennsylvania
From the table of contents: Automata; Formal Languages (A Grammar for Parsing English, Context-Free Grammars, Derivations and Context-Free Languages, Normal Forms for Context-Free Grammars, Chomsky Normal Form, ...); Computability; Current Topics.
(9488 views)
The Design and Implementation of Probabilistic Programming Languages
by Noah D. Goodman, Andreas Stuhlmüller - dippl.org
This book explains how to implement PPLs by lightweight embedding into a host language. We illustrate this by designing WebPPL, a small PPL embedded in Javascript. We show how to implement several algorithms for universal probabilistic inference.
(7182 views)
by Noah D. Goodman, Andreas Stuhlmüller - dippl.org
This book explains how to implement PPLs by lightweight embedding into a host language. We illustrate this by designing WebPPL, a small PPL embedded in Javascript. We show how to implement several algorithms for universal probabilistic inference.
(7182 views)