default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Baldamus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[c12]Michael Baldamus, Joachim Parrow, Björn Victor:
A Fully Abstract Encoding of the pi-Calculus with Data Terms. ICALP 2005: 1202-1213- 2004
- [c11]Michael Baldamus, Joachim Parrow, Björn Victor:
Spi Calculus Translated to ?--Calculus Preserving May-Tests. LICS 2004: 22-31 - [c10]Michael Baldamus, Jesper Bengtson, Gian-Luigi Ferrari
, Roberto Raggi:
Web Services as a New Approach to Distributing and Coordinating Semantics-Based Veri cation Toolkits. WSFM 2004: 11-20 - 2002
- [j3]Michael Baldamus, Klaus Schneider:
The BDD Space Complexity of Different Forms of Concurrency. Fundam. Informaticae 50(2): 111-133 (2002) - [c9]Michael Baldamus, Thomas Stauner:
Modifying Esterel Concepts to Model Hybrid Systems. SLAP@ETAPS 2002: 35-49 - 2001
- [c8]Michael Baldamus, Klaus Schneider:
The BDD Space Complexity of Different Forms of Concurrency. ACSD 2001: 231- - [c7]Michael Baldamus, Jochen Schröder-Babo:
p2b: A Translation Utility for Linking Promela and Symbolic Model Checking (Tool Paper). SPIN 2001: 183-191 - 2000
- [c6]Michael Baldamus:
Compositional Constructor Interpretation over Coalgebraic Models for the pi-Calculus. CMCS 2000: 13-41 - [c5]Michael Baldamus, Klaus Schneider, Michael Wenz, Roberto Ziller:
Can American Checkers be Solved by Means of Symbolic Model Checking? FM-Everywhere@FORTE/PSTV 2000: 15-33 - [c4]Michael Baldamus:
First-order Semantics for Higher-order Processes. HOOTS 2000: 50-69
1990 – 1999
- 1999
- [j2]Felix Cornelius, Michael Baldamus, Hartmut Ehrig, Fernando Orejas:
Abstract and behaviour module specifications. Math. Struct. Comput. Sci. 9(1): 21-62 (1999) - 1998
- [b1]Michael Baldamus:
Semantics and logic of higher order processes: characterizing late context bisimulation. Technical University of Berlin, Germany, 1998 - 1997
- [c3]Michael Baldamus, Jürgen Dingel:
Modal Characterization of Weak Bisimulation for Higher-order Processes (Extended Abstract). TAPSOFT 1997: 285-296 - 1993
- [p1]Hartmut Ehrig, Michael Baldamus, Fernando Orejas:
New Concepts for Amalgamation and Extension in the Framework of Specification Logics. Current Trends in Theoretical Computer Science 1993: 161-182 - 1991
- [j1]Hartmut Ehrig, Michael Baldamus, Fernando Orejas:
Amalgamation and Extension in the Framework of Specification Logics and Generalized Morphisms. Bull. EATCS 44: 129-143 (1991) - [c2]Hartmut Ehrig, Michael Baldamus, Felix Cornelius, Fernando Orejas:
Theory of Algebraic Module Specification including Behavioral Semantics and Constraints. AMAST 1991: 145-172 - [c1]Hartmut Ehrig, Michael Baldamus, Fernando Orejas:
New Concepts of Amalgamation and Extension for a General Theory of Specifications. COMPASS/ADT 1991: 199-221
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-10-07 21:20 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:
