Harald Fecher

Affiliations:
  • University of Freiburg, Germany


According to our database1, Harald Fecher authored at least 33 papers between 2001 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2011
Local abstraction-refinement for the <i>μ</i>-calculus.
Int. J. Softw. Tools Technol. Transf., 2011

2010
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games.
Perform. Evaluation, 2010

2009
On the Expressiveness of Refinement Settings.
Proceedings of the Fundamentals of Software Engineering, 2009

2008
Comparing disjunctive modal transition systems with an one-selecting variant.
J. Log. Algebraic Methods Program., 2008

Model Checking for Action Abstraction.
Proceedings of the Verification, 2008

State Focusing: Lazy Abstraction for the Mu-Calculus.
Proceedings of the Model Checking Software, 2008

Hintikka Games for PCTL on Labeled Markov Chains.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

2007
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems.
Proceedings of the Fourth Workshop on Structural Operational Semantics, 2007

Refinement Sensitive Formal Semantics of State Machines With Persistent Choice.
Proceedings of the Seventh International Workshop on Automated Verification of Critical Systems, 2007

More Precise Partition Abstractions.
Proceedings of the Verification, 2007

Local Abstraction-Refinement for the mu-Calculus.
Proceedings of the Model Checking Software, 2007

Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic.
Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

2006
Action Refinement Applied to Late Decisions.
Formal Aspects Comput., 2006

<i>Don't Know</i> in Probabilistic Systems.
Proceedings of the Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30, 2006

UML 2.0 State Machines: Complete Formal Semantics Via core state machine.
Proceedings of the Formal Methods: Applications and Technology, 2006

Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Event Structures for Arbitrary Disruption.
Fundam. Informaticae, 2005

Compositional Operational Semantics of a UML-Kernel-Model Language.
Proceedings of the Second Workshop on Structural Operational Semantics, 2005

29 New Unclarities in the Semantics of UML 2.0 State Machines.
Proceedings of the Formal Methods and Software Engineering, 2005

2004
Symmetric Structure in Logic Programming.
J. Comput. Sci. Technol., 2004

A completed hierarchy of true concurrent equivalences.
Inf. Process. Lett., 2004

Formalizing UML Models and OCL Constraints in PVS.
Proceedings of the Second Workshop on Semantic Foundations of Engineering Design Languages, 2004

Characteristic mu-Calculus Formulas for Underspecified Transition Systems.
Proceedings of the 11th International Workshop on Expressiveness in Concurrency, 2004

Truly Concurrent Logic via In-Between Specification.
Proceedings of the Fouth International Workshop on Automated Verification of Critical Systems, 2004

The Influence of Durational Actions on Time Equivalences.
Proceedings of the Formal Techniques, 2004

2003
Action refinement in end-based choice settings.
PhD thesis, 2003

Event Structures for Interrupt Process Algebras.
Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Action Refinement from a Logical Point of View.
Proceedings of the Verification, 2003

2002
Bundle event structures: A revised cpo approach.
Inf. Process. Lett., 2002

Refinement of actions in a real-time process algebra with a true concurrency model.
Proceedings of the BCS FACS Refinement Workshop 2002, 2002

Taking decisions late: end-based choice combined with action refinement.
Proceedings of the BCS FACS Refinement Workshop 2002, 2002

Action Refinement for Probabilistic Processes with True Concurrency Models.
Proceedings of the Process Algebra and Probabilistic Methods, 2002

2001
A Real-Time Process Algebra with Open Intervals and Maximal Progress.
Nord. J. Comput., 2001


  Loading...