Остановите войну!
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 35 matches
- 1999
- Mark D. Aagaard, Thomas F. Melham, John W. O'Leary:
Xs are for Trajectory Evaluation, Booleans are for Theorem Proving. CHARME 1999: 202-218 - Nina Amla, E. Allen Emerson, Kedar S. Namjoshi:
Efficient Decompositional Model Checking for Regular Timing Diagrams. CHARME 1999: 67-81 - Gérard Berry:
Esterel and Jazz: Two Synchronous Languages for Circuit Design (Abstract). CHARME 1999: 1 - Christian Blumenröhr, Viktor K. Sabelfeld:
Formal Synthesis at the Algorithmic Level. CHARME 1999: 187-201 - Marius Bozga, Oded Maler, Stavros Tripakis:
Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics. CHARME 1999: 125-141 - Edmund M. Clarke, Masahiro Fujita, Sreeranga P. Rajan, Thomas W. Reps, Subash Shankar, Tim Teitelbaum:
Program Slicing of Hardware Description Languages. CHARME 1999: 298-312 - Edmund M. Clarke, Somesh Jha, Yuan Lu, Dong Wang:
Abstract BDDs: A Technique for Using Abstraction in Model Checking. CHARME 1999: 172-186 - Byron Cook, John Launchbury, John Matthews, Richard B. Kieburtz:
Formal Verification of Explicitly Parallel Microprocessors. CHARME 1999: 23-36 - Nancy A. Day, Jeffrey R. Lewis, Byron Cook:
Symbolic Simulation of Microprocessor Models using Type Classes in Haskell. CHARME 1999: 346-349 - George Economakos, George K. Papakonstantinou:
Refinement and Property Checking in High-Level Synthesis using Attribute Grammars. CHARME 1999: 330-333 - Cindy Eisner:
Using Symbolic Model Checking to Verify the Railway Stations of Hoorn-Kersenboogerd and Heerhugowaard. CHARME 1999: 97-109 - E. Allen Emerson, Richard J. Trefler:
From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking. CHARME 1999: 142-156 - Kathi Fisler, Moshe Y. Vardi:
Bisimulation and Model Checking. CHARME 1999: 338-341 - Jens Chr. Godesken:
Fault Models for Embedded Systems (Extended Abstract). CHARME 1999: 354-359 - Aarti Gupta, Pranav Ashar, Sharad Malik:
Exploiting Retiming in a Guided Simulation Based Validation Methodology. CHARME 1999: 350-353 - Stefan Hendricx, Luc J. M. Claesen:
Verification of Finite-State-Machine Refinements Using a Symbolic Methodology. CHARME 1999: 326-329 - Dirk W. Hoffmann, Thomas Kropf:
Automatic Error Correction of Large Circuits Using Boolean Decomposition and Abstraction. CHARME 1999: 157-171 - Ravi Hosabettu, Ganesh Gopalakrishnan, Mandayam K. Srivas:
A Proof of Correctness of a Processor Implementing Tomasulo's Algorithm without a Reorder Buffer. CHARME 1999: 8-22 - Peter Jansen:
Design Process of Embedded Automotive Systems - Using Model Checking for Correct Specification. CHARME 1999: 2-7 - Steven D. Johnson, Yanhong A. Liu, Yuchen Zhang:
A Systematic Incrementalization Technique and Its Application to Hardware Design. CHARME 1999: 334-337 - Sagi Katz, Orna Grumberg, Daniel Geist:
"Have I written enough Properties?" - A Method of Comparison between Specification and Implementation. CHARME 1999: 280-297 - Orna Kupferman, Moshe Y. Vardi:
Vacuity Detection in Temporal Model Checking. CHARME 1999: 82-96 - Kenneth L. McMillan:
Verification of Infinite State Systems by Compositional Model Checking. CHARME 1999: 219-234 - Kenneth L. McMillan:
Circular Compositional Reasoning about Liveness. CHARME 1999: 342-345 - Kavita Ravi, Fabio Somenzi:
Hints to accelerate Symbolic Traversal. CHARME 1999: 250-264 - Gerd Ritter, Hans Eveking, Holger Hinrichsen:
Formal Verification of Designs with Complex Control by Symbolic Simulation. CHARME 1999: 234-249 - Jürgen Ruf, Thomas Kropf:
Modleing and Checking Networks of Communicating Real-Time Process. CHARME 1999: 265-279 - Jun Sawada, Warren A. Hunt Jr.:
Results of the Verification of a Complex Pipelined Machine Model. CHARME 1999: 313-316 - Klaus Schneider:
Yet another Look at the LTL Model Checking. CHARME 1999: 321-325 - Klaus Schneider, Michaela Huhn, George Logothetis:
Validation of Object-Oriented Concurrent Designs by Model Checking. CHARME 1999: 360-364
skipping 5 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-08-02 20:34 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