![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Matthias Raffelsieper
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j5]Jan Friso Groote
, Remco van der Hofstad
, Matthias Raffelsieper:
On the random structure of behavioural transition systems. Sci. Comput. Program. 128: 51-67 (2016) - 2014
- [j4]Jan Friso Groote, Remco van der Hofstad, Matthias Raffelsieper:
On the Random Structure of Behavioural Transition Systems. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014) - [c11]Thorben Keller, Matthias Raffelsieper:
Cosibon: an E-commerce like platform enabling bricks-and-mortar stores to use sophisticated product recommender systems. RecSys 2014: 367-368 - 2013
- [c10]Matthias Raffelsieper, Alexander Ilic, Thorben Keller, Elgar Fleisch:
Efficient Encoding and Transmission of Digital Receipts for Mobile Commerce. ICMB 2013: 14 - 2011
- [j3]Matthias Raffelsieper, Mohammad Reza Mousavi
, J. Sleuters:
Process Algebra as a Common Framework for Hardware/Software Coverification. IEEE Embed. Syst. Lett. 3(1): 9-12 (2011) - [j2]Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema:
Long-run order-independence of vector-based transition systems. IET Comput. Digit. Tech. 5(6): 468-478 (2011) - [j1]Jürgen Giesl
, Matthias Raffelsieper, Peter Schneider-Kamp
, Stephan Swiderski, René Thiemann
:
Automated termination proofs for haskell by term rewriting. ACM Trans. Program. Lang. Syst. 33(2): 7:1-7:39 (2011) - [c9]Matthias Raffelsieper, Mohammad Reza Mousavi
:
Symbolic Power Analysis of Cell Libraries. FMICS 2011: 134-148 - [c8]Matthias Raffelsieper:
Productivity of Non-Orthogonal Term Rewrite Systems. WRS 2011: 53-67 - 2010
- [c7]Matthias Raffelsieper, Mohammad Reza Mousavi
, Hans Zantema:
Order-Independence of Vector-Based Transition Systems. ACSD 2010: 115-123 - [c6]Matthias Raffelsieper, Mohammad Reza Mousavi, Chris W. H. Strolenberg:
Checking and deriving module paths in Verilog cell library descriptions. DATE 2010: 1506-1511 - [c5]Hans Zantema, Matthias Raffelsieper:
Proving Productivity in Infinite Data Structures. RTA 2010: 401-416
2000 – 2009
- 2009
- [c4]Matthias Raffelsieper, Jan-Willem Roorda, Mohammad Reza Mousavi
:
Model Checking Verilog Descriptions of Cell Libraries. ACSD 2009: 128-137 - [c3]Matthias Raffelsieper, Mohammad Reza Mousavi
, Jan-Willem Roorda, Chris W. H. Strolenberg, Hans Zantema:
Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models. FMICS 2009: 133-148 - [c2]Hans Zantema, Matthias Raffelsieper:
Stream Productivity by Outermost Termination. WRS 2009: 83-95 - 2008
- [c1]Matthias Raffelsieper, Hans Zantema:
A Transformational Approach to Prove Outermost Termination Automatically. WRS@RTA 2008: 3-21
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint