Остановите войну!
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
- 2003
- Mark D. Aagaard:
A Hazards-Based Correctness Statement for Pipelined Circuits. CHARME 2003: 66-80 - Husam Abu-Haimed, Sergey Berezin, David L. Dill:
Semi-formal Verification of Memory Systems by Symbolic Simulation. CHARME 2003: 158-163 - Sharon Barner, Ishai Rabinovitz:
Effcient Symbolic Model Checking of Software Using Partial Disjunctive Partitioning. CHARME 2003: 35-50 - Lennart Beringer:
A Programming Language Based Analysis of Operand Forwarding. CHARME 2003: 270-276 - Sven Beyer, Christian Jacobi, Daniel Kroening, Dirk Leinenbach, Wolfgang J. Paul:
Instantiating Uninterpreted Functional Units and Memory System: Functional Verification of the VAMP. CHARME 2003: 51-65 - Randal E. Bryant, Shuvendu K. Lahiri, Sanjit A. Seshia:
Convergence Testing in Term-Level Bounded Model Checking. CHARME 2003: 348-362 - Sagar Chaki, Edmund M. Clarke, Alex Groce, Ofer Strichman:
Predicate Abstraction with Minimum Predicates. CHARME 2003: 19-34 - Hana Chockler, Orna Kupferman, Moshe Y. Vardi:
Coverage Metrics for Formal Verification. CHARME 2003: 111-125 - E. Allen Emerson, Vineet Kahlon:
Exact and Efficient Verification of Parameterized Cache Coherence Protocols. CHARME 2003: 247-262 - E. Allen Emerson, Thomas Wahl:
On Combining Symmetry Reduction and Symbolic Representation for Efficient Model Checking. CHARME 2003: 216-230 - Kathi Fisler:
Towards Diagrammability and Efficiency in Event Sequence Languages. CHARME 2003: 185-199 - Malay K. Ganai, Aarti Gupta, Zijiang Yang, Pranav Ashar:
Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking. CHARME 2003: 334-347 - Daniel Geist:
The PSL/Sugar Specification Language A Language for all Seasons. CHARME 2003: 3 - Michael J. C. Gordon, Joe Hurd, Konrad Slind:
Executing the Formal Semantics of the Accellera Property Specification Language by Mechanised Theorem Proving. CHARME 2003: 200-215 - Sankar Gurumurthy, Orna Kupferman, Fabio Somenzi, Moshe Y. Vardi:
On Complementing Nondeterministic Büchi Automata. CHARME 2003: 96-110 - Alan J. Hu, Jeremy Casas, Jin Yang:
Reasoning about GSTE Assertion Graphs. CHARME 2003: 170-184 - Warren A. Hunt Jr., Robert Bellarmine Krug, J Strother Moore:
Linear and Nonlinear Arithmetic in ACL2. CHARME 2003: 319-333 - Charles Hymans:
Design and Implementation of an Abstract Interpreter for VHDL. CHARME 2003: 263-269 - Subramanian K. Iyer, Debashis Sahoo, Christian Stangier, Amit Narayan, Jawahar Jain:
Improved Symbolic Verification Using Partitioning Techniques. CHARME 2003: 410-424 - Michael Langberg, Amir Pnueli, Yoav Rodeh:
The ROBDD Size of Simple CNF Formulas. CHARME 2003: 363-377 - Mohamed Layouni, Jozef Hooman, Sofiène Tahar:
On the Correctness of an Intrusion-Tolerant Group Communication Protocol. CHARME 2003: 231-246 - Panagiotis Manolios:
A Compositional Theory of Refinement for Branching Time. CHARME 2003: 304-318 - J Strother Moore:
Inductive Assertions and Operational Semantics. CHARME 2003: 289-303 - Enric Pastor, Marco A. Peña:
Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems. CHARME 2003: 378-393 - Giuseppe Della Penna, Benedetto Intrigila, Igor Melatti, Enrico Tronci, Marisa Venturini Zilli:
Integrating RAM and Disk Based Verification within the Mur-phi Verifier. CHARME 2003: 277-282 - Giuseppe Della Penna, Benedetto Intrigila, Igor Melatti, Enrico Tronci, Marisa Venturini Zilli:
Finite Horizon Analysis of Markov Chains with the Mur-phi Verifier. CHARME 2003: 394-409 - Wolfgang Roesner:
What Is beyond the RTL Horizon for Microprocessor and System Design? CHARME 2003: 1 - Cédric Roux, Emmanuelle Encrenaz:
CTL May Be Ambiguous When Model Checking Moore Machines. CHARME 2003: 164-169 - Ghiath Al Sammane, Diana Toma, Julien Schmaltz, Pierre Ostier, Dominique Borrione:
Constrained Symbolic Simulation with Mathematica and ACL2. CHARME 2003: 150-157 - Roberto Sebastiani, Stefano Tonetta:
"More Deterministic" vs. "Smaller" Büchi Automata for Efficient LTL Model Checking. CHARME 2003: 126-140
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-04-23 17:13 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