default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. VMCAI 2006: Charleston, SC, USA
- E. Allen Emerson, Kedar S. Namjoshi:
Verification, Model Checking, and Abstract Interpretation, 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings. Lecture Notes in Computer Science 3855, Springer 2006, ISBN 3-540-31139-4 - Peter Schachte
, Harald Søndergaard:
Closure Operators for ROBDDs. 1-16 - Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
A CLP Method for Compositional and Intermittent Predicate Abstraction. 17-32 - Gilad Arnold, Roman Manevich, Mooly Sagiv, Ran Shaham:
Combining Shape Analyses by Intersecting Abstractions. 33-48 - Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. 49-64 - Laura Bozzelli:
Complexity Results on Branching-Time Pushdown Model Checking. 65-79 - Gang Tan, Andrew W. Appel:
A Compositional Logic for Control Flow. 80-94 - Stefano Rossignoli, Fausto Spoto:
Detecting Non-cyclicity by Abstract Compilation into Boolean Functions. 95-110 - Sriram Sankaranarayanan, Michael Colón, Henny B. Sipma, Zohar Manna:
Efficient Strongly Relational Polyhedral Analysis. 111-125 - Edmund M. Clarke, Muralidhar Talupur, Helmut Veith:
Environment Abstraction for Parameterized Verification. 126-141 - Håkan L. S. Younes:
Error Control for Probabilistic Model Checking. 142-156 - Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, Martin C. Rinard:
Field Constraint Analysis. 157-173 - Bor-Yuh Evan Chang, Adam Chlipala, George C. Necula:
A Framework for Certified Program Analysis and Its Applications to Mobile-Code Safety. 174-189 - Katia Hristova, Yanhong A. Liu:
Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems. 190-206 - Jesse D. Bingham, Zvonimir Rakamaric:
A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs. 207-221 - A. Prasad Sistla, Min Zhou, Lenore D. Zuck:
Monitoring Off-the-Shelf Components. 222-236 - Shahid Jabbar, Stefan Edelkamp:
Parallel External Directed Model Checking with Linear I/O. 237-251 - Naghmeh Ghafari, Richard J. Trefler:
Piecewise FIFO Channels Are Analyzable. 252-266 - Ittai Balaban, Ariel Cohen, Amir Pnueli:
Ranking Abstraction of Recursive Programs. 267-281 - Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
Relative Safety. 282-297 - Naoki Kobayashi, Kohei Suenaga, Lucian Wischik:
Resource Usage Analysis for the pi-Calculus. 298-312 - Francesco Logozzo, Agostino Cortesi:
Semantic Hierarchy Refactoring by Abstract Interpretation. 313-331 - Francesco Ranzato, Francesco Tapparo:
Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation. 332-347 - Antoine Miné:
Symbolic Methods to Enhance the Precision of Numerical Abstract Domains. 348-363 - Nir Piterman, Amir Pnueli, Yaniv Sa'ar:
Synthesis of Reactive(1) Designs. 364-380 - Arie Gurfinkel, Ou Wei, Marsha Chechik:
Systematic Construction of Abstractions for Model-Checking. 381-397 - K. Subramani:
Totally Clairvoyant Scheduling with Relative Timing Constraints. 398-411 - Laura Bozzelli, Salvatore La Torre, Adriano Peron:
Verification of Well-Formed Communicating Recursive State Machines. 412-426 - Aaron R. Bradley, Zohar Manna, Henny B. Sipma:
What's Decidable About Arrays? 427-442
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-03-01 15:01 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:
