Journals in DBLP
Julian C. Bradfield , Faron Moller Preface. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:1- [Journal ] Ranko Lazic Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:3-19 [Journal ] Peter Habermehl , Tomás Vojnar Regular Model Checking Using Inference of Regular Languages. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:21-36 [Journal ] Jesse D. Bingham A New Approach to Upward-Closed Set Backward Reachability Analysis. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:37-48 [Journal ] Martin Kot , Zdenek Sawa Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:49-60 [Journal ] Ranko Lazic , Thomas Christopher Newcomb , Bill Roscoe Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:61-86 [Journal ] Olga Grinchtein , Bengt Jonsson , Martin Leucker Inference of Timed Transition Systems. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:87-99 [Journal ] Ahmed Bouajjani , Axel Legay , Pierre Wolper Handling Liveness Properties in (omega -)Regular Model Checking. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:101-115 [Journal ] Parosh Aziz Abdulla , Johann Deneux , Pritha Mahata Closed, Open, and Robust Timed Networks. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:117-151 [Journal ] Ahmed Bouajjani , Javier Esparza , Tayssir Touili Reachability Analysis of Synchronized PA Systems. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:153-178 [Journal ]