default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th ATVA 2012: Thiruvananthapuram, India
- Supratik Chakraborty, Madhavan Mukund:
Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings. Lecture Notes in Computer Science 7561, Springer 2012, ISBN 978-3-642-33385-9
Invited Papers
- Shuyuan Zhang, Sharad Malik, Rick McGeer:
Verification of Computer Switching Networks: An Overview. 1-16 - Sucheendra K. Palaniappan
, P. S. Thiagarajan:
Dynamic Bayesian Networks: A Factored Model of Probabilistic Dynamics. 17-25 - Andreas Podelski:
Interpolant Automata - (Invited Talk). 26
Automata Theory
- Shulamit Halamish, Orna Kupferman:
Approximating Deterministic Lattice Automata. 27-41 - Sven Schewe, Thomas Varghese:
Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata. 42-56 - Sofia Cassel, Bengt Jonsson, Falk Howar, Bernhard Steffen:
A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations. 57-71 - Andreas Gaiser, Jan Kretínský, Javier Esparza:
Rabinizer: Small Deterministic Automata for LTL(F, G). 72-76
Logics and Proofs
- Paritosh K. Pandya, Simoni S. Shah:
The Unary Fragments of Metric Interval Temporal Logic: Bounded versus Lower Bound Constraints. 77-91 - Alexandre Donzé, Oded Maler, Ezio Bartocci, Dejan Nickovic, Radu Grosu, Scott A. Smolka:
On Temporal Logic and Signal Processing. 92-106 - Ashutosh Gupta:
Improved Single Pass Algorithms for Resolution Proof Reduction. 107-121
Model Checking
- Orna Grumberg, Orna Kupferman, Sarai Sheinvald:
Model Checking Systems and Specifications with Parameterized Atomic Propositions. 122-136 - Mohamed Amin Ben Sassi, Romain Testylier, Thao Dang, Antoine Girard:
Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations. 137-151 - Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding. 152-166
Software Verification
- Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data. 167-182 - Carlo A. Furia:
A Verifier for Functional Properties of Sequence-Manipulating Programs. 183-186 - Hossein Hojjat, Radu Iosif, Filip Konecný, Viktor Kuncak, Philipp Rümmer:
Accelerating Interpolants. 187-202 - Ondrej Sery, Grigory Fedyukovich, Natasha Sharygina:
FunFrog: Bounded Model Checking with Interpolation-Based Function Summarization. 203-207
Synthesis
- John Fearnley, Doron A. Peled, Sven Schewe:
Synthesis of Succinct Systems. 208-222 - Peter E. Bulychev, Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Jean-François Raskin, Pierre-Alain Reynier:
Controllers with Minimal Observation Power (Application to Timed Systems). 223-237 - Matthias Güdemann, Gwen Salaün, Meriem Ouederni:
Counterexample Guided Synthesis of Monitors for Realizability Enforcement. 238-253
Verification and Parallelism
- Daniel Schwartz-Narbonne, Georg Weissenbacher, Sharad Malik:
Parallel Assertions for Architectures with Weak Memory Models. 254-268 - Sami Evangelista, Alfons Laarman, Laure Petrucci, Jaco van de Pol:
Improved Multi-Core Nested Depth-First Search. 269-283 - Rodrigo T. Saad, Silvano Dal-Zilio, Bernard Berthomieu:
An Experiment on Parallel Model Checking of a CTL Fragment. 284-299
Probabilistic Verification
- Luis María Ferrer Fioriti, Ernst Moritz Hahn, Holger Hermanns, Björn Wachter:
Variable Probabilistic Abstraction Refinement. 300-316 - Vojtech Forejt, Marta Z. Kwiatkowska, David Parker:
Pareto Curves for Probabilistic Model Checking. 317-332 - Sergio Giro, Markus N. Rabe:
Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements. 333-348 - Nils Jansen, Erika Ábrahám, Matthias Volk, Ralf Wimmer, Joost-Pieter Katoen, Bernd Becker:
The COMICS Tool - Computing Minimal Counterexamples for DTMCs. 349-353
Constraint Solving and Applications
- Daniel Neider:
Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers. 354-369 - Bernd Becker, Rüdiger Ehlers, Matthew Lewis, Paolo Marin:
ALLQBF Solving by Computational Learning. 370-384
Probabilistic Systems
- Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar:
Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games. 385-399 - Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun:
A Probabilistic Kleene Theorem. 400-415 - Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate:
Higher-Order Approximations for Verification of Stochastic Hybrid Systems. 416-434
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
