PARAMETRIC VERIFICATION AND TEST COVERAGE FOR HYBRID AUTOMATA USING THE INVERSE METHOD.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 2, p. 233, doi. 10.1142/S0129054113400091
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2013 AND VI 24 AND IP 2
Results: 8
1
2
THE COMPLEXITY OF COVERAGE.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 2, p. 165, doi. 10.1142/S0129054113400066
- By:
- Publication type:
- Article
3
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 2, p. 161, doi. 10.1142/S0129054113020024
- By:
- Publication type:
- Article
4
REACHABILITY FOR FINITE-STATE PROCESS ALGEBRAS USING HORN CLAUSES.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 2, p. 283, doi. 10.1142/S0129054113400121
- By:
- Publication type:
- Article
5
AUTOMATED TERMINATION IN MODEL-CHECKING MODULO THEORIES.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 2, p. 211, doi. 10.1142/S012905411340008X
- By:
- Publication type:
- Article
6
AN EFFICIENT FULLY SYMBOLIC BISIMULATION ALGORITHM FOR NON-DETERMINISTIC SYSTEMS.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 2, p. 263, doi. 10.1142/S012905411340011X
- By:
- Publication type:
- Article
7
LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 2, p. 251, doi. 10.1142/S0129054113400108
- By:
- Publication type:
- Article
8
MONOTONIC ABSTRACTION FOR PROGRAMS WITH MULTIPLY-LINKED STRUCTURES.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 2, p. 187, doi. 10.1142/S0129054113400078
- By:
- Publication type:
- Article