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

Spencer P. Florence

dblp:169/7020 · DBLP profile ↗
← Back
4ranked-venue papers
3as 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 · 4 · 3 first-author

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
2 papers
Programming languages and type systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%
Human-computer interaction and pervasive computing
1 paper
Usability and user experience research · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
equational logic
0.412019
A calculus for Esterel: if can, can. if no can, no can · Proc. ACM Program. Lang. 2019
Programming languages and type systems › domain-specific languages › synchronous languages
esterel
0.412019
A calculus for Esterel: if can, can. if no can, no can · Proc. ACM Program. Lang. 2019
Programming languages and type systems › language semantics › formal semantics
operational semantics
0.412019
A calculus for Esterel: if can, can. if no can, no can · Proc. ACM Program. Lang. 2019
Programming languages and type systems › domain-specific languages
synchronous languages
0.412019
A calculus for Esterel: if can, can. if no can, no can · Proc. ACM Program. Lang. 2019
Programming languages and type systems
domain-specific languages
0.312018
POP-PL: A Patient-Oriented Prescription Programming Language · ACM Trans. Program. Lang. Syst. 2018
Embedded and real-time systems › critical systems
safety-critical systems
0.112019
A calculus for Esterel: if can, can. if no can, no can · Proc. ACM Program. Lang. 2019
Medical and health informatics
clinical decision support
0.112018
POP-PL: A Patient-Oriented Prescription Programming Language · ACM Trans. Program. Lang. Syst. 2018
Usability and user experience research › psychology of programming
programming language usability
0.112018
POP-PL: A Patient-Oriented Prescription Programming Language · ACM Trans. Program. Lang. Syst. 2018

Methods — techniques the papers use, named apart from their topics

user evaluation · 1.0language design · 1.0equational rewriting · 0.8
YearPublicationVenuePosition
2019 A calculus for Esterel: if can, can. if no can, no can
abstract
The language Esterel has found success in many safety-critical applications, such as fly-by-wire systems and nuclear power plant control software. Its imperative style is natural to programmers building such systems and its precise semantics makes it work well for reasoning about programs. Existing semantics of Esterel generally fall into two categories: translation to Boolean circuits, or operational semantics that give a procedure for running a whole program. In contrast, equational theories enable reasoning about program behavior via equational rewrites at the source level. Such theories form the basis for proofs of transformations inside compilers or for program refactorings, and defining program evaluation syntactically. This paper presents the first such equational calculus for Esterel. It also illustrates the calculus’s usefulness with a series of example equivalences and discuss how it enabled us to find bugs in Esterel implementations.
Spencer P. Florence, Shu-Hung You, Jesse A. Tov, Robert Bruce Findler
Proc. ACM Program. Lang.1
2018 POP-PL: A Patient-Oriented Prescription Programming Language
abstract
A medical prescription is a set of health care instructions that govern the plan of care for an individual patient, which may include orders for drug therapy, diet, clinical assessment, and laboratory testing. Clinicians have long used algorithmic thinking to describe and implement prescriptions but without the benefit of a formal programming language. Instead, medical algorithms are expressed using a natural language patois, flowcharts, or as structured data in an electronic medical record system. The lack of a prescription programming language inhibits expressiveness; results in prescriptions that are difficult to understand, hard to debug, and awkward to reuse; and increases the risk of fatal medical error. This article reports on the design and evaluation of Patient-Oriented Prescription Programming Language (POP-PL), a domain-specific programming language designed for expressing prescriptions. The language is based around the idea that programs and humans have complementary strengths that, when combined properly, can make for safer, more accurate performance of prescriptions. Use of POP-PL facilitates automation of certain low-level vigilance tasks, freeing up human cognition for abstract thinking, compassion, and human communication. We implemented this language and evaluated its design attempting to write prescriptions in the new language and evaluated its usability by assessing whether clinicians can understand and modify prescriptions written in the language. We found that some medical prescriptions can be expressed in a formal domain-specific programming language, and we determined that medical professionals can understand and correctly modify programs written in POP-PL. We also discuss opportunities for refining and further developing POP-PL.
Spencer P. Florence, Burke Fetscher, Matthew Flatt, William H. Temps, Vincent St-Amour, Tina Kiguradze, Dennis P. West, Charlotte Niznik, Paul R. Yarnold, Robert Bruce Findler, Steven M. Belknap
ACM Trans. Program. Lang. Syst.1
2017 Herbarium Racketensis: a stroll through the woods (functional pearl)
abstract
Domain-specific languages are the ultimate abstraction, dixit Paul Hudak. But what abstraction should we use to build such ultimate abstractions? What is sauce for the goose is sauce for the gander: a language, of course! Racket is the ultimate abstraction-abstraction, a platform for quickly and easily building new ultimate abstractions. This pearl demonstrates Racket's power by taking a leisurely walk through the implementation of a DSL for Lindenmayer systems, the computational model par excellence of theoretical botany.
Vincent St-Amour, Daniel Feltey, Spencer P. Florence, Shu-Hung You, Robert Bruce Findler
Proc. ACM Program. Lang.3
2015 POP-PL: a patient-oriented prescription programming language
abstract
Medical professionals have long used algorithmic thinking to describe and implement health care processes without the benefit of the conceptual framework provided by a programming language. Instead, medical algorithms are expressed using English, flowcharts, or data tables. This results in prescriptions that are difficult to understand, hard to debug, and awkward to reuse. This paper reports on the design and evaluation of a domain-specific programming language, POP-PL for expressing medical algorithms. The design draws on the experience of researchers in two disciplines, programming languages and medicine. The language is based around the idea that programs and humans have complementary strengths, that when combined can make for safer, more accurate performance of prescriptions. We implemented a prototype of our language and evaluated its design by writing prescriptions in the new language and administering a usability survey to medical professionals. This formative evaluation suggests that medical prescriptions can be conveyed by a programming language's mode of expression and provides useful information for refining the language. Analysis of the survey results suggests that medical professionals can understand and correctly modify programs in POP-PL.
Spencer P. Florence, Burke Fetscher, Matthew Flatt, William H. Temps, Tina Kiguradze, Dennis P. West, Charlotte Niznik, Paul R. Yarnold, Robert Bruce Findler, Steven M. Belknap
GPCE1