_id,doi,title
10190,10.1145/3360550,Value-centric dynamic partial order reduction
81,10.1007/978-3-030-00151-3_4,Monitoring temporal logic with clock variables
133,10.4230/LIPIcs.CONCUR.2018.21,Synchronizing the asynchronous
140,10.1007/978-3-319-96145-3_25,Space-time interpolants
1116,10.1007/978-3-662-54580-5_10,Computing scores of forwarding schemes in switched networks with probabilistic faults
465,10.23638/LMCS-13(3:23)2017,Edit distance for pushdown automata
471,10.1145/3060139,Faster statistical model checking for unbounded temporal properties
549,10.4204/EPTCS.259.3,Causality-based model checking
625,10.1007/978-3-319-63121-9_18,The cost of exactness in quantitative reachability
631,10.1007/978-3-662-54577-5_34,Counterexample guided refinement of template polyhedra
633,10.1007/978-3-319-63501-9_6,Challenges and tool implementation of hybrid rapidly exploring random trees
636,10.1007/978-3-319-65765-3_11,On the quantitative semantics of regular expressions over real-valued signals
647,10.1007/978-3-319-65765-3_7,Conic abstractions for hybrid systems
942,10.1145/3106237.3106309,S3: Syntax- and semantic-guided repair synthesis via programming by examples
962,10.1007/978-3-319-63390-9_21,Model counting for recursively-defined strings
963,10.4230/LIPIcs.MFCS.2017.37,Timed network games with clocks
1003,10.24963/ijcai.2017/11,An abstraction-refinement methodology for reasoning about network games
1011,10.1007/978-3-662-54434-1_11,Faster algorithms for weighted recursive state machines
1194,10.1145/3009837.3009873,Stochastic invariants for probabilistic termination
1498,10.4230/LIPIcs.SNAPL.2015.90,The need for language support for fault-tolerant distributed systems