2007 |
14 | EE | Janis Barzdins,
Andris Zarins,
Karlis Cerans,
Audris Kalnins,
Edgars Rencis,
Lelde Lace,
Renars Liepins,
Arturs Sprogis:
GrTP: Transformation Based Graphical Tool Building Platform.
MDDAUI 2007 |
2000 |
13 | | Parosh Aziz Abdulla,
Karlis Cerans,
Bengt Jonsson,
Yih-Kuen Tsay:
Algorithmic Analysis of Programs with Well Quasi-ordered Domains.
Inf. Comput. 160(1-2): 109-127 (2000) |
1998 |
12 | EE | Parosh Aziz Abdulla,
Karlis Cerans:
Simulation Is Decidable for One-Counter Nets (Extended Abstract).
CONCUR 1998: 253-268 |
1997 |
11 | | Alvis Brazma,
Karlis Cerans:
Noise-Tolerant Efficient Inductive Synthesis of Regular Expressions from Good Examples.
New Generation Comput. 15(1): 105-140 (1997) |
1996 |
10 | | Parosh Aziz Abdulla,
Karlis Cerans,
Bengt Jonsson,
Yih-Kuen Tsay:
General Decidability Theorems for Infinite-State Systems.
LICS 1996: 313-321 |
1995 |
9 | | Karlis Cerans:
CTR: A Calculus of Timed Refinement.
CONCUR 1995: 516-530 |
8 | | Karlis Cerans,
Juris Viksna:
Deciding Reachability for Planar Multi-polynomial Systems.
Hybrid Systems 1995: 389-400 |
1994 |
7 | | Alvis Brazma,
Karlis Cerans:
Efficient Learning of Regular Expressions from Good Examples.
AII/ALT 1994: 76-90 |
6 | | Karlis Cerans:
Deciding Properties of Integral Relational Automata.
ICALP 1994: 35-46 |
1993 |
5 | | Karlis Cerans,
Jens Chr. Godskesen,
Kim Guldstrand Larsen:
Timed Modal Specification - Theory and Tools.
CAV 1993: 253-267 |
1992 |
4 | | Karlis Cerans:
Decidability of Bisimulation Equivalences for Parallel Timer Processes.
CAV 1992: 302-315 |
3 | | Karlis Cerans:
Feasibility of Finite and Infinite Paths in Data Dependent Programs.
LFCS 1992: 69-80 |
1991 |
2 | | Andrejs J. Auzins,
Janis Barzdins,
Janis Bicevskis,
Karlis Cerans,
Audris Kalnins:
Automatic Construction of Test Sets: Theoretical Approach.
Baltic Computer Science 1991: 286-359 |
1 | | Karlis Cerans,
Carl H. Smith:
Self-learning inductive inference machines.
Computational Intelligence 7: 174-180 (1991) |