×

Automated technology for verification and analysis. 4th international symposium, ATVA 2006, Beijing, China, October 23–26, 2006. Proceedings. (English) Zbl 1137.68008

Lecture Notes in Computer Science 4218. Berlin: Springer (ISBN 978-3-540-47237-7/pbk). xiv, 540 p. (2006).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1089.68013).
Indexed articles:
Yannakakis, Mihalis, Analysis of recursive probabilistic models, 1-5 [Zbl 1161.68593]
Donaldson, Alastair F.; Miller, Alice, Symmetry reduction for probabilistic model checking using generic representatives, 9-23 [Zbl 1161.68564]
Abdulla, Parosh Aziz; Ben Henda, Noomene; Mayr, Richard; Sandberg, Sven, Eager Markov chains, 24-38 [Zbl 1161.68466]
He, Fei; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang, A probabilistic learning approach for counterexample guided abstraction refinement, 39-50 [Zbl 1161.68722]
Chung, Ming-Ying; Ciardo, Gianfranco; Yu, Andy Jinqing, A fine-grained fullness-guided chaining heuristic for symbolic reachability analysis, 51-66 [Zbl 1161.68561]
Hsiung, Pao-Ann; Lin, Shang-Wei; Chen, Yean-Ru; Huang, Chun-Hsian; Yeh, Jia-Jen; Sun, Hong-Yu; Lin, Chao-Sheng; Liao, Hsiao-Win, Model checking timed systems with urgencies, 67-81 [Zbl 1161.68570]
Wang, Chao; Yang, Zijiang; Ivančić, Franjo; Gupta, Aarti, Whodunit? Causal analysis for counterexamples, 82-95 [Zbl 1161.68588]
La Torre, Salvatore; Napoli, Margherita; Parente, Mimmo, On the membership problem for visibly pushdown languages, 96-109 [Zbl 1161.68544]
Kupferman, Orna; Lampert, Robby, On the construction of fine automata for safety properties, 110-124 [Zbl 1161.68572]
Aminof, Benjamin; Kupferman, Orna, On the succinctness of nondeterminism, 125-140 [Zbl 1161.68508]
Suwimonteerabuth, Dejvuth; Schwoon, Stefan; Esparza, Javier, Efficient algorithms for alternating pushdown systems with an application to the computation of certificate chains, 141-153 [Zbl 1161.68495]
Xie, Fei; Yang, Guowu; Song, Xiaoyu, Compositional reasoning for hardware/software co-verification, 154-169 [Zbl 1161.68591]
Nam, Wonhong; Alur, Rajeev, Learning-based symbolic assume-guarantee reasoning with automatic decomposition, 170-185 [Zbl 1161.68578]
Wang, Bow-Yaw, On the satisfiability of modular arithmetic formulae, 186-199 [Zbl 1161.68496]
Helmert, Malte; Mattmüller, Robert; Schewe, Sven, Selective approaches for solving weak games, 200-214 [Zbl 1161.68569]
Cachat, Thierry, Controller synthesis and ordinal automata, 215-228 [Zbl 1161.68516]
Yoneda, Tomohiro; Myers, Chris J., Effective contraction of timed STGs for decomposition based timed circuit synthesis, 229-244 [Zbl 1161.68633]
Schewe, Sven, Synthesis for probabilistic environments, 245-259 [Zbl 1161.68582]
Huang, Jinfeng; Geilen, Marc; Voeten, Jeroen; Corporaal, Henk, Branching-time property preservation between real-time systems, 260-275 [Zbl 1161.68571]
Damm, Werner; Disch, Stefan; Hungar, Hardi; Pang, Jun; Pigorsch, Florian; Scholl, Christoph; Waldmann, Uwe; Wirtz, Boris, Automatic verification of hybrid systems with large discrete state space, 276-291 [Zbl 1161.68562]
Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain, Timed unfoldings for networks of timed automata, 292-306 [Zbl 1161.68614]
Cassez, Franck; Chatain, Thomas; Jard, Claude, Symbolic unfoldings for networks of timed automata, 307-321 [Zbl 1161.68615]
Fecher, Harald; Huth, Michael, Ranked predicate abstraction for branching time: Complete, incremental, and precise, 322-336 [Zbl 1161.68566]
Mokadem, Houda Bel; Bérard, Béatrice; Bouyer, Patricia; Laroussinie, François, Timed temporal logics for abstracting transient states, 337-351 [Zbl 1161.68576]
Xia, Songtao; Di Vito, Ben; Munoz, Cesar, Predicate abstraction of programs with non-linear computation, 352-368 [Zbl 1161.68590]
Bhateja, Puneet; Gastin, Paul; Mukund, Madhavan, A fresh look at testing for asynchronous communication, 369-383 [Zbl 1161.68349]
Dharmadeep, M. C.; Gopinath, K., Proactive leader election in asynchronous shared memory systems, 384-398 [Zbl 1161.68320]
Briones, Laura Brandán; Brinksma, Ed; Stoelinga, Mariëlle, A semantic framework for test coverage, 399-414 [Zbl 1161.68350]
Delzanno, Giorgio; Esparza, Javier; Srba, Jiří, Monotonic set-extended prefix rewriting and verification of recursive ping-pong protocols, 415-429 [Zbl 1161.68617]
Zhang, Ye; Nielson, Hanne Riis, Analyzing security protocols in hierarchical networks, 430-445 [Zbl 1161.68324]
Fidge, Colin; Tian, Yu-Chu, Functional analysis of a real-time protocol for networked control systems, 446-460 [Zbl 1161.68321]
Rosa-Velardo, Fernando; de Frutos-Escrig, David, Symbolic semantics for the verification of security properties of mobile Petri nets, 461-476 [Zbl 1161.68628]
Wimmer, Ralf; Herbstritt, Marc; Hermanns, Holger; Strampp, Kelley; Becker, Bernd, SIGREF – a symbolic bisimulation tool box, 477-492 [Zbl 1161.68631]
Demri, S.; Finkel, A.; Goranko, V.; van Drimmelen, G., Towards a model-checker for counter systems, 493-507 [Zbl 1161.68563]
Niebert, Peter; Qu, Hongyang, The implementation of Mazurkiewicz traces in POEM, 508-522 [Zbl 1161.68579]
Su, Hang; Hemingway, Graham; Chen, Kai; Koo, T. John, Model-based tool-chain infrastructure for automated analysis of embedded systems, 523-537 [Zbl 1161.68585]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Q60 Specification and verification (program logics, model checking, etc.)
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1089.68013
PDFBibTeX XMLCite
Full Text: DOI