References

  1. Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems & Pierre Wolper (2000): An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett. 74(5-6), pp. 221–227, doi:10.1016/S0020-0190(00)00055-7.
  2. Ahmed Bouajjani, Javier Esparza & Oded Maler (1997): Reachability Analysis of Pushdown Automata: Application to Model-Checking. In: CONCUR '97, LNCS 1243. Springer, pp. 135–150, doi:10.1007/3-540-63141-0_10.
  3. Ahmed Bouajjani, Markus Müller-Olm & Tayssir Touili (2005): Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. In: CONCUR '05, LNCS 3653. Springer, pp. 473–487, doi:10.1007/11539452_36.
  4. J. Richard Büchi (1964): Regular canonical systems. Archiv für mathematische Logik und Grundlagenforschung 6, pp. 91–111, doi:10.1007/BF01969548.
  5. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison & M. Tommasi (2007): Tree Automata Techniques and Applications. Available on: http://www.grappa.univ-lille3.fr/tata.
  6. Joost Engelfriet (1975): Bottom-up and top-down tree transformations— a comparison. Theory of Computing Systems 9, pp. 198–231, doi:10.1007/BF01704020.
  7. Javier Esparza & Jens Knoop (1999): An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis. In: FoSSaCS '99, LNCS 1578. Springer, pp. 14–30, doi:10.1007/3-540-49019-1_2.
  8. Javier Esparza & Andreas Podelski (2000): Efficient Algorithms for pre^\voidb@x * and post^\voidb@x * on Interprocedural Parallel Flow Graphs. In: POPL '00. ACM, pp. 1–11, doi:10.1145/325694.325697.
  9. Thomas Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl & Alexander Wenner (2011): Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. In: VMCAI '11, LNCS 6538. Springer, pp. 199–213, doi:10.1007/978-3-642-18275-4_15.
  10. Dennis Giffhorn (2012): Slicing of Concurrent Programs and its Application to Information Flow Control. Karlsruher Institut für Technologie, Fakultät für Informatik.
  11. Christian Hammer & Gregor Snelting (2009): Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs. International Journal of Information Security 8(6), pp. 399–422, doi:10.1007/s10207-009-0086-1.
  12. Vineet Kahlon & Aarti Gupta (2006): An Automata-Theoretic Approach for Model Checking Threads for LTL Properties. In: LICS '06. IEEE, pp. 101–110, doi:10.1109/LICS.2006.11.
  13. Vineet Kahlon, Franjo Ivancic & Aarti Gupta (2005): Reasoning About Threads Communicating via Locks. In: CAV '05, LNCS 3576. Springer, pp. 505–518, doi:10.1007/11513988_49.
  14. Nicholas Kidd, Thomas Reps, Julian Dolby & Mandana Vaziri (2009): Finding Concurrency-Related Bugs Using Random Isolation. In: VMCAI '09, LNCS 5403. Springer, pp. 198–213, doi:10.1007/978-3-540-93900-9_18.
  15. Peter Lammich, Markus Müller-Olm & Alexander Wenner (2009): Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints. In: CAV '09, LNCS 5643. Springer, pp. 525–539, doi:10.1007/978-3-642-02658-4_39.
  16. Denis Lugiez & Philippe Schnoebelen (1998): The Regular Viewpoint on PA-Processes. In: Davide Sangiorgi & Robert de Simone: CONCUR '98, LNCS 1466. Springer, pp. 50–66, doi:10.1007/BFb0055615.
  17. Denis Lugiez & Philippe Schnoebelen (2002): The regular viewpoint on PA-processes. Theoretical Computer Science 274(1–2), pp. 89 – 115, doi:10.1016/S0304-3975(00)00306-6.
  18. Markus Müller-Olm & Helmut Seidl (2001): On Optimal Slicing of Parallel Programs. In: STOC '01. ACM, pp. 647–656, doi:10.1145/380752.380864.
  19. G. Ramalingam (2000): Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22(2), pp. 416–430, doi:10.1145/349214.349241.
  20. David A. Schmidt (1998): Data Flow Analysis is Model Checking of Abstract Interpretations. In: POPL '98. ACM, pp. 38–48, doi:10.1145/268946.268950.
  21. David A. Schmidt & Bernhard Steffen (1998): Program Analysis as Model Checking of Abstract Interpretations. In: Giorgio Levi: SAS '98, LNCS 1503. Springer, pp. 351–380, doi:10.1007/3-540-49727-7_22.
  22. Bernhard Steffen (1991): Data Flow Analysis as Model Checking. In: Theoretical Aspects of Computer Software, LNCS 526. Springer, pp. 346–364, doi:10.1007/3-540-54415-1_54.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org