Iterating transducers in the large (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2725, Issue , 2003, Pages 223-235

  Boigelot, Bernard ^a   Legay, Axel ^a   Wolper, Pierre ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

ACCELERATION TECHNIQUE; ALGORITHMIC IDEAS; EXTENDED ABSTRACTS; FINITE STATE TRANSDUCERS; INFINITE STATE SYSTEMS; NEW APPROACHES; REGULAR REPRESENTATIONS; TRANSITION RELATIONS;

TRANSDUCERS;

EID: 35248885241     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_24     Document Type: Article

References (20)

1. P. A. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded, lossy FIFO channels. In Proceedings 10th International Conference on Computer Aided Verification (CAV), volume 1427 of Lecture Notes in Computer Science, pages 305-318, Vancouver, Canada, 1998. Springer.
2. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, June 1996.
3. P. A. Abdulla, B. Jonsson, M. Nilsson, and J. d'Orso. Regular model checking made simple and efficient. In Proceedings 13th International Conference on Concurrency Theory (CONCUR), volume 2421 of Lecture Notes in Computer Science, pages 116-130, Brno, Czech Republic, 2002. Springer.
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In A. Mazurkiewicz and J. Winkowski, editors, Proceedings of the 8th International conference of Concurrency Theory (CONCUR 97), volume 1243 of Lecture Notes in Computer Science, pages 135-150, Warsaw, Poland, July 1997. Springer.
5. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proceedings of the 8th International Conference on Computer-Aided Verification (CAV'96), volume 1102 of Lecture Notes in Computer Science, pages 1-12, New-Brunswick, NJ, USA, July 1996. Springer-Verlag.
6. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO channel systems with nonregular sets of configurations. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proceeding of 24th International Colloquim on Automata, Languages and Programming (ICALP), volume 1256 of Lecture Notes in Computer Science, pages 560-570, Bologna, Italy, 1997. Springer-Verlag.
7. V. Bruyère, G. Hansel, C. Michaux, and R. Villemaire. Logic and p-recognizable sets of integers. Bulletin of the Belgian Mathematical Society, 1(2):191-238, March 1994.
8. A. Bouajjani, B. Jonsson, M. Nilsson, and Tayssir Touili. Regular model checking. In E. A. Emerson and A. P. Sistla, editors, Proceedings of the 12th International Conference on Computer-Aided Verification (CAV'00), volume 1855 of Lecture Notes in Computer Science, pages 403-418. Springer, 2000.
9. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. Collection des publications de la Faculté des Sciences Appliquées de l'Université de Liège, Liège, Belgium, 1999.
10. Bernard Boigelot and Pierre Wolper. Representing arithmetic constraints with finite automata: An overview. In Proc. International Conference on Logic Programming (ICLP), volume 2401 of Lecture Notes in Computer Science, pages 1-19, Copenhagen, July 2002. Springer-Verlag.
11. D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. In Proceedings 13th International Conference on Computer Aided Verification (CAV), volume 2102 of Lecture Notes in Computer Science, pages 286-297, Paris, France, 2001. Springer.
12. Alain Finkel, Bernard Willens, and Pierre Wolper. A direct symbolic approach to model checking pushdown systems. In Faron Moller, editor, Infinity'97, Second International Workshop on Verification of Infinite State Systems, volume 9 of Electronic Notes in Theoretical Computer Science, Bologna, July 1997. Elsevier Science Publishers.
13. J. E. Hopcroft. An n log n algorithm for minimizing states in a finite automaton. Theory of Machines and Computation, pages 189-196, 1971.
14. B. Jonsson and M. Nilson. Transitive closures of regular relations for verifying infinite-state systems. In S. Graf and M. Schwartzbach, editors, Proceeding of the 6th International conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1875 of Lecture Notes in Computer Science, pages 220-234. Springer, 2000.
15. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In Proceedings of 9th International Conference on Computer-Aided Verification (CAV'97), volume 1254 of Lecture Notes in Computer Science, pages 424-435. Springer, 1997.
16. ∼boigelot/research/lash/.
17. A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In E. A. Emerson and A. P. Sistla, editors, Proceedings of the 12th International Conference on Computer-Aided Verification (CAV'00), volume 1855 of Lecture Notes in Computer Science, pages 328-343. Springer, 2000.
18. T. Touili. Regular model checking using widening techniques. In Proceeding of Workshop on Verification of Parametrized Systems (VEPAS'01), volume 50 of Electronic Notes in Theoretical Computer Science, 2001.
19. Pierre Wolper and Bernard Boigelot. An automata-theoretic approach to Presburger arithmetic constraints. In Proc. Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 21-32, Glasgow, September 1995. Springer-Verlag.
20. Pierre Wolper and Bernard Boigelot. On the construction of automata from linear arithmetic constraints. In Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, pages 1-19, Berlin, March 2000. Springer-Verlag.