Остановите войну!
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 36 matches
- 2001
- Mark D. Aagaard, Byron Cook, Nancy A. Day, Robert B. Jones:
A Framework for Microprocessor Correctness Statements. CHARME 2001: 433-448 - Alvin R. Albrecht, Alan J. Hu:
Register Transformations with Multiple Clock Domains. CHARME 2001: 126-139 - Robert Beers, Rajnish Ghughal, Mark D. Aagaard:
Applications of Hierarchical Verification in Model Checking. CHARME 2001: 40-57 - Christoph Berg, Christian Jacobi:
Formal Verification of the VAMP Floating Point Unit. CHARME 2001: 325-339 - Gérard Berry, Ellen Sentovich:
Multiclock Esterel. CHARME 2001: 110-125 - Dirk Beyer:
Efficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs. CHARME 2001: 86-91 - Jayanta Bhadra, Andrew K. Martin, Jacob A. Abraham, Magdy S. Abadir:
Using Abstract Specifications to Verify PowerPCTM Custom Memories by Symbolic Trajectory Evaluation. CHARME 2001: 386-402 - Ricky W. Butler, Victor Carreño, Gilles Dowek, César A. Muñoz:
Formal Verification of Conflict Detection Algorithms. CHARME 2001: 403-417 - Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, James H. Kukula, Helmut Veith, Dong Wang:
Using Combinatorial Optimization Methods for Quantification Scheduling. CHARME 2001: 293-309 - Koen Claessen, Mary Sheeran, Satnam Singh:
The Design and Verification of a Sorter Core. CHARME 2001: 355-369 - Fady Copty, Amitai Irron, Osnat Weissberg, Nathan P. Kropp, Gila Kamhi:
Efficient Debugging in a Formal Verification Environment. CHARME 2001: 275-292 - Javier Esparza, Claus Schröter:
Net Reductions for LTL Model-Checking. CHARME 2001: 310-324 - Eric Gascard, Laurence Pierre:
Induction-Oriented Formal Verification in Symmetric Interconnection Networks. CHARME 2001: 418-432 - Ji He, Kenneth J. Turner:
Specifying Hardware Timing with ET-L OTOS. CHARME 2001: 161-166 - Huibiao Zhu, Jonathan P. Bowen, Jifeng He:
From Operational Semantics to Denotational Semantics for Verilog. CHARME 2001: 449-466 - Steven D. Johnson:
View from the Fringe of the Fringe. CHARME 2001: 1-12 - Roope Kaivola, Katherine R. Kohatsu:
Proof Engineering in the Large: Formal Verification of Pentium® 4 Floating-Point Divider. CHARME 2001: 196-211 - Xiaohua Kong, Radu Negulescu, Larry Weidong Ying:
Refinement-Based Formal Verification of Asynchronous Wrappers for Independently Clocked Domains in Systems on Chip. CHARME 2001: 370-385 - Iskander Kort, Sofiène Tahar, Paul Curzon:
Hierarchical Verification Using an MDG-HOL Hybrid Tool. CHARME 2001: 244-258 - Steve McKeever, Wayne Luk:
Towards Provably-Correct Hardware Compilation Tools Based on Pass Separation Techniques. CHARME 2001: 212-227 - Kenneth L. McMillan:
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking. CHARME 2001: 179-195 - M. Oliver Möller, Rajeev Alur:
Heuristics for Hierarchical Partitioning with Application to Model Checking. CHARME 2001: 71-85 - Alan Mycroft, Richard Sharp:
Hardware Synthesis Using SAFL and Application to Processor Design. CHARME 2001: 13-39 - Rajesh Radhakrishnan, Elena Teica, Ranga Vemuri:
Verification of Basic Block Schedules Using RTL Transformations. CHARME 2001: 173-178 - Gil Ratsaby, Shmuel Ur, Yaron Wolfsthal:
Coverability Analysis Using Symbolic Model Checking. CHARME 2001: 155-160 - Tiberiu Seceleanu, Juha Plosila:
Formal Pipeline Design. CHARME 2001: 167-172 - Richard Sharp, Alan Mycroft:
A Higher-Level Language for Hardware Synthesis. CHARME 2001: 228-243 - Kanna Shimizu, David L. Dill, Ching-Tsun Chou:
A Specification Methodology by a Collection of Compact Properties as Applied to the Intel® ItaniumTM Processor Bus Protocol. CHARME 2001: 340-354 - Ofer Strichman:
Pruning Techniques for the SAT-Based Bounded Model Checking Problem. CHARME 2001: 58-70 - François Siewe, Dang Van Hung:
Deriving Real-Time Programs from Duration Calculus Specifications. CHARME 2001: 92-97
skipping 6 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-30 15:10 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