Jakub Chaloupka

11 papers A* 1A 1C 1Journal 4Unranked 4

Year	Rank	Type	Title / Venue / Authors
2013	J	`jnl`	Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P. Fundam. Informaticae Jakub Chaloupka
2012	J	`jnl`	Using Strategy Improvement to Stay Alive. Int. J. Found. Comput. Sci. Lubos Brim, Jakub Chaloupka
2011	J	`jnl`	Distributed Algorithms for SCC Decomposition. J. Log. Comput. Jiri Barnat, Jakub Chaloupka, Jaco van de Pol
2011	J	`jnl`	Faster algorithms for mean-payoff games. Formal Methods Syst. Des. Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin
2010	—	`conf`	Using Strategy Improvement to Stay Alive GANDALF Lubos Brim, Jakub Chaloupka
2010	—	`conf`	Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P. RP Jakub Chaloupka
2009	—	`conf`	Faster Algorithm for Mean-Payoff Games. MEMICS Jakub Chaloupka, Lubos Brim
2009	A	`conf`	Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation. ESA Jakub Chaloupka
2007	—	`conf`	Improved Distributed Algorithms for SCC Decomposition. PDMC@CAV Jiri Barnat, Jakub Chaloupka, Jaco van de Pol
2004	C	`conf`	From Distributed Memory Cycle Detection to Parallel LTL Model Checking. FMICS Jiri Barnat, Lubos Brim, Jakub Chaloupka
2003	A*	`conf`	Parallel Breadth-First Search LTL Model-Checking. ASE Jiri Barnat, Lubos Brim, Jakub Chaloupka

test_files/hello_advanced.c

← Index test_files/hello_advanced.c c

#include <stdio.h>

void greet(const char* name) {
    printf("Hello, %s!\n", name);
}

int add(int a, int b) {
    return a + b;
}

int main() {
    greet("World");
    int result = add(5, 3);
    printf("5 + 3 = %d\n", result);
    return 0;
}