Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 41 matches
- 2007
- Bijan Alizadeh, Masahiro Fujita:
Automatic Merge-Point Detection for Sequential Equivalence Checking of System-Level and RTL Descriptions. ATVA 2007: 129-144 - Jörg Bauer, Tobe Toben, Bernd Westphal:
Mind the Shapes: Abstraction Refinement Via Topology Invariants. ATVA 2007: 35-50 - Bernard Berthomieu, Florent Peres, François Vernadat:
Model Checking Bounded Prioritized Time Petri Nets. ATVA 2007: 523-532 - Dragan Bosnacki, Alastair F. Donaldson, Michael Leuschel, Thierry Massart:
Efficient Approximate Verification of Promela Models Via Symmetry Markers. ATVA 2007: 300-315 - Hichem Boudali, Pepijn Crouzen, Mariëlle Stoelinga:
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains. ATVA 2007: 441-456 - Marco Bozzano, Alessandro Cimatti, Francesco Tapparo:
Symbolic Fault Tree Analysis for Reactive Systems. ATVA 2007: 162-176 - Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Didier Lime, Jean-François Raskin:
Timed Control with Observation Based and Stuttering Invariant Strategies. ATVA 2007: 192-206 - Werner Damm, Stefan Disch, Hardi Hungar, Swen Jacobs, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz:
Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space. ATVA 2007: 425-440 - Muhammad Torabi Dashti, Anton Wijs:
Pruning State Spaces with Extended Beam Search. ATVA 2007: 543-552 - Christian Dax, Jochen Eisinger, Felix Klaedtke:
Mechanizing the Powerset Construction for Restricted Classes of omega -Automata. ATVA 2007: 223-236 - Edith Elkind, Blaise Genest, Doron A. Peled, Paola Spoletini:
Quantifying the Discord: Order Discrepancies in Message Sequence Charts. ATVA 2007: 378-393 - Thomas Gawlitza, Helmut Seidl:
Computing Game Values for Crash Games. ATVA 2007: 177-191 - Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the Efficient Computation of the Minimal Coverability Set for Petri Nets. ATVA 2007: 98-113 - Orna Grumberg, Assaf Schuster, Avi Yadgar:
3-Valued Circuit SAT for STE with Automatic Refinement. ATVA 2007: 457-473 - Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Proving Termination of Tree Manipulating Programs. ATVA 2007: 145-161 - Tingting Han, Joost-Pieter Katoen:
Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking. ATVA 2007: 331-346 - Atsushi Hasegawa:
Recent Trend in Industry and Expectation to DA Research. ATVA 2007: 15-16 - Geng-Dian Huang, Bow-Yaw Wang:
Complete SAT-Based Model Checking for Context-Free Processes. ATVA 2007: 51-65 - Moonzoo Kim:
Formal Modeling and Verification of High-Availability Protocol for Network Security Appliances. ATVA 2007: 489-500 - Orna Kupferman, Yoad Lustig:
Latticed Simulation Relations and Games. ATVA 2007: 316-330 - Guoqiang Li, Mizuhito Ogawa:
On-the-Fly Model Checking of Fair Non-repudiation Protocols. ATVA 2007: 511-522 - Scott Little, David Walter, Kevin R. Jones, Chris J. Myers:
Analog/Mixed-Signal Circuit Verification Using Models Generated from Simulation Traces. ATVA 2007: 114-128 - Kenneth L. McMillan:
Toward Property-Driven Abstraction for Heap Manipulating Programs. ATVA 2007: 17-18 - Mercedes G. Merayo, Manuel Núñez, Ismael Rodríguez:
A Brief Introduction to THOTL. ATVA 2007: 501-510 - Sumit Nain, Moshe Y. Vardi:
Branching vs. Linear Time: Semantical Perspective. ATVA 2007: 19-34 - Rotem Oshman, Orna Grumberg:
A New Approach to Bounded Model Checking for Branching Time Logics. ATVA 2007: 410-424 - Gordon J. Pace, Cristian Prisacariu, Gerardo Schneider:
Model Checking Contracts - A Case Study. ATVA 2007: 82-97 - Sophie Pinchinat:
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies. ATVA 2007: 253-267 - Zvonimir Rakamaric, Roberto Bruttomesso, Alan J. Hu, Alessandro Cimatti:
Verifying Heap-Manipulating Programs in an SMT Framework. ATVA 2007: 237-252 - Laura Recalde, Serge Haddad, Manuel Silva Suárez:
Continuous Petri Nets: Expressive Power and Decidability Issues. ATVA 2007: 362-377
skipping 11 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-23 11:06 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint