Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Jan Springintveld"'
Autor:
Jan Springintveld, Marc Bezem
Publikováno v:
Journal of Functional Programming. 6:757-761
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d6102d8cdc604b84bfb623de562432c
https://doi.org/10.1017/s0956796800001969
https://doi.org/10.1017/s0956796800001969
Autor:
Jan Springintveld
Publikováno v:
Lecture Notes in Computer Science ISBN: 3540565175
For several important systems of the λ-cube we study the time-complexity of type conversion. Non-elementary lower bounds are given for the type-conversion problem for λ\(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\omega }\)and λP a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d436ffc22f67638389e8102b8062de02
https://doi.org/10.1007/bfb0037120
https://doi.org/10.1007/bfb0037120
Autor:
Jan Springintveld, Judi Romijn
Publikováno v:
IFIP Advances in Information and Communication Technology ISBN: 9781475752625
FORTE
FORTE
Test generation and execution are often hampered by the large state spaces of the systems involved. In automata (or transition system) based test algorithms, taking advantage of symmetry in the behavior of specification and implementation may substan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1c7f0c55324041f6774124af87b1b3a
https://doi.org/10.1007/978-0-387-35394-4_21
https://doi.org/10.1007/978-0-387-35394-4_21
Autor:
Ronald L. C. Koymans, Olaf Sies, Judi Romijn, Jan Springintveld, Jean R. Moonen, Loe G.M. Feijs
Publikováno v:
Testing of Communicating Systems ISBN: 9781475767018
For manufacturers of consumer electronics, conformance testing of embedded software is a vital issue. To improve performance, parts of this software are implemented in hardware, often designed in the Hardware Description Language VHDL. Conformance te
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::350b0e10a15d0dd01628f19e71b5d1b9
https://doi.org/10.1007/978-0-387-35198-8_28
https://doi.org/10.1007/978-0-387-35198-8_28
Autor:
Jan Springintveld
Publikováno v:
Higher-Order Algebra, Logic, and Term Rewriting ISBN: 9783540612544
HOA
HOA
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. We give an algorithm that, given such a problem, returns a substitution if it has a solution and fail otherwise.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3fc9913514af37b40cc236856980962c
https://doi.org/10.1007/3-540-61254-8_28
https://doi.org/10.1007/3-540-61254-8_28
Autor:
Frits W. Vaandrager, Jan Springintveld
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540616481
FTRTFT
FTRTFT
State minimization plays a fundamental role in both classical automata theory and in the theory of reactive systems. Many algorithms and results are based on the fact that for each finite automaton there exists an equivalent minimum state automaton t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3c49fd1bcff631d1c5500ca2227eeef
https://doi.org/10.1007/3-540-61648-9_38
https://doi.org/10.1007/3-540-61648-9_38
Autor:
Jan Springintveld
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540590484
TLCA
TLCA
We show that it is decidable whether a third-order matching problem in λω (an extension of the simply typed lambda calculus with type constructors) has a solution or not. We present an algorithm which, given such a problem, returns a solution for t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1512fb5daf0f087c29564ffa2d8ac40
https://doi.org/10.1007/bfb0014069
https://doi.org/10.1007/bfb0014069
Autor:
Jan Springintveld, Henri P. Korver
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540578871
TACS
TACS
We present an equational verification of Milner's scheduler, which we checked by computer. To our knowledge, this is the first time that the scheduler is proof-checked for a general number n of scheduled processes.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f1e32427e9c7bcf11a2a303d3c11ba7
https://doi.org/10.1007/3-540-57887-0_95
https://doi.org/10.1007/3-540-57887-0_95
Publikováno v:
Theoretical computer science, 254(1-2):10.1016/S0304-3975(99)00134-6, 225-257. Elsevier
We present a generalization of the classical theory of testing for Mealy machines to a setting of dense real-time systems. A model of timed I/O automata is introduced, inspired by the timed automaton model of Alur and Dill, together with a notion of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f931b8a5f2f82363e6f770364141381