Edmund M. Clarke

Edmund M. Clarke

Auto-generated profile, based on publicly available information

Edmund M. Clarke

Carnegie Mellon University

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2004 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
ECEdmund Clarke
Edmund Clarke
DKDaniel Kroening
Daniel Kroening
NSNatasha Sharygina
Natasha Sharygina
KYKaren Yorav
Karen Yorav

27 August 2013 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
PZPaolo Zuliani
Paolo Zuliani
APAndré Platzer
André Platzer
ECEdmund M. Clarke
Edmund M. Clarke

15 October 2010 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
HGHaijun Gong
Haijun Gong
PZPaolo Zuliani
Paolo Zuliani
AKAnvesh Komuravelli
Anvesh Komuravelli
JFJames R Faeder
James R Faeder
ECEdmund M Clarke
Edmund M Clarke
Recent studies have found that overexpression of the High-mobility group box-1 (HMGB1) protein, in conjunction with its receptors for advanced glycation end products (RAGEs) and toll-like receptors (TLRs), is associated with proliferation of various cancer types, including that of the breast and pancreatic.

1 September 2004 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
SCS. Chaki
S. Chaki
ECE. Clarke
E. Clarke
AGA. Groce
A. Groce
JOJ. Ouaknine
J. Ouaknine
OSOfer Strichman
Ofer Strichman
KYK. Yorav
K. Yorav

27 September 2016 in Formal Methods in System Design
Verified
Journal Article
Open access
PDF file
PČPavol Černý
Pavol Černý
ECEdmund M. Clarke
Edmund M. Clarke
THThomas A. Henzinger
Thomas A. Henzinger
ARArjun Radhakrishna
Arjun Radhakrishna
LRLeonid Ryzhyk
Leonid Ryzhyk
TTThorsten Tarrach
Thorsten Tarrach
We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of sequences produced under a non-preemptive scheduler. We guarantee that our synthesis does not introduce deadlocks and that the synchronization inserted is optimal w.r.t. a given objective function. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and generation of a set of global constraints over synchronization placements. Each model of the global constraints set corresponds to a correctness-ensuring synchronization placement. The placement that is optimal w.r.t. the given objective function is chosen as the synchronization solution. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient. The implicit specification helped us find one concurrency bug previously missed when model-checking using an explicit, user-provided specification. We implemented objective functions for coarse-grained and fine-grained locking and observed that different synchronization placements are produced for our experiments, favoring a minimal number of synchronization operations or maximum concurrency, respectively.

2 September 2015
Verified
Book Chapter
Open access
PDF file
QWQinsi Wang
Qinsi Wang
PZPaolo Zuliani
Paolo Zuliani
SKSoonho Kong
Soonho Kong
SGSicun Gao
Sicun Gao
ECEdmund M. Clarke
Edmund M. Clarke
In this paper, we present a new tool SReach, which solves probabilistic bounded reachability problems for two classes of models of stochastic hybrid systems. The first one is (nonlinear) hybrid automata with parametric uncertainty. The second one is probabilistic hybrid automata with additional randomness for both transition probabilities and variable resets. Standard approaches to reachability problems for linear hybrid systems require numerical solutions for large optimization problems, and become infeasible for systems involving both nonlinear dynamics over the reals and stochasticity. SReach encodes stochastic information by using a set of introduced random variables, and combines \(\delta \)-complete decision procedures and statistical tests to solve \(\delta \)-reachability problems in a sound manner. Compared to standard simulation-based methods, it supports non-deterministic branching, increases the coverage of simulation, and avoids the zero-crossing problem. We demonstrate SReach’s applicability by discussing three representative biological models and additional benchmarks for nonlinear hybrid systems with multiple probabilistic system parameters.