Back to Results
First PageMeta Content
Mathematics / Logic in computer science / Operational semantics / Finite-state machine / Model theory / Algorithm / Theoretical computer science / Applied mathematics / Automata theory


Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis
Add to Reading List

Document Date: 2014-01-06 09:40:27


Open Document

File Size: 2,82 MB

Share Result on Facebook

City

Springer-Verlag / Amsterdam / Jones / Hochstadt / New York / /

Company

Ayers A.E. / Cambridge University Press / MIT Press / NATO ASI Series F. IOS Press / /

Currency

USD / cent / /

/

Facility

Carnegie Mellon University / Northeastern University / University of Utah / Aarhus University / Massachusetts Institute of Technology / /

IndustryTerm

non-deterministic state-transition systems / concrete implementation technology / least-fixed-point solution / machinery / computing / low-level deterministic state-transition systems / software systems / /

NaturalFeature

Cont = mt / /

Organization

North Atlantic Treaty Organization / Cambridge University / Aarhus University / National Science Foundation / Department of Computer Science / Northeastern University / Boston / University of Utah / Salt lake City / Carnegie Mellon University / Massachusetts Institute of Technology / /

Person

Mitchell Wand / Jan Midtgaard / Matthew Might Abstract Predictive / Matthias Felleisen / Sam TobinHochstadt / David Van Horn / Matthew Might / /

/

Position

correct low-level evaluator / unified lattice model for static analysis / generic abstract interpreter / Interpreter / /

ProgrammingLanguage

E / Java / Ruby / C / Python / JavaScript / /

ProvinceOrState

Utah / North Dakota / New York / Massachusetts / /

Technology

Functional Programming / concrete implementation technology / av / design algorithms / Java / dom / simulation / /

SocialTag