Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662545768, 9783662545775

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_4 ◽

2017 ◽

pp. 58-75 ◽

Cited By ~ 10

Author(s):

Alessandro Cimatti ◽

Alberto Griggio ◽

Ahmed Irfan ◽

Marco Roveri ◽

Roberto Sebastiani

Keyword(s):

Transition Systems

Download Full-text

ML for ML: Learning Cost Semantics by Experiment

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_11 ◽

2017 ◽

pp. 190-207 ◽

Cited By ~ 1

Author(s):

Ankush Das ◽

Jan Hoffmann

Keyword(s):

Cost Semantics

Download Full-text

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_25 ◽

2017 ◽

pp. 426-442 ◽

Cited By ~ 12

Author(s):

Javier Esparza ◽

Jan Křetínský ◽

Jean-François Raskin ◽

Salomon Sickert

Keyword(s):

Büchi Automata ◽

Buchi Automata

Download Full-text

Minimization of Visibly Pushdown Automata Using Partial Max-SAT

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_27 ◽

2017 ◽

pp. 461-478 ◽

Cited By ~ 1

Author(s):

Matthias Heizmann ◽

Christian Schilling ◽

Daniel Tischner

Keyword(s):

Max Sat ◽

Visibly Pushdown Automata ◽

Pushdown Automata

Download Full-text

Counterexample-Guided Refinement of Template Polyhedra

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_34 ◽

2017 ◽

pp. 589-606 ◽

Cited By ~ 8

Author(s):

Sergiy Bogomolov ◽

Goran Frehse ◽

Mirco Giacobbe ◽

Thomas A. Henzinger

Download Full-text

Counterexample-Guided Model Synthesis

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_15 ◽

2017 ◽

pp. 264-280 ◽

Cited By ~ 9

Author(s):

Mathias Preiner ◽

Aina Niemetz ◽

Armin Biere

Keyword(s):

Model Synthesis

Download Full-text

Proving Termination Through Conditional Termination

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_6 ◽

2017 ◽

pp. 99-117 ◽

Cited By ~ 13

Author(s):

Cristina Borralleras ◽

Marc Brockschmidt ◽

Daniel Larraz ◽

Albert Oliveras ◽

Enric Rodríguez-Carbonell ◽

...

Download Full-text

Learning Symbolic Automata

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_10 ◽

2017 ◽

pp. 173-189 ◽

Cited By ~ 17

Author(s):

Samuel Drews ◽

Loris D’Antoni

Keyword(s):

Symbolic Automata

Download Full-text

Bounded Quantifier Instantiation for Checking Inductive Invariants

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_5 ◽

2017 ◽

pp. 76-95 ◽

Cited By ~ 3

Author(s):

Yotam M. Y. Feldman ◽

Oded Padon ◽

Neil Immerman ◽

Mooly Sagiv ◽

Sharon Shoham

Keyword(s):

Quantifier Instantiation ◽

Inductive Invariants

Download Full-text

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54577-5_2 ◽

2017 ◽

pp. 23-40

Author(s):

Ocan Sankur ◽

Jean-Pierre Talpin

Keyword(s):

Model Checking ◽

Leader Election ◽

Parameterized Model

Download Full-text

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF

ML for ML: Learning Cost Semantics by Experiment

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata

Minimization of Visibly Pushdown Automata Using Partial Max-SAT

Counterexample-Guided Refinement of Template Polyhedra

Counterexample-Guided Model Synthesis

Proving Termination Through Conditional Termination

Learning Symbolic Automata

Bounded Quantifier Instantiation for Checking Inductive Invariants

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science
Latest Publications