Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

James T. Perconti

dblp:139/2711 · also Jamie Perconti · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 75% Program verification · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › interoperability
language interoperability
0.312017
FunTAL: reasonably mixing a functional language with assembly · PLDI 2017
Programming languages and type systems
logical relations
0.312017
FunTAL: reasonably mixing a functional language with assembly · PLDI 2017
Program verification
modular reasoning
0.312017
FunTAL: reasonably mixing a functional language with assembly · PLDI 2017
Programming languages and type systems › type systems › static typing
typed assembly language
0.312017
FunTAL: reasonably mixing a functional language with assembly · PLDI 2017
YearPublicationVenuePosition
2019 Under Control: Compositionally Correct Closure Conversion with Mutable State
abstract
Compositional compiler verification aims to ensure correct compilation of components, not just whole programs. Perconti and Ahmed [2014] propose a methodology for compositional compiler correctness that supports linking with code of arbitrary provenance. In particular, they allow compiled components to be linked with code whose functionality cannot even be expressed in the compiler's own source language. The essence of their approach is to define a multi-language system that formalizes interoperability between the source and target languages so that compiler correctness can be stated as contextual equivalence in the multi-language. They illustrate this methodology on a two-pass type-preserving compiler for a polymorphic language with recursive types.
Phillip Mates, James T. Perconti, Amal Ahmed 0001
PPDP2
2017 FunTAL: reasonably mixing a functional language with assembly
abstract
We present FunTAL, the first multi-language system to formalize safe interoperability between a high-level functional language and low-level assembly code while supporting compositional reasoning about the mix. A central challenge in developing such a multi-language is bridging the gap between assembly, which is staged into jumps to continuations, and high-level code, where subterms return a result. We present a compositional stack-based typed assembly language that supports components, comprised of one or more basic blocks, that may be embedded in high-level contexts. We also present a logical relation for FunTAL that supports reasoning about equivalence of high-level components and their assembly replacements, mixed-language programs with callbacks between languages, and assembly components comprised of different numbers of basic blocks.
Daniel Patterson 0001, James T. Perconti, Christos Dimoulas, Amal Ahmed 0001
PLDI2
2014 Verifying an Open Compiler Using Multi-language Semantics
James T. Perconti, Amal Ahmed 0001
ESOP1