Computer Aided Verification - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319415277, 9783319415284

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Termination Analysis of Probabilistic Programs Through Positivstellensatz’s

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_1 ◽

2016 ◽

pp. 3-22 ◽

Cited By ~ 25

Author(s):

Krishnendu Chatterjee ◽

Hongfei Fu ◽

Amir Kafshdar Goharshady

Keyword(s):

Termination Analysis ◽

Probabilistic Programs

Download Full-text

Automatic Verification of Iterated Separating Conjunctions Using Symbolic Execution

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_22 ◽

2016 ◽

pp. 405-425 ◽

Cited By ~ 11

Author(s):

Peter Müller ◽

Malte Schwerhoff ◽

Alexander J. Summers

Keyword(s):

Symbolic Execution ◽

Automatic Verification

Download Full-text

Under-Approximating Backward Reachable Sets by Polytopes

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_25 ◽

2016 ◽

pp. 457-476 ◽

Cited By ~ 15

Author(s):

Bai Xue ◽

Zhikun She ◽

Arvind Easwaran

Keyword(s):

Reachable Sets

Download Full-text

Parsimonious, Simulation Based Verification of Linear Systems

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_26 ◽

2016 ◽

pp. 477-494 ◽

Cited By ~ 14

Author(s):

Parasara Sridhar Duggirala ◽

Mahesh Viswanathan

Keyword(s):

Linear Systems ◽

Simulation Based

Download Full-text

Precise and Complete Propagation Based Local Search for Satisfiability Modulo Theories

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_11 ◽

2016 ◽

pp. 199-217 ◽

Cited By ~ 5

Author(s):

Aina Niemetz ◽

Mathias Preiner ◽

Armin Biere

Keyword(s):

Local Search ◽

Satisfiability Modulo Theories

Download Full-text

Structural Synthesis for GXW Specifications

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_6 ◽

2016 ◽

pp. 95-117 ◽

Cited By ~ 4

Author(s):

Chih-Hong Cheng ◽

Yassine Hamza ◽

Harald Ruess

Keyword(s):

Structural Synthesis

Download Full-text

JayHorn: A Framework for Verifying Java programs

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_19 ◽

2016 ◽

pp. 352-358 ◽

Cited By ~ 15

Author(s):

Temesghen Kahsai ◽

Philipp Rümmer ◽

Huascar Sanchez ◽

Martin Schäf

Keyword(s):

Java Programs

Download Full-text

Learning-Based Assume-Guarantee Regression Verification

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_17 ◽

2016 ◽

pp. 310-328 ◽

Cited By ~ 3

Author(s):

Fei He ◽

Shu Mao ◽

Bow-Yaw Wang

Download Full-text

A Decision Procedure for Sets, Binary Relations and Partial Functions

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_10 ◽

2016 ◽

pp. 179-198 ◽

Cited By ~ 5

Author(s):

Maximiliano Cristiá ◽

Gianfranco Rossi

Keyword(s):

Decision Procedure ◽

Binary Relations ◽

Partial Functions

Download Full-text

Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41528-4_14 ◽

2016 ◽

pp. 261-268 ◽

Cited By ~ 13

Author(s):

Bishoksan Kafle ◽

John P. Gallagher ◽

José F. Morales

Keyword(s):

Abstract Interpretation ◽

Tree Automata ◽

Finite Tree ◽

Horn Clauses

Download Full-text

Computer Aided Verification - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Termination Analysis of Probabilistic Programs Through Positivstellensatz’s

Automatic Verification of Iterated Separating Conjunctions Using Symbolic Execution

Under-Approximating Backward Reachable Sets by Polytopes

Parsimonious, Simulation Based Verification of Linear Systems

Precise and Complete Propagation Based Local Search for Satisfiability Modulo Theories

Structural Synthesis for GXW Specifications

JayHorn: A Framework for Verifying Java programs

Learning-Based Assume-Guarantee Regression Verification

A Decision Procedure for Sets, Binary Relations and Partial Functions

Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata

Computer Aided Verification - Lecture Notes in Computer Science
Latest Publications