default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlbert Nymeyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j5]Jing Cao, Albert Nymeyer:
A design methodology for verified web-service mediators. Computing 95(7): 567-610 (2013)- 2011
- [c16]Jing Cao, Albert Nymeyer:
A Markov Performance Model for Buffered Protocol Design. ISVLSI 2011: 170-175 - 2010
- [c15]Jing Cao, Albert Nymeyer:
High-fidelity markovian power model for protocols. DATE 2010: 267-270 - [c14]Jing Cao, Albert Nymeyer:
A Markov Model for Low-Power High-Fidelity Design-Space Exploration. DSD 2010: 115-122 - [c13]Jing Cao, Albert Nymeyer:
The 'Best' Valid Safe Protocol Converter. SSIRI 2010: 237-243
2000 – 2009
- 2009
- [c12]Jing Cao, Albert Nymeyer:
Formal Model of a Protocol Converter. CATS 2009: 107-117 - [c11]Thang H. Bui, Albert Nymeyer:
Formal Verification Based on Guided Random Walks. IFM 2009: 72-87 - [c10]Thang H. Bui, Albert Nymeyer:
Heuristic Sensitivity in Guided Random-Walk Based Model Checking. SEFM 2009: 125-134 - [c9]Jing Cao, Albert Nymeyer:
Formally Synthesising a Protocol Converter: A Case Study. CIAA 2009: 249-252 - 2008
- [c8]Thang H. Bui, Albert Nymeyer:
The spin on guided random search in verification. ICST Workshops 2008: 170-177 - 2005
- [c7]Kairong Qian, Albert Nymeyer, Steven Susanto:
Abstraction-Guided Model Checking Using Symbolic IDA* and Heuristic Synthesis. FORTE 2005: 275-289 - [c6]Kairong Qian, Albert Nymeyer, Steven Susanto:
Experiments with Multiple Abstraction Heuristics in Symbolic Verification. SARA 2005: 290-304 - [c5]Kairong Qian, Albert Nymeyer:
Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis. MoChArt@CONCUR/SPIN 2005: 33-49 - 2004
- [c4]Kairong Qian, Albert Nymeyer:
Abstraction-Based Model Checking Using Heuristical Refinement. ATVA 2004: 165-178 - [c3]Kairong Qian, Albert Nymeyer:
Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases. TACAS 2004: 497-511 - 2003
- [c2]Albert Nymeyer, Kairong Qian:
Heuristic Search Algorithms Based on Symbolic Data Structures. Australian Conference on Artificial Intelligence 2003: 966-979 - 2000
- [j4]Joost-Pieter Katoen, Albert Nymeyer:
Pattern-matching algorithms based on term rewrite systems. Theor. Comput. Sci. 238(1-2): 439-464 (2000)
1990 – 1999
- 1997
- [j3]Albert Nymeyer, Joost-Pieter Katoen:
Code Generation Based on Formal BURS Therory and Heuristic Search. Acta Informatica 34(8): 597-635 (1997) - 1996
- [c1]Albert Nymeyer, Joost-Pieter Katoen
, Ymte Westra, Henk Alblas:
Code Generation = A* + BURS. CC 1996: 160-176 - 1995
- [j2]Albert Nymeyer:
A Grammatical Specification of Human-Computer Dialogue. Comput. Lang. 21(1): 1-16 (1995) - [j1]Albert Nymeyer:
Backtracking non-deterministic recognizers. J. Program. Lang. 3(4) (1995)
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:21 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:
