Michel Sintzoff

According to our database1, Michel Sintzoff authored at least 28 papers between 1971 and 2010.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Model Refinement Using Bisimulation Quotients.
Proceedings of the Algebraic Methodology and Software Technology, 2010

2009
A Semiring Approach to Equivalences, Bisimulations and Control.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2009

2008
Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems.
Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

2004
Iterative Synthesis of Control Guards Ensuring Invariance and Inevitability in Discrete-Decision Games.
Proceedings of the From Object-Orientation to Formal Methods, 2004

2003
On the design of correct and optimal dynamical systems and games.
Inf. Process. Lett., 2003

1997
Algebraic Composition and Refinement of Proofs.
Proceedings of the Algebraic Methodology and Software Technology, 1997

1996
Editorial (Selected Papers from the Third International Conference on the Mathematics of Program Construction).
Sci. Comput. Program., 1996

1995
Abstract Verification of Structured Dynamical Systems.
Proceedings of the Hybrid Systems III: Verification and Control, 1995

1993
Endomorphic Typing.
Proceedings of the Formal Program Development - IFIP TC2/WG 2.1 State-of-the-Art Report, 1993

Analysis of Dynamical Systems Using Predicate Transformers - Attraction and Composition.
Proceedings of the Analysis of Dynamical and Cognitive Systems, 1993

1991
Invariance and Contraction by Infinite Iterations of Relations.
Proceedings of the Research Directions in High-Level Parallel Programming Languages, 1991

1989
The Scientific Engineering of Software.
Proceedings of the 11th International Conference on Software Engineering, 1989

1984
Bounded-Horizon Success-Complete Restriction of Inference Programs.
Proceedings of the Second International Logic Programming Conference, 1984

1981
Editorial.
Sci. Comput. Program., 1981

Distributed Termination with Interval Assertions.
Proceedings of the Formalization of Programming Concepts, 1981

Proof-oriented and applicative valuations in definitions of algorithms.
Proceedings of the 1981 conference on Functional programming languages and computer architecture, 1981

1980
Suggestions for Composing and Specifying Program Design Decisions.
Proceedings of the International Symposium on Programming, 1980

1979
Formal Derivation of Strongly Correct Concurrent Programs.
Acta Informatica, 1979

Principles for Distributing Programs.
Proceedings of the Semantics of Concurrent Computation, 1979

1978
Ensuring Correctness by Arbitrary Postfixed-Points.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
Revised Report on the Algorithmic Language ALGOL 68.
ACM SIGPLAN Notices, 1977

1976
Eliminating Blind Alleys from Backtrack Programs.
Proceedings of the Third International Colloquium on Automata, 1976

Revised Report on the Algorithmic Language Algol 68
Springer, ISBN: 978-3-540-07592-9, 1976

1975
Revised Report on the Algorithmic Language ALGOL 68
Acta Informatica, 1975

Constructing correct and efficient concurrent programs.
Proceedings of the International Conference on Reliable Software 1975, 1975

1974
Revised ALGOL 68 syntax chart.
ACM SIGPLAN Notices, 1974

1972
Calculating properties of programs by valuations on specific models.
Proceedings of ACM Conference on Proving Assertions About Programs, 1972

1971
The Composition of Semantics in Algol 68.
Commun. ACM, 1971


  Loading...