2010
Listing closed sets of strongly accessible set systems with applications to data mining.
Theor. Comput. Sci., 2010
Listing closed sets of strongly accessible set systems with applications to data.
Proceedings of the LWA 2010, 2010
2009
Evaluation of a "Smart" Pedestrian Counting System Based on Echo State Networks.
EURASIP J. Embed. Syst., 2009
New Results on Listing Closed Sets of Strongly Accessible Set Systems.
Proceedings of the Joint 7th Workshop on Mining and Learning with Graphs and the 6th International Workshop on Statistical Relational Learning, 2009
Towards a Reference Model for the LifeWatch ICT Infrastructure.
Proceedings of the 39. Jahrestagung der Gesellschaft für Informatik, Im Focus das Leben, INFORMATIK 2009, Lübeck, Germany, September 28, 2009
2008
An Echo State Network based pedestrian counting system using wireless sensor networks.
Proceedings of the International Workshop on Intelligent Solutions in Embedded Systems, 2008
2007
Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract).
Proceedings of the Knowledge Discovery in Databases: PKDD 2007, 2007
Efficient Closed Pattern Mining in Strongly Accessible Set Systems.
Proceedings of the Mining and Learning with Graphs, 2007
2004
synERJY An Object-oriented Synchronous Language.
Proceedings of the Third International Workshop on Synchronous Languages, 2004
2001
Formal Methods Syst. Des., 2001
2000
Complex Reactive Control with Simple Synchronous Models.
Proceedings of the Languages, 2000
1999
Coordination of Synchronous Programs.
Proceedings of the Coordination Languages and Models, Third International Conference, 1999
1998
The Synchronous Approach to Designing Reactive Systems.
Formal Methods Syst. Des., 1998
Proceedings of the International Workshop Tool Support for System Specification, 1998
1997
Synchronous Automata for Synchronous Programming Languages.
Proceedings of the Formale Beschreibungstechniken für verteilte Systeme, 1997
On the Combination of Synchronous Languages.
Proceedings of the Compositionality: The Significant Difference, International Symposium, 1997
1995
On the Nature of Events: Another Perspective in Concurrency.
Theor. Comput. Sci., 1995
Event Automata as a Generic Model of Reactive Systems.
Proceedings of the KORSO, 1995
1993
On the Specification of Elementary Reactive Behaviour.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993
1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
A Functorial Semantics for Observed Concurrency.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Identity and Existence, and Types in Algebra - A Survey of Sorts.
Proceedings of the Recent Trends in Data Type Specification, 1992
1991
Once More on Order-Sorted Algebras.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991
1990
A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category.
Theor. Comput. Sci., 1990
Parametrization for Order-Sorted Algebraic Specification.
J. Comput. Syst. Sci., 1990
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990
1989
Bisimulation as cointersection.
Bull. EATCS, 1989
1988
Foundations are Rich Institutions, but Institutions are Poor Foundations.
Proceedings of the Categorial Methods in Computer Science: With Aspects from Topology [Workshop, 1988
Towards a Unified Logic for Specification and Programming.
Proceedings of the 6st Workshop on Abstract Data Type, 1988. University of Berlin, Germany, 1988
1987
On the Implementation of Abstract Data Types by Programming Language Constructs.
J. Comput. Syst. Sci., 1987
A remark on variations of power domains.
Bull. EATCS, 1987
Partial Algebras, Subsorting, and Dependent Types: Prerequisites of Error Handling in Algebraic Specifications.
Proceedings of the Recent Trends in Data Type Specification, 1987
1986
On Specifications, Theories, and Models with Higher Types
Inf. Control., 1986
Error Handling as Type Checking.
Proceedings of the 4st Workshop on Abstract Data Type, 1986
1985
A Note on Distributive Laws and Power Domains.
Proceedings of the Category Theory and Computer Programming, 1985
Category Theory and Logic.
Proceedings of the Category Theory and Computer Programming, 1985
Proceedings of the Category Theory and Computer Programming, 1985
Cartesian Closure - Higher Types in Categories.
Proceedings of the Category Theory and Computer Programming, 1985
Elements of Categorical Reasoning: Products and Coproducts and some other (Co-) Limits.
Proceedings of the Category Theory and Computer Programming, 1985
1984
Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus.
Proceedings of the STACS 84, 1984
Another Look at Parameterization Using Algebras with Subsorts.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
Error Handling for Parameterized Data Types.
Proceedings of the Recent Trends in Data Type Specification, 1984
1983
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.
Proceedings of the Theoretical Computer Science, 1983
Programs over Abstract Data Types.
Proceedings of the Proceedings 2nd Workshop on Abstract Data Type, 1983
1982
On effective computations of nondeterministic schemes.
Proceedings of the International Symposium on Programming, 1982
1981
Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic Equations.
Proceedings of the Formalization of Programming Concepts, 1981
An Order Semantics for Non-Deterministic Recursive Program Schemes.
Proceedings of the GI, 1981
Context-Free Languages of Infinite Words As Least Fixpoints.
Proceedings of the Fundamentals of Computation Theory, 1981
1980
A criterion common to various continuous completions of albegras and X-categories.
Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980