005 : Learning-based Symbolic Assume-guarantee Reasoning with Automatic Decomposition.
Wonhong Nam & Alur, Rajeev (US)
014 : Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise.
Harald Fecher & Huth, Michael (DE)
024 : Controller synthesis and Ordinal Automata.
Thierry Cachat (FR)
025 : Sigref - A Symbolic Bisimulation Tool Box.
Ralf Wimmer & Herbstritt, Marc; Strampp, Kelley; Becker, Bernd; Hermanns, Holger (DE)
030 : Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols.
Jiri Srba & Esparza, Javier; Delzanno, Giorgio (DK)
033 : Timed temporal logics for abstracting transient states.
Houda Bel mokadem & Laroussinie, Fran?ois; Bouyer, Patricia; B¨¦rard, B¨¦atri (FR)
034 : Eager Markov Chains.
Sven Sandberg (SE)
037 : On the Construction of Fine Automata for Safety Properties.
Robby Lampert & Kupferman, Orna (IL)
041 : Effective Contraction of Timed STGs for Decomposition Based Timed Circuit Synthesis.
Tomohiro Yoneda & Myers, Chris (JP)
043 : Analyzing Security Protocols in Hierarchical Networks.
Ye Zhang & Nielson, Hanne Riis (DK)
048 : Model Checking Timed Systems with Urgencies.
Pao-Ann Hsiung & Lin, Shang-Wei; Chen, Yean-Ru; Huang, Chun-Hsian; Yeh, Jia-Jen; Sun, Hong-Yu; Lin, Chao-Sheng; Liao, Hsiao-Win (TW)
058 : A Probabilistic Learning Approach for Counterexample Guided Abstraction Refinement.
Fei He & Sun, Jiaguang; Gu, Ming; Song, Xiaoyu (CN)
059 : Towards a model-checker for counter systems.
Stephane Demri & van Drimmelen, Govert; Finkel, Alain; Goranko, Valentin (FR)
061 : Automatic Verification of Hybrid Systems with Large Discrete State Space.
Hardi Hungar & Scholl, Christoph; Waldmann, Uwe; Disch, Stefan; Pigorsch, Florian; Pang, Jun; Wirtz, Boris; Damm, Werner (DE)
062 : On the Satisfiability of Modular Arithmetic Formula.
Bow-Yaw Wang (TW)
063 : Functional Analysis of a Real-Time Protocol for Networked Control Systems.
Colin Fidge & Tian, Yu-Chu (AU)
068 : Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets.
Fernando Rosa-Velardo & de Frutos-Escrig, David (ES)
069 : A fresh look at testing for asynchronous communication.
Madhavan Mukund & Gastin, Paul; Bhateja, Puneet (IN)
076 : Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains.
Dejvuth Suwimonteerabuth & Esparza, Javier; Schwoon, Stefan (DE)
078 : Proactive leader election in Asynchronous Shared Memory systems.
Dharmadeep M & K, Gopinath (IN)
083 : Whodunit? Causal Analysis for Counterexamples.
Chao Wang & Gupta, Aarti; Ivancic, Franjo; Yang, Zijiang (US)
088 : Timed Unfoldings for Networks of Timed Automata.
Patricia Bouyer & Haddad, Serge; Reynier, Pierre-Alain (FR)
090 : A fine-grained fullness-guided chaining heuristic for symbolic reachability analysis.
Andy Jinqing Yu & Chung, Ming-Ying; Ciardo, Gianfranco (US)
093 : Symbolic Unfoldings For Networks of Timed Automata.
Franck Cassez & Chatain, Thomas; Jard, Claude (FR)
095 : Predicate Abstraction of Engineering Programs containing non-linear computation.
Songtao Xia & Munoz, Cesar; Di Vito, Ben (US)
097 : Branching-time Property Preservation Real-time Systems.
Jinfeng Huang (NL)
100 : Model-Based Tool-Chain Infrastructure for Automated Analysis of Embedded Systems.
T. John Koo & Chen, Kai; Hemingway, Graham; Su, Hang (US)
107 : On the Membership Problem for Visibly Pushdown Languages.
Mimmo Parente & Napoli, Margherita; La Torre, Salvatore (IT)
111 : Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives.
Alastair Donaldson & Miller, Alice (UK)
112 : On the Succinctness of Nondeterminizm.
Benjamin Aminof & Kupfermann, Orna (IL)
113 : Selective Approaches for Solving Weak Games.
Malte Helmert & Mattm¨¹ller, Robert; Schewe, Sven (DE)
128 : Synthesis for Probabilistic Environments.
Sven Schewe (DE)
129 : The Implementation of Mazurkievicz Traces in POEM.
Hongyang Qu & Niebert, Peter (FR)
133 : Compositional Reasoning for Hardware/Software Co-Verification.
Fei Xie & Yang, Guowu; Song, Xiaoyu (US)
161 : A Semantic Framework for Test Coverage.
Laura Brandan Briones (NL)