Mila E. Majster-Cederbaum

According to our database1, Mila E. Majster-Cederbaum authored at least 69 papers between 1976 and 2015.

Collaborative distances :
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2015
A basis for compositionally ensuring safety properties and its connection to relational algebraic operators.
Sci. Comput. Program., 2015

2013
Efficient deadlock analysis of component-based software architectures.
Sci. Comput. Program., 2013

Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete.
Proceedings of the Proceedings 2nd Workshop on GRAPH Inspection and Traversal Engineering, 2013

2012
Deadlock-freedom in component systems with architectural constraints.
Formal Methods in System Design, 2012

2011
Analyzing Component-Based Systems on the Basis of Architectural Constraints.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

2010
On hierarchically developing reactive systems.
Inf. Comput., 2010

Reachability in Tree-Like Component Systems is PSPACE-Complete.
Electr. Notes Theor. Comput. Sci., 2010

Port Protocols for Deadlock-Freedom of Component Systems
Proceedings of the Proceedings Third Interaction and Concurrency Experience: Guaranteed Interaction, 2010

2009
Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation.
Proceedings of the TASE 2009, 2009

Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems.
Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Modular Consensus Algorithms for the Crash-Recovery Model.
Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

2008
Liveness in Interaction Systems.
Electr. Notes Theor. Comput. Sci., 2008

Easy Consensus Algorithms for the Crash-Recovery Model.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Everything Is PSPACE-Complete in Interaction Systems.
Proceedings of the Theoretical Aspects of Computing, 2008

Compositional analysis of deadlock-freedom for tree-like component architectures.
Proceedings of the 8th ACM & IEEE International conference on Embedded software, 2008

2007
A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

An Approach to Modelling and Verification of Component Based Systems.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Robustness in Interaction Systems.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2007

Interaction Models for Biochemical Reactions.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2007

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

Trace Semantics for Stochastic Systems with Nondeterminism.
Electr. Notes Theor. Comput. Sci., 2006

Trace Machines for Observing Continuous-Time Markov Chains.
Electr. Notes Theor. Comput. Sci., 2006

Refinement of actions for real-time concurrent systems with causal ambiguity.
Acta Inf., 2006

Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa.
Proceedings of the Theoretical Aspects of Computing, 2006

Ensuring Properties of Interaction Systems.
Proceedings of the Program Analysis and Compilation, 2006

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

Deriving Non-determinism from Conjunction and Disjunction.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

2004
Towards the hierarchical verification of reactive systems.
Theor. Comput. Sci., 2004

Formal Specification of an Asynchronous Processor via Action Refinement.
Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (MTV 2004), 2004

Refinement of Actions for Real-Time Concurrent Systems with Causal Ambiguity.
Proceedings of the Formal Methods and Software Engineering, 2004

2003
Towards action refinement for true concurrent real time.
Acta Inf., 2003

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

Adding Action Refinement to Stochastic True Concurrency Models.
Proceedings of the Formal Methods and Software Engineering, 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.
Electr. Notes Theor. Comput. Sci., 2002

Taking decisions late: end-based choice combined with action refinement.
Electr. Notes Theor. Comput. Sci., 2002

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

2001
Underspecification for a simple process algebra of recursive processes.
Theor. Comput. Sci., 2001

Action Refinement for True Concurrent Real Time.
Proceedings of the 7th International Conference on Engineering of Complex Computer Systems (ICECCS 2001), 2001

2000
Towards a unified view of bisimulation: a comparative study.
Theor. Comput. Sci., 2000

Deciding Bisimilarity and Similarity for Probabilistic Processes.
J. Comput. Syst. Sci., 2000

Correctness by Construction: Towards Verification in Hierarchical System Development.
Proceedings of the SPIN Model Checking and Software Verification, 7th International SPIN Workshop, Stanford, CA, USA, August 30, 2000

A Priori Verification of Reactive Systems.
Proceedings of the Formal Techniques for Distributed System Development, 2000

1999
A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic.
Proceedings of the Advances in Computing Science, 1999

1998
Transistion Systems from Event Structures Revisited.
Inf. Process. Lett., 1998

1997
How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages.
Fundam. Inform., 1997

The Connection Between Initial and Unique Solutions of Domain Equations in the Partial Order and Metric Approach.
Formal Asp. Comput., 1997

Metric Semantics from Partial Order Semantics.
Acta Inf., 1997

1996
Metric Completion versus Ideal Completion.
Theor. Comput. Sci., 1996

Denotational Linear Time Semantics and Sequential Composition.
Inf. Process. Lett., 1996

On two different Characterizations of Bisimulation.
Bulletin of the EATCS, 1996

A Categorical Characterization of Consistency Results.
Proceedings of the Algebraic Methodology and Software Technology, 1996

1994
The Comparison of a CPO-based Semantics with a CMS-based semantics for CSP.
Theor. Comput. Sci., 1994

Denotational Semantics in the CPO and Metric Approach.
Theor. Comput. Sci., 1994

The Connection between an Event Structure Semantics and an Operational Semantics for TCSP.
Acta Inf., 1994

1992
Ensuring the Existence of a BCNF-Decomposition that Preserves Functional Dependencies in O(N²) Time.
Inf. Process. Lett., 1992

1991
Towards a Foundation for Semantics in Complete Metric Spaces
Inf. Comput., February, 1991

The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1989
The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces.
Inf. Process. Lett., 1989

1988
On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces.
Inf. Process. Lett., 1988

1985
Elimination of redundant operations in relational queries with general selection operators.
Computing, 1985

1980
Efficient On-Line Construction and Correction of Position Trees.
SIAM J. Comput., 1980

A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs.
Inf. Process. Lett., 1980

Semantics: Algebras, Fixed Points, Axioms.
Proceedings of the Automata, 1980

1979
Data Types, Abstract Data Types and Their Specification Problem.
Theor. Comput. Sci., 1979

An Efficient On-Line Position Tree Construction Algorithm.
Proceedings of the Theoretical Computer Science, 1979

1977
Extended Directed Graphs, a Formalism for Structured Data and Data Structures.
Acta Inf., 1977

1976
A Model for Data Structures.
Proceedings of the ECI Conference 1976, 1976


  Loading...