Edmund Clarke

From MaRDI portal
Person:526749

Available identifiers

zbMath Open clarke.edmund-melson-junWikidataQ92819 ScholiaQ92819MaRDI QIDQ526749

List of research outcomes





PublicationDate of PublicationType
Analytica -- an experiment in combining theorem proving and symbolic computation2024-06-21Paper
Combining symbolic computation and theorem proving: Some problems of Ramanujan2020-01-21Paper
https://portal.mardi4nfdi.de/entity/Q52270612019-08-05Paper
Introduction to Model Checking2018-07-20Paper
From non-preemptive to preemptive scheduling using synchronization synthesis2018-03-01Paper
SMT-Based Analysis of Virtually Synchronous Distributed Hybrid Systems2017-05-19Paper
Delta-Decidability over the Reals2017-05-16Paper
Rare-event verification for stochastic hybrid systems2017-05-16Paper
Learning Probabilistic Systems from Tree Samples2017-05-16Paper
From non-preemptive to preemptive scheduling using synchronization synthesis2017-05-15Paper
Bayesian statistical model checking with application to Simulink/Stateflow verification2017-05-10Paper
Solving QBF with counterexample guided refinement2016-03-08Paper
$$2^5$$ Years of Model Checking2015-12-03Paper
Counterexample-guided abstraction refinement for symbolic model checking2015-11-12Paper
Bayesian statistical model checking with application to Stateflow/Simulink verification2014-06-30Paper
Automated compositional abstraction refinement for concurrent C programs: a two-level approach2013-08-30Paper
Solving QBF with Counterexample Guided Refinement2013-08-12Paper
dReal: An SMT Solver for Nonlinear Theories over the Reals2013-06-14Paper
δ-Complete Decision Procedures for Satisfiability over the Reals2012-09-05Paper
Computational Modeling and Verification of Signaling Pathways in Cancer2012-06-08Paper
Statistical Model Checking for Cyber-Physical Systems2011-10-07Paper
Quantifier Elimination over Finite Fields Using Gröbner Bases2011-07-08Paper
Statistical Verification of Probabilistic Properties with Unbounded Until2011-05-12Paper
A Non-prenex, Non-clausal QBF Solver with Game-State Learning2010-09-29Paper
On simulation-based probabilistic model checking of mixed-analog circuits2010-09-16Paper
An Abstraction Technique for Real-Time Verification2010-06-02Paper
Computer Aided Verification2010-04-20Paper
Verification: Theory and Practice2010-03-23Paper
Correct Hardware Design and Verification Methods2010-02-05Paper
Computing differential invariants of hybrid systems as fixed points2009-11-23Paper
Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations2009-11-23Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
Verification, Model Checking, and Abstract Interpretation2009-05-15Paper
Integrated Formal Methods2009-05-07Paper
Learning Minimal Separating DFA’s for Compositional Verification2009-03-31Paper
The Image Computation Problem in Hybrid Systems Model Checking2009-03-11Paper
Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction2009-03-11Paper
Arithmetic Strengthening for Shape Analysis2009-03-03Paper
Model Checking – My 27-Year Quest to Overcome the State Explosion Problem2009-01-27Paper
Verification of Supervisory Control Software Using State Proximity and Merging2008-09-02Paper
Verification of evolving software via component substitutability analysis2008-07-30Paper
The Birth of Model Checking2008-07-15Paper
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations2008-07-15Paper
Computing Differential Invariants of Hybrid Systems as Fixedpoints2008-07-15Paper
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC2008-07-15Paper
Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems2008-04-11Paper
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages2008-04-11Paper
State/Event Software Verification for Branching-Time Specifications2007-11-29Paper
SAT-Based Compositional Verification Using Lazy Learning2007-11-29Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
Program Compatibility Approaches2007-09-11Paper
Satisfiability Checking of Non-clausal Formulas Using General Matings2007-09-04Paper
Verification of SpecC using predicate abstraction2007-06-21Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-05-02Paper
Verification, Model Checking, and Abstract Interpretation2007-02-12Paper
Concurrent software verification with states, events, and deadlocks2006-10-25Paper
Computer Aided Verification2006-01-10Paper
FM 2005: Formal Methods2006-01-10Paper
Hybrid Systems: Computation and Control2005-11-11Paper
Tools and Algorithms for the Construction and Analysis of Systems2005-11-10Paper
Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems2005-10-19Paper
An Iterative Framework for Simulation Conformance2005-10-18Paper
CONCUR 2004 - Concurrency Theory2005-08-23Paper
Predicate abstraction of ANSI-C programs using SAT2004-11-22Paper
Efficient verification of sequential and concurrent C programs2004-11-22Paper
https://portal.mardi4nfdi.de/entity/Q48188182004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q48175332004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q47384602004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44278942003-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44179232003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q48049092003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q48049012003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q47872402003-01-09Paper
Verification of out-of-order processor designs using model Checking and a light-weight completion function2002-07-08Paper
Bounded model checking using satisfiability solving2002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q27540812001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q27540792001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45189082001-08-05Paper
Model checking.2001-01-01Paper
The Verus language: Representing time efficiently with BDDs2000-12-12Paper
https://portal.mardi4nfdi.de/entity/Q44943912000-12-11Paper
NuSMV: A new symbolic model checker2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42555701999-08-17Paper
https://portal.mardi4nfdi.de/entity/Q42555511999-08-17Paper
https://portal.mardi4nfdi.de/entity/Q42555651999-08-17Paper
Analytica --- an experiment in combining theorem proving and symbolic computation1999-06-29Paper
A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata1999-02-25Paper
Analysis and verification of real-time systems using quantitative symbolic algorithms1999-01-01Paper
State space reduction using partial order techniques1999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48858841997-02-17Paper
A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40370841993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40276221993-02-21Paper
PARTHENON: A parallel theorem prover for non-horn clauses1992-09-27Paper
Symbolic model checking: \(10^{20}\) states and beyond1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q32040661989-01-01Paper
Reasoning about networks with many identical finite state processes1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32040341989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47333981989-01-01Paper
Reasoning about procedures as parameters in the language L41989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42075671989-01-01Paper
Characterizing finite Kripke structures in propositional temporal logic1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30289841987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37432541987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47219631986-01-01Paper
Automatic verification of finite-state concurrent systems using temporal logic specifications1986-01-01Paper
Automatic Verification of Sequential Circuits Using Temporal Logic1986-01-01Paper
The complexity of propositional linear temporal logics1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37048861985-01-01Paper
Hierarchical verification of asynchronous circuits using temporal logic1985-01-01Paper
Can message buffers be axiomatized in linear temporal logic?1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33268191984-01-01Paper
The characterization problem for Hoare logics1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33293971984-01-01Paper
Effective Axiomatizations of Hoare Logics1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33366751982-01-01Paper
Using branching time temporal logic to synthesize synchronization skeletons1982-01-01Paper
Task management in Ada—A critical evaluation for real-time multiprocessors1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39063861980-01-01Paper
Synthesis of Resource Invariants for Concurrent Programs1980-01-01Paper
Proving correctness of coroutines without history variables1980-01-01Paper
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems1979-01-01Paper
Program invariants as fixedpoints1979-01-01Paper

Research outcomes over time

This page was built for person: Edmund Clarke