default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadu Negulescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c19]Alen Docef, Radu Negulescu, Mihai Prunescu:
Using Z3 to Verify Inferences in Fragments of Linear Logic. FROM 2023: 11-25
2000 – 2009
- 2006
- [j5]Xiaohua Kong, Radu Negulescu:
Semihiding operators and active-edge specification. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(9): 1831-1846 (2006) - 2004
- [c18]Radu Negulescu:
General Testers for Asynchronous Circuits. ASYNC 2004: 28-38 - [c17]Xiaohua Kong, Radu Negulescu:
Bolstering Faith in GasP Circuits through Formal Verification. ASYNC 2004: 113-124 - [c16]Nisrine Saadallah, Xiaohua Kong, Radu Negulescu:
High-Speed Reduced Stack Dual Lock Circuits. ASYNC 2004: 219-228 - [c15]Janusz A. Brzozowski, Radu Negulescu:
Duality for Three: Ternary Symmetry in Process Spaces. Theory Is Forever 2004: 1-14 - 2003
- [j4]Xiaohua Kong, Radu Negulescu, Larry Weidong Ying:
Refinement-based formal verification with heterogeneous timing. Int. J. Softw. Tools Technol. Transf. 4(3): 359-370 (2003) - [c14]Radu Negulescu:
Generic Transforms on Incomplete Specifications of Asynchronous Interfaces. MFPS 2003: 187-200 - 2002
- [c13]Weiwen Zhu, Zeljko Zilic, Radu Negulescu:
A single-rail handshake CDMA correlator. ICECS 2002: 505-508 - 2001
- [c12]Radu Negulescu, Xiaohua Kong:
Semi-Hiding Operators and the Analysis of Active-Edge Specifications for Digital Circuits. ACSD 2001: 189- - [c11]Xiaohua Kong, Radu Negulescu:
Formal verification of pulse-mode asynchronous circuits. ASP-DAC 2001: 347-352 - [c10]Robert Berks, Radu Negulescu:
Partial-Order Correctness-Preserving Properties of Delay-Insensitive Circuits. ASYNC 2001: 74- - [c9]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 - [c8]Xiaohua Kong, Radu Negulescu:
Formal Verification of Peephole Optimizations in Asynchronous Circuits. FORTE 2001: 219-234 - 2000
- [j3]Janusz A. Brzozowski, Radu Negulescu:
Automata of Asynchronous Behaviors. Theor. Comput. Sci. 231(1): 113-128 (2000) - [c7]Radu Negulescu:
Process Spaces. CONCUR 2000: 199-213 - [c6]Hesham Hallal, Radu Negulescu, Alexandre Petrenko
:
Design of divergence-free protocol converters using supervisory control techniques. ICECS 2000: 705-708 - [c5]Sébastien Laberge, Radu Negulescu:
An asynchronous FIFO with fights: case study in speed optimization. ICECS 2000: 755-758
1990 – 1999
- 1998
- [j2]Radu Negulescu, Janusz A. Brzozowski:
Relative Liveness: From Intuition to Automated Verification. Formal Methods Syst. Des. 12(1): 73-115 (1998) - [c4]Radu Negulescu:
Event-Driven Verification of Switch-Level Correctness Concerns. ACSD 1998: 213-223 - [c3]Radu Negulescu, Ad M. G. Peeters:
Verification of Speed-Dependences in Single-Rail Handshake Circuits. ASYNC 1998: 159- - 1997
- [j1]Janusz A. Brzozowski, J. J. Lou, Radu Negulescu:
A Characterization of Finite Ternary Algebras. Int. J. Algebra Comput. 7(6): 713-722 (1997) - [c2]Janusz A. Brzozowski, Radu Negulescu:
Automata of Asynchronous Behaviors. Workshop on Implementing Automata 1997: 29-45 - 1995
- [c1]Radu Negulescu, Janusz A. Brzozowski:
Relative liveness: from intuition to automated verification. ASYNC 1995: 108-117
Coauthor Index
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.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
