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

Lee Blaine

dblp:06/6867 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

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

Software 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
Program synthesis and code generation · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Program synthesis and code generation
domain-specific code generation
0.011998
Planware - Domain-Specific Synthesis of High-Performance Schedulers · ASE 1998
Mathematical optimization
scheduling
0.011998
Planware - Domain-Specific Synthesis of High-Performance Schedulers · ASE 1998

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

theorem proving · 0.0formal refinement · 0.0constraint propagation · 0.0
YearPublicationVenuePosition
1998 Planware - Domain-Specific Synthesis of High-Performance Schedulers
abstract
Planware is a domain-specific generator of high-performance scheduling software, currently being developed at the Kestrel Institute. Architecturally, Planware is an extension of the Specware system with domain-independent and domain-dependent parts. The domain-independent part includes a general algorithm design facility (including mechanisms to synthesize global-search and constraint propagation algorithms), as well as support for theorem-proving and witness finding. The domain-dependent part includes scheduling domain knowledge and architecture representations, and other domain-specific refinement knowledge that relates the scheduling domain to general algorithm design and data type refinement. Using Planware, the user interactively specifies a problem and then the system automatically generates a formal specification and refines it.
Lee Blaine, Limei Gilham, Douglas R. Smith, Stephen J. Westfold
ASE1