Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319467498, 9783319467504

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Dynamic Logic with Binders and Its Application to the Development of Reactive Systems

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-46750-4_24 ◽

2016 ◽

pp. 422-440 ◽

Cited By ~ 3

Author(s):

Alexandre Madeira ◽

Luis S. Barbosa ◽

Rolf Hennicker ◽

Manuel A. Martins

Keyword(s):

Reactive Systems ◽

Dynamic Logic

Download Full-text

Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-46750-4_5 ◽

2016 ◽

pp. 69-81

Author(s):

Allyx Fontaine ◽

Akka Zemmari

Keyword(s):

Distributed Algorithms ◽

Impossibility Results

Download Full-text

Schedulers and Finishers: On Generating the Behaviours of an Event Structure

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-46750-4_8 ◽

2016 ◽

pp. 121-138

Author(s):

Annabelle McIver ◽

Tahiry Rabehaja ◽

Georg Struth

Keyword(s):

Event Structure

Download Full-text

Termination of Single-Path Polynomial Loop Programs

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-46750-4_3 ◽

2016 ◽

pp. 33-50

Author(s):

Yi Li

Keyword(s):

Single Path

Download Full-text

Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-46750-4_4 ◽

2016 ◽

pp. 51-68 ◽

Cited By ~ 2

Author(s):

Walter Guttmann

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Tree Algorithm

Download Full-text

Parametric Deadlock-Freeness Checking Timed Automata

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-46750-4_27 ◽

2016 ◽

pp. 469-478 ◽

Cited By ~ 2

Author(s):

Étienne André

Keyword(s):

Timed Automata

Download Full-text

Temporal Logic Verification for Delay Differential Equations

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-46750-4_23 ◽

2016 ◽

pp. 405-421 ◽

Cited By ~ 1

Author(s):

Peter Nazier Mosaad ◽

Martin Fränzle ◽

Bai Xue

Keyword(s):

Differential Equations ◽

Temporal Logic ◽

Delay Differential Equations ◽

Logic Verification ◽

Delay Differential

Download Full-text

An Abstract Model for Proving Safety of Autonomous Urban Traffic

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-46750-4_16 ◽

2016 ◽

pp. 274-292 ◽

Cited By ~ 13

Author(s):

Martin Hilscher ◽

Maike Schwammberger

Keyword(s):

Urban Traffic ◽

Abstract Model

Download Full-text

Towards MC/DC Coverage of Properties Specification Patterns

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

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

2016 ◽

pp. 158-175 ◽

Cited By ~ 1

Author(s):

Ana C. V. de Melo ◽

Corina S. Păsăreanu ◽

Simone Hanazumi

Download Full-text

Hybrid Automata as Coalgebras

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science ◽

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

2016 ◽

pp. 385-402 ◽

Cited By ~ 1

Author(s):

Renato Neves ◽

Luis S. Barbosa

Keyword(s):

Hybrid Automata

Download Full-text

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Dynamic Logic with Binders and Its Application to the Development of Reactive Systems

Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms

Schedulers and Finishers: On Generating the Behaviours of an Event Structure

Termination of Single-Path Polynomial Loop Programs

Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm

Parametric Deadlock-Freeness Checking Timed Automata

Temporal Logic Verification for Delay Differential Equations

An Abstract Model for Proving Safety of Autonomous Urban Traffic

Towards MC/DC Coverage of Properties Specification Patterns

Hybrid Automata as Coalgebras

Theoretical Aspects of Computing – ICTAC 2016 - Lecture Notes in Computer Science
Latest Publications