_id,doi,title
3249,10.1016/j.tcs.2011.08.002,Simulation distances
3251,10.1007/978-3-642-27940-9_29,Ideal abstractions for well structured transition systems
3253,10.1007/978-3-642-27940-9_1,Abstract domains for automated reasoning about list manipulating programs with infinite data
10903,10.1007/978-3-642-33386-6_14,Accurate invariant checking for programs manipulating lists and arrays with infinite data
10906,10.1007/978-3-642-28756-5_46,HSF(C): A software verifier based on Horn clauses
2302,10.1109/TCBB.2012.91,The propagation approach for computing biochemical reaction networks
494,10.1145/2362355.2362357,"Translating to Co-Büchi made tight, unified, and useful"
5745,10.1007/978-3-642-33386-6_10,Improved Single Pass Algorithms for Resolution Proof Reduction
1384,10.1145/2393596.2393664,Conditional model checking: A technique to pass information between verifiers
3836,10.1016/j.scico.2010.06.004,Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code
3846,10.1016/j.jcss.2011.05.002,"A survey of stochastic ω regular games"
3264,10.1007/978-3-642-25318-8_16,Solving recursion-free Horn clauses over LI+UIF
3299,10.1145/2037509.2037510,Propagation models for computing biochemical reaction networks
3301,,Tail approximation for the chemical master equation
3302,,Static scheduling in clouds
3315,10.2168/LMCS-7(4:8)2011,Timed parity games: Complexity and robustness
3316,10.1109/SIES.2011.5953660,Specification-centered robustness
3323,10.1007/978-3-642-22438-6_36,An efficient decision procedure for imperative tree data structures
3324,10.1007/978-3-642-18275-4_26,Decision procedures for automating termination proofs
3325,10.1145/1926385.1926454,Streaming transducers for algorithmic verification of single pass list processing programs