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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Jamie Stark

dblp:78/615 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 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
Automated reasoning and model checking · 100%

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

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking › theorem proving
proof planning		 0.011999
Towards Automatic Imperative Program Synthesis Through Proof Planning · ASE 1999

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

AI planning · 0.0
YearPublicationVenuePosition
2006 Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
Andrew Ireland, Jamie Stark
 Autom. Softw. Eng.2
1999 Towards Automatic Imperative Program Synthesis Through Proof Planning
abstract
An approach to automatic imperative program synthesis is presented which builds upon Gries' (1981) vision of developing a program and its proof hand in hand. To achieve this vision we rely on the proof planning paradigm, which enables the coupling of both heuristic and deductive components. By formalising structured programming and proof heuristics within the proof planning framework we focus the search for a correct program. Encoding these heuristics within a proof plan and strengthening proof planning, by embedding it within the conventional AI planning paradigm, enables a significant degree of automation.
Jamie Stark, Andrew Ireland
 ASE1