Research Publications of Karl Meinke

Last updated: 17 January, 2011.

Major Surveys

(1) K. Meinke and J.V. Tucker, Universal Algebra, pp. 189-411 in: S. Abramsky, D. Gabbay and T.S.E. Maibaum (eds), Handbook of Logic in Computer Science: Volume 1, Oxford University Press, 1993.

(2) K. Meinke, A Survey of Higher-Order Algebra, Technical Report, UUDM 1995:39, ISSN 1101-3591, Department of Mathematics, University of Uppsala, 1995.

Edited Works

(3) K. Meinke and J.V. Tucker (eds), Many-Sorted Logic and its Applications, John Wiley, Chichester, 1993, ISBN 0471 93485 2.

(4) J. Heering, K. Meinke, B. Möller, T. Nipkow (eds), HOA '93: Proc. First Int. Workshop on Higher-Order Algebra, Logic and Term Rewriting, Lecture Notes in Computer Science 816, Springer Verlag, Berlin, 1994.

(5) E. Börger, Y. Gurevich and K. Meinke (eds), CSL '93: Proc. 7th International Workshop on Computer Science Logic, Lecture Notes in Computer Science 832, Springer Verlag, Berlin, 1994.

(6) J. Heering, K. Meinke, B. Möller, T. Nipkow (eds), HOA '95: Proc. First Int. Workshop on Higher-Order Algebra, Logic and Term Rewriting, Lecture Notes in Computer Science 1074, Springer Verlag, Berlin, 1996.

(7) M. Hanus, J. Heering and K. Meinke (eds), Proceedings of the Eigth International Conference on Algebraic and Logic Programming and the Third International Workshop on Higher-Order Algebra, Logic and Term Rewriting, ALP '97 and HOA '97, LNCS 1298, Springer Verlag, 1997. (8) C. Palamidessi, H. Glaser and K. Meinke, Proceedings International Conference in Programming Languages, Logics and Implementations of Programs, PLILP '98, LNCS 1490, Springer Verlag, 1998.

Conference Proceedings

(9) K. Meinke and J.V. Tucker, Specification and representation of synchronous concurrent algorithms, pp163-181 in: F.H. Vogt (ed), Concurrency '88, Lecture Notes in Computer Science 335, Springer Verlag, Berlin, 1988.

(10) K. Meinke, Universal algebra in higher types (extended abstract), pp. 185-203 in: H. Ehrig et al (eds), Recent Trends in Data Type Specification, Lecture Notes in Computer Science 534, Springer Verlag, Berlin, 1991.

11) K. Meinke, Equational specification of abstract types and combinators, pp. 257-271 in: E. Börger et al (eds), Proc. Computer Science Logic '91, Lecture Notes in Computer Science 626, Springer Verlag, Berlin, 1992.

(12) K. Meinke, Algebraic semantics of rewriting terms and types, pp. 1-20 in: J.L. Remy and M. Rusinowitch (eds), Proc. Third International Workshop on Conditional Term Rewriting Systems, Lecture Notes in Computer Science 656, Springer Verlag, Berlin, 1993.

(13) K. Meinke and L.J. Steggles, Specification and verification in higher-order algebra: a case study of convolution, pp. 189-222 in: J. Heering et al (eds), HOA '93, an International Workshop on Higher-Order Algebra, Logic and Term Rewriting, Lecture Notes in Computer Science 816, Springer Verlag, Berlin, 1994.

(14) B.M. Hearn and K. Meinke, ATLAS: A Typed Language for Algebraic Specifications, pp. 146-168 in: J. Heering et al (eds), HOA '93, an International Workshop on Higher-Order Algebra, Logic and Term Rewriting, Lecture Notes in Computer Science 816, Springer Verlag, Berlin, 1994.

(15) K. Meinke, Topological Methods for algebraic specification (extended abstract), pp. 368-388 in: E. Astesiano, G. Reggio and A. Tarlecki (eds), Recent Trends in Data Type Specification, Lecture Notes in Computer Science 906, Springer Verlag, Berlin, 1994.

(16) K. Meinke, Higher-order equational logic for specification, simulation and testing, pp. 124-143 in: J. Heering et al (eds), HOA '95, an International Workshop on Higher-Order Algebra, Logic and Term Rewriting, Lecture Notes in Computer Science 1074, Springer Verlag, Berlin, 1996.

(17) K. Meinke, An Axiomatic Semantics for Statecharts using Non-deterministic Synchronous Concurrent Algorithms, in: B. Möller and M. Sheeran (eds), Proc. Int. Workshop on Formal Techniques for Hardware and Hardware-like Systems, Tech. Report, Chalmers Institute of Technology, 1998.

(18) P. Abdulla, E. Ciapessoni, P. Marmo, K. Meinke and E. Rattor, FAST: an integrated tool for verification and validation of real-time system requirements, electronic proceedings publication FM99, Proc. Formal Methods Europe, Springer Verlag, 1999.

(19) K. Meinke, Validation and test case generation for MSCs using a propositional SAT solver, in S. Graaf (ed), Proc. Second International Workshop on SDL and MSCs, 2000.

(20) C. Berg, R. Ekström and K. Meinke, Automatic Test Case Generation for Option Pricing Programs, in: Proceedings of Test Congress 2000, SQE Press, London, 2000.

(21) K. Meinke, Automated Black-Box Testing of Functional Correctness using Function Approximation, pp 143-153 in: G. Rothermel (ed) Proc. ACM SIGSOFT Int. Symp. on Software Testing and Analysis, ISSTA 2004, Software Engineering Notes 29 (4), ACM Press, 2004.

(22) K. Meinke, A Stochastic Theory of Black-Box Software Testing, pp.578-595 in K. Futatsugi et al. (eds) Goguen Festschrift, LNCS 4060, Springer Verlag, 2006.

(23) S. Hu, K. Meinke, L. Huang and O. Huajiang, Fault-tolerant Fitting and Online Diagnosis of faults in SISO Processes, in: Proc. 6th IFAC Symp. on Fault detection, Supervision and Safety of Technical Processes, 2006.

(23) K. Meinke and F. Niu, A Learning-Based Approach to Unit Testing of Numerical Software, pp 221-235 in A. Petrenko et al. (eds) Proc. 22nd IFIP Int. Conf. on Testing Software and Systems (ICTSS 2010), LNCS 6435, Springer Verlag, 2010.

(24) K. Meinke, CGE: a Sequential Learning Algorithm for Mealy Automata, pp 148-162 in J.M. Sempere and P. Garcia (eds), Proc. 10th Int. Colloquium on Grammatical Inference, (ICGI 2010), LNCS 6339, Springer Verlag, 2010.

Journal Publications and Book Contributions

(25) K. Meinke, Universal algebra in higher types, Theoretical Computer Science, 100, (1992), 385-417.

(26) K. Meinke, Subdirect representation of higher-order algebras, 135-146 in: K. Meinke and J.V. Tucker (eds), Many-Sorted Logic and its Applications, John Wiley, Chichester, 1993.

(27) K. Meinke, A recursive second-order initial algebra specification of primitive recursion, Acta Informatica, 31, (1994), 329-340.

(28) P. Kosiuczenko and K. Meinke, On the power of higher-order algebraic specification methods, Information and Computation, 124, (1995), 85-101.

(29) K. Meinke, Topological methods for algebraic specification, Theoretical Computer Science, 166, (1996), 263-290.

(30) K. Meinke, A completeness theorem for the expressiveness of higher-order algebraic specifications, Journal of Computer and Systems Sciences, 54, (1997), 502-518.

(31) K. Meinke and L.J. Steggles, Correctness of Dataflow and Systolic Algorithms: using Algebras of Streams, Acta Informatica, 38, 45-88, 2001.

(32) K. Meinke, Proof Theory of Higher-Order Equations: Conservativity, Normal Forms and Term Rewriting, Journal of Computer and Systems Sciences, 67, 127-173, 2003.

(33) S. Hu, K. Meinke, R Chen, O. Huajiang, Iterative estimators of parameters in linear models with partially variant coefficients, International Journal of Applied Mathematics and Computer Science, Vol 17, No 2, 179-187, 2007.

Unpublished Reports

(34) K. Meinke, A Stochastic Calculus for Program Correctness and Software Testing, departmental report, NADA, KTH, 2004, http://www.nada.kth.se/~karlm/stochcalc.pdf. (35) K. Meinke and M. Sindhu, On the Correctness and Performance of the Incremental ID Algorithm for Learning Finite Automata, submitted for publication, 2010.

Book Collaborations

(36) H. Kleine Buning and T. Lettmann with K. Meinke (as english translator), Propositional Logic: Deduction and Algorithms, Cambridge University Press, 1999.

Book Reviews

(37) review of G. Huet (ed), Logical Foundations of Functional Programming, Journal of Symbolic Logic, 59, (1994), 1439-1441.