EDBT 2026 Demo / reviewers in the wild / expert
Christopher L. Conway
dblp:45/5558
· DBLP profile ↗
6ranked-venue papers
4as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 6 · 4 first-authorTheory of computation · 3 · 2 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
3 papers |
Program verification · 39% Concurrent programming · 26% Program analysis · 23% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% |
Topics — the 6 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking
satisfiability modulo theories |
0.1 | 1 | 2011 | CVC4 · CAV 2011 |
Concurrent programming › concurrency models
asynchronous programming |
0.1 | 1 | 2007 | Programming asynchronous layers with CLARITY · ESEC/SIGSOFT FSE 2007 |
Programming languages and type systems
language design |
0.1 | 1 | 2007 | Programming asynchronous layers with CLARITY · ESEC/SIGSOFT FSE 2007 |
Program verification › automated verification
incremental verification |
0.1 | 1 | 2005 | Incremental Algorithms for Inter-procedural Analysis of Safety Properties · CAV 2005 |
Program analysis › static analysis
interprocedural analysis |
0.1 | 1 | 2005 | Incremental Algorithms for Inter-procedural Analysis of Safety Properties · CAV 2005 |
Program verification
safety verification |
0.1 | 1 | 2005 | Incremental Algorithms for Inter-procedural Analysis of Safety Properties · CAV 2005 |
Methods — techniques the papers use, named apart from their topics
separation logic · 0.1refinement · 0.1incremental analysis · 0.1data flow analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | CVC4
Clark W. Barrett, Christopher L. Conway, Morgan Deters, Liana Hadarean, Dejan Jovanovic, Tim King 0001, Andrew Reynolds 0001, Cesare Tinelli |
CAV | 2 |
| 2010 | Verifying Low-Level Implementations of High-Level Datatypes
Christopher L. Conway, Clark W. Barrett |
CAV | 1 |
| 2008 | Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors
Christopher L. Conway, Dennis Dams, Kedar S. Namjoshi, Clark W. Barrett |
SAS | 1 |
| 2007 | Programming asynchronous layers with CLARITYabstractAsynchronous systems programs are usually written in an event-driven style which is tailored for performance rather than analyzability. Such programs have non-sequential control ow and make heavy use of heap data structures to store and retrieve state related to pending operations. As a result, existing tools that analyze sequential programs are ine ective in analyzing asynchronous systems components. We describe clarity, a programming language that enables analyzable design of asynchronous components. clarity has three novel features: (1) Nonblocking function calls that allow event-driven code to be written in a sequential style. If a blocking statement is encountered during the execution of such a call, the call returns and the remainder of the operation is automatically queued for later execution. (2) Coords, a set of high-level coordination primitives, encapsulate common interactions between asynchronous components and make high-level coordination protocols explicit. (3) Linearity annotations delegate coord protocol obligations to exactly one thread at each asynchronous function call, transforming a concurrent analysis problem into a sequential one. We demonstrate how these language features enable both a more intuitive expression of program logic and more e ective program analysis most checking is done using simple sequential analysis. We describe our experience in developing, testing, and analyzing a network device driver using clarity. 1. Prakash Chandrasekaran, Christopher L. Conway, Joseph M. Joy, Sriram K. Rajamani |
ESEC/SIGSOFT FSE | 2 |
| 2005 | Incremental Algorithms for Inter-procedural Analysis of Safety Properties
Christopher L. Conway, Kedar S. Namjoshi, Dennis Dams, Stephen A. Edwards |
CAV | 1 |
| 2004 | NDL: a domain-specific language for device driversabstractDevice drivers are difficult to write and error-prone. They are usually written in C, a fairly low-level language with minimal type safety and little support for device semantics. As a result, they have become a major source of instability in operating system code.This paper presents NDL, a language for device drivers. NDL provides high-level abstractions of device resources and constructs tailored to describing common device driver operations. We show that NDL allows for the coding of a semantically correct driver with a code size reduction of more than 50% and a minimal impact on performance. Christopher L. Conway, Stephen A. Edwards |
LCTES | 1 |