Остановите войну!
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 37 matches
- 2005
- Myla Archer:
Making PVS do what you want. MEMOCODE 2005: 67 - Felice Balarin, Roberto Passerone, Alessandro Pinto, Alberto L. Sangiovanni-Vincentelli:
A formal approach to system level design: metamodels and unified design environments. MEMOCODE 2005: 155-163 - Françoise Bellegarde, Samir Chouali, Jacques Julliand:
Refinemant verification of fair transition systems can contribute to PLTL model checking. MEMOCODE 2005: 166-175 - Nicola Bombieri, Andrea Fedeli, Franco Fummi:
Extended abstract: on the property-based verification in SoC design flow founded on transaction level modeling. MEMOCODE 2005: 239-240 - Stefano Brait, Franco Fummi, Graziano Pravadelli:
On the use of a high-level fault model to analyze logical consequence of properties. MEMOCODE 2005: 221-230 - Manfred Broy:
Automotive software and systems engineering (Panel). MEMOCODE 2005: 143-149 - Tevfik Bultan, Constance L. Heitmeyer, John O'Leary:
Panel on design for verification. MEMOCODE 2005: 232-235 - Nirav Dave, Man Cheuk Ng, Arvind:
Automatic synthesis of cache-coherence protocol processors using Bluespec. MEMOCODE 2005: 25-34 - Stephen A. Edwards, Olivier Tardieu:
Deterministic receptive processes are Kahn processes. MEMOCODE 2005: 37-44 - Masahiro Fujita:
Extended abstract: a formal design approach from software oriented UML descriptions to hardware oriented RTL. MEMOCODE 2005: 241-242 - Daniel Gajski:
System design extreme makeover. MEMOCODE 2005: 71-75 - Nicolas Halbwachs:
A synchronous language at work: the story of Lustre. MEMOCODE 2005: 3-11 - Greg Hoover, Forrest Brewer:
PyPBS design and methodologies. MEMOCODE 2005: 55-64 - Ralph D. Jeffords, Ramesh Bharadwaj:
Extended abstract: formal verification of architectural patterns in support of dependable distributed systems. MEMOCODE 2005: 243-244 - Jan Jürjens:
Verification of low-level crypto-protocol implementations using automated theorem proving. MEMOCODE 2005: 89-98 - Christos Kloukinas:
Thunderstriking constraints with JUPITER. MEMOCODE 2005: 211-220 - Daniel Kroening, Natasha Sharygina:
Formal verification of SystemC by automatic hardware/software partitioning. MEMOCODE 2005: 101-110 - Ingolf Krüger:
Service-oriented software and systems engineering - a vision for the automotive domain. MEMOCODE 2005: 150 - Elizabeth I. Leonard, Myla Archer:
Extended abstract: organizing automaton specifications to achieve faithful representation. MEMOCODE 2005: 245-246 - Panagiotis Manolios, Sudarshan K. Srinivasan:
A computationally ef~cient method based on commitment re~nement maps for verifying pipelined machines. MEMOCODE 2005: 188-197 - Gustaf Naeser, Johan Furunäs:
Extended abstract: evaluation of delay queues for a Ravenscar HW kernel. MEMOCODE 2005: 247-248 - Lars Pareto:
Extended abstract: requirements modeling within iterative, incremental processes. MEMOCODE 2005: 249-250 - Michael Pellauer, Mieszko Lis, Don Baltus, Rishiyur S. Nikhil:
Synthesis of synchronous assertions with guarded atomic actions. MEMOCODE 2005: 15-24 - Peter Poplavko, Twan Basten, Milan Pastrnak, Jef L. van Meerbergen, Marco Bekooij, Peter H. N. de With:
Extended abstract: estimation times of on-chip multiprocessor stream-oriented applications. MEMOCODE 2005: 250-251 - Wolfgang Pree:
From bold idea to product - a case study. MEMOCODE 2005: 151 - Klaus Rothbart, Ulrich Neffe, Christian Steger, Reinhold Weiss, Edgar Rieger, Andreas Mühlberger:
Extended abstract: an environment for design verification of smart card systems using attack simulation in SystemC. MEMOCODE 2005: 253-254 - Thanyapat Sakunkonchak, Satoshi Komatsu, Masahiro Fujita:
Synchronization verification in system-level design with ILP solvers. MEMOCODE 2005: 121-130 - Nicolae Savoiu, Sandeep K. Shukla, Rajesh K. Gupta:
Improving SystemC simulation through Petri net reductions. MEMOCODE 2005: 131-140 - Patrick Schaumont, Sandeep K. Shukla, Ingrid Verbauwhede:
Extended abstract: a race-free hardware modeling language. MEMOCODE 2005: 255-256 - Tobias Schüle, Klaus Schneider:
Three-valued logic in bounded model checking. MEMOCODE 2005: 177-186
skipping 7 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-06-01 06:46 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