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.

Daniel K. Lee

dblp:94/1432 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · unresolved

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

Computer networks · 1Software engineering, systems software and programming languages · 1 · 1 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
1 paper
Programming languages and type systems · 56% Program verification · 44%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Program verification › mechanized verification
mechanized metatheory
0.112007
Towards a mechanized metatheory of standard ML · POPL 2007
Programming languages and type systems › type systems
type soundness
0.112007
Towards a mechanized metatheory of standard ML · POPL 2007
Internet of things and sensor networks
wireless sensor network
0.112005
Avrora: scalable sensor network simulation with precise timing · IPSN 2005
Performance modeling and evaluation › simulation › communication system simulation
sensor network simulation
0.112005
Avrora: scalable sensor network simulation with precise timing · IPSN 2005
Performance modeling and evaluation
simulation
0.112005
Avrora: scalable sensor network simulation with precise timing · IPSN 2005
Programming languages and type systems › functional language
Standard ML
0.012007
Towards a mechanized metatheory of standard ML · POPL 2007

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

instruction-level simulation · 0.1event queue · 0.1twelf · 0.1elaboration semantics · 0.1LF · 0.1
YearPublicationVenuePosition
2007 Towards a mechanized metatheory of standard ML
abstract
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twelf. The internal language is intended to serve as the target of elaboration in an elaborative semantics for Standard ML in the style of Harper and Stone. Therefore, it includes all the programming mechanisms necessary to implement Standard ML, including translucent modules, abstraction, polymorphism, higher kinds, references, exceptions, recursive types, and recursive functions. Our successful formalization of the proof involved a careful interplay between the precise formulations of the various mechanisms, and required the invention of new representation and proof techniques of general interest.
Daniel K. Lee, Karl Crary, Robert Harper 0001
POPL1
2005 Avrora: scalable sensor network simulation with precise timing
abstract
Simulation can be an important step in the development of software for wireless sensor networks and has been the subject of intense research in the past decade. While most previous efforts in simulating wireless sensor networks have focused on protocol-level issues utilizing models of the software implementation, a significant challenge remains in precisely measuring time-dependent properties such as radio channel utilization. One promising approach, first demonstrated by ATEMU, is to simulate the behavior of sensor network programs at the machine code level with cycle-accuracy, but poor performance has so far limited its scalability. In this paper we present Avrora, a cycle-accurate instruction-level sensor network simulator which scales to networks of up to 10,000 nodes and performs as much as 20 times faster than previous simulators with equivalent accuracy, handling as many as 25 nodes in real-time. We show how an event queue can enable efficient instruction-level simulation of microcontroller programs and allow the hidden parallelism in finegrained sensor network simulations to be extracted, once two core synchronization problems are identified and solved. Avrora's ability to measure detailed time-critical phenomena can shed new light on design Issues for large-scale sensor networks.
Ben L. Titzer, Daniel K. Lee, Jens Palsberg
IPSN2