default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd VMCAI 2022: Philadelphia, PA, USA
- Bernd Finkbeiner
, Thomas Wies:
Verification, Model Checking, and Abstract Interpretation - 23rd International Conference, VMCAI 2022, Philadelphia, PA, USA, January 16-18, 2022, Proceedings. Lecture Notes in Computer Science 13182, Springer 2022, ISBN 978-3-030-94582-4 - Ezio Bartocci, Thomas Ferrère, Thomas A. Henzinger, Dejan Nickovic, Ana Oliveira da Costa:
Flavors of Sequential Information Flow. 1-19 - Vincenzo Arceri, Martina Olliaro, Agostino Cortesi, Pietro Ferrara:
Relational String Abstract Domains. 20-42 - David Bayani, Stefan Mitsch:
Fanoos: Multi-resolution, Multi-strength, Interactive Explanations for Learned Systems. 43-68 - Gidon Ernst:
Loop Verification with Invariants and Contracts. 69-92 - Chen Fu, Ernst Moritz Hahn, Yong Li, Sven Schewe, Meng Sun, Andrea Turrini, Lijun Zhang:
EPMC Gets Knowledge in Multi-agent Systems. 93-107 - Stephen Goldbaum, Attila Mihály, Tosha Ellison, Earl T. Barr, Mark Marron:
High Assurance Software for Financial Regulation and Business Platforms. 108-126 - Linus Heck, Jip Spel, Sebastian Junges, Joshua Moerman, Joost-Pieter Katoen:
Gradient-Descent for Randomized Controllers Under Partial Observability. 127-150 - Peter Gjøl Jensen, Jirí Srba, Nikolaj Jensen Ulrik, Simon Mejlby Virenfeldt:
Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking. 151-173 - Depeng Liu, Bow-Yaw Wang, Lijun Zhang:
Verifying Pufferfish Privacy in Hidden Markov Models. 174-196 - Solène Mirliaz, David Pichardie:
A Flow-Insensitive-Complete Program Representation. 197-218 - Olivier Nicole, Matthieu Lemerre, Xavier Rival:
Lightweight Shape Analysis Based on Physical Types. 219-241 - Jan Onderka, Stefan Ratschan:
Fast Three-Valued Abstract Bit-Vector Arithmetic. 242-262 - Elizabeth Polgreen, Andrew Reynolds, Sanjit A. Seshia:
Satisfiability and Synthesis Modulo Oracles. 263-284 - Pavithra Prabhakar:
Bisimulations for Neural Network Reduction. 285-300 - Rodrigo Raya, Viktor Kuncak:
NP Satisfiability for Arrays as Powers. 301-318 - Riley Roberts, Thakur Neupane, Lukas Buecherl, Chris J. Myers, Zhen Zhang:
STAMINA 2.0: Improving Scalability of Infinite-State Stochastic Model Checking. 319-331 - Georg Stefan Schmid, Viktor Kuncak:
Generalized Arrays for Stainless Frames. 332-354 - Tobias Seufert, Christoph Scholl, Arun Chandrasekharan, Sven Reimer, Tobias Welp:
Making PROGRESS in Property Directed Reachability. 355-377 - Landon Taylor, Zhen Zhang:
Scaling Up Livelock Verification for Network-on-Chip Routing Algorithms. 378-399 - Rahmadi Trimananda, Weiyu Luo, Brian Demsky, Guoqing Harry Xu:
Stateful Dynamic Partial Order Reduction for Model Checking Event-Driven Applications that Do Not Terminate. 400-424 - Scott Wesley, Maria Christakis, Jorge A. Navas, Richard J. Trefler, Valentin Wüstholz, Arie Gurfinkel:
Verifying Solidity Smart Contracts via Communication Abstraction in SmartACE. 425-449 - Tobias Winkler, Johannes Lehmann, Joost-Pieter Katoen:
Out of Control: Reducing Probabilistic Models by Control-State Elimination. 450-472 - Yuming Wu, Lei Bu, Jiawan Wang, Xinyue Ren, Wen Xiong, Xuandong Li:
Mixed Semantics Guided Layered Bounded Reachability Analysis of Compositional Linear Hybrid Automata. 473-495 - Yoni Zohar, Ahmed Irfan, Makai Mann, Aina Niemetz, Andres Nötzli, Mathias Preiner, Andrew Reynolds, Clark W. Barrett, Cesare Tinelli:
Bit-Precise Reasoning via Int-Blasting. 496-518
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-01-06 23:28 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:
