default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarald Fecher
Person information
- affiliation: University of Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j9]Harald Fecher, Sharon Shoham
:
Local abstraction-refinement for the μ-calculus. Int. J. Softw. Tools Technol. Transf. 13(4): 289-306 (2011)- 2010
- [j8]Harald Fecher, Michael Huth, Nir Piterman, Daniel Wagner:
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games. Perform. Evaluation 67(9): 858-872 (2010)
2000 – 2009
- 2009
- [c23]Harald Fecher, David de Frutos-Escrig, Gerald Lüttgen, Heiko Schmidt:
On the Expressiveness of Refinement Settings. FSEN 2009: 276-291 - 2008
- [j7]Harald Fecher, Heiko Schmidt:
Comparing disjunctive modal transition systems with an one-selecting variant. J. Log. Algebraic Methods Program. 77(1-2): 20-39 (2008) - [c22]Harald Fecher, Michael Huth, Nir Piterman, Daniel Wagner:
Hintikka Games for PCTL on Labeled Markov Chains. QEST 2008: 169-178 - [c21]Harald Fecher, Sharon Shoham:
State Focusing: Lazy Abstraction for the Mu-Calculus. SPIN 2008: 95-113 - [c20]Harald Fecher, Michael Huth:
Model Checking for Action Abstraction. VMCAI 2008: 112-126 - 2007
- [c19]Harald Fecher, Immo Grabe:
Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic. FSEN 2007: 1-16 - [c18]Harald Fecher, Sharon Shoham:
Local Abstraction-Refinement for the mu-Calculus. SPIN 2007: 4-23 - [c17]Harald Fecher, Michael Huth:
More Precise Partition Abstractions. VMCAI 2007: 167-181 - [c16]Harald Fecher, Heiko Schmidt:
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems. SOS@LICS/ICALP 2007: 45-60 - [c15]Harald Fecher, Michael Huth, Heiko Schmidt, Jens Schönborn:
Refinement Sensitive Formal Semantics of State Machines With Persistent Choice. AVoCS 2007: 71-86 - 2006
- [j6]Harald Fecher, Mila E. Majster-Cederbaum:
Action Refinement Applied to Late Decisions. Formal Aspects Comput. 18(2): 211-230 (2006) - [c14]Harald Fecher, Michael Huth:
Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise. ATVA 2006: 322-336 - [c13]Harald Fecher, Jens Schönborn:
UML 2.0 State Machines: Complete Formal Semantics Via core state machine. FMICS/PDMC 2006: 244-260 - [c12]Harald Fecher, Martin Leucker, Verena Wolf:
Don't Know in Probabilistic Systems. SPIN 2006: 71-88 - 2005
- [j5]Harald Fecher, Mila E. Majster-Cederbaum:
Event Structures for Arbitrary Disruption. Fundam. Informaticae 68(1-2): 103-130 (2005) - [c11]Harald Fecher, Jens Schönborn, Marcel Kyas, Willem P. de Roever:
29 New Unclarities in the Semantics of UML 2.0 State Machines. ICFEM 2005: 52-65 - [c10]Harald Fecher, Marcel Kyas, Willem P. de Roever, Frank S. de Boer:
Compositional Operational Semantics of a UML-Kernel-Model Language. SOS@ICALP 2005: 79-96 - 2004
- [j4]Harald Fecher:
A completed hierarchy of true concurrent equivalences. Inf. Process. Lett. 89(5): 261-265 (2004) - [j3]Jinzhao Wu, Harald Fecher:
Symmetric Structure in Logic Programming. J. Comput. Sci. Technol. 19(6): 803-811 (2004) - [c9]Harald Fecher:
The Influence of Durational Actions on Time Equivalences. FORMATS/FTRTFT 2004: 231-245 - [c8]Marcel Kyas, Harald Fecher, Frank S. de Boer, Joost Jacob, Jozef Hooman, Mark van der Zwaag, Tamarah Arons, Hillel Kugler:
Formalizing UML Models and OCL Constraints in PVS. SFEDL@ETAPS 2004: 39-47 - [c7]Harald Fecher, Martin Steffen:
Characteristic mu-Calculus Formulas for Underspecified Transition Systems. EXPRESS 2004: 103-116 - [c6]Harald Fecher:
Truly Concurrent Logic via In-Between Specification. AVoCS 2004: 215-230 - 2003
- [b1]Harald Fecher:
Action refinement in end-based choice settings. University of Mannheim, 2003, pp. 1-186 - [c5]Mila E. Majster-Cederbaum, Naijun Zhan, Harald Fecher:
Action Refinement from a Logical Point of View. VMCAI 2003: 253-267 - [c4]Harald Fecher:
Event Structures for Interrupt Process Algebras. EXPRESS 2003: 113-127 - 2002
- [j2]Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu:
Bundle event structures: A revised cpo approach. Inf. Process. Lett. 83(1): 7-12 (2002) - [c3]Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu:
Action Refinement for Probabilistic Processes with True Concurrency Models. PAPM-PROBMIV 2002: 77-94 - [c2]Harald Fecher, Mila E. Majster-Cederbaum:
Taking decisions late: end-based choice combined with action refinement. Refine 2002: 244-259 - [c1]Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu:
Refinement of actions in a real-time process algebra with a true concurrency model. Refine 2002: 260-280 - 2001
- [j1]Harald Fecher:
A Real-Time Process Algebra with Open Intervals and Maximal Progress. Nord. J. Comput. 8(3): 346-365 (2001)
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 22:54 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:
