#include "nusmv/core/utils/utils.h"
#include "nusmv/core/prop/Prop.h"
Go to the source code of this file.
Functions | |
void | SBmc_AddCmd (NuSMVEnv_ptr env) |
The header file for the cmd module, the user commands handling layer. | |
void | Sbmc_Cmd_quit (NuSMVEnv_ptr env) |
Adds all bmc-related commands to the interactive shell. | |
int | Sbmc_CommandCheckLtlSpecSBmc (NuSMVEnv_ptr env, int argc, char **argv) |
int | Sbmc_CommandGenLtlSpecSBmc (NuSMVEnv_ptr env, int argc, char **argv) |
int | Sbmc_CommandLTLCheckZigzagInc (NuSMVEnv_ptr env, int argc, char **argv) |
void SBmc_AddCmd | ( | NuSMVEnv_ptr | env | ) |
The header file for the cmd
module, the user commands handling layer.
AutomaticStart
Adds all bmc-related commands to the interactive shell
AutomaticEnd
void Sbmc_Cmd_quit | ( | NuSMVEnv_ptr | env | ) |
Adds all bmc-related commands to the interactive shell.
int Sbmc_CommandCheckLtlSpecSBmc | ( | NuSMVEnv_ptr | env, | |
int | argc, | |||
char ** | argv | |||
) |
Command arguments: [-h | -n idx | -p "formula" [IN context] | -P "name"] [-k max_length] [-l loopback] [-1] [-o filename]
This command generates one or more problems, and calls SAT solver for each one. Each problem is related to a specific problem bound, which increases from zero (0) to the given maximum problem length. Here "<i>length</i>" is the bound of the problem that system is going to generate and/or solve.
In this context the maximum problem bound is represented by the -k command parameter, or by its default value stored in the environment variable bmc_length.
The single generated problem also depends on the "<i>loopback</i>" parameter you can explicitly specify by the -l option, or by its default value stored in the environment variable bmc_loopback.
The property to be checked may be specified using the -n idx or the -p "formula" options.
If you need to generate a dimacs dump file of all generated problems, you must use the option -o "filename".
Command options:
-n index
-p "formula" [IN context]
formula
specified on the command-line. context
is the module instance name which the variables in formula
must be evaluated in. -P name
name
in the property database. -k max_length
-l loopback
-1
k
-o filename
For further information about this implementation see: T. Latvala, A. Biere, K. Heljanko, and T. Junttila. Simple is Better: Efficient Bounded Model Checking for Past LTL. In: R. Cousot (ed.), Verification, Model Checking, and Abstract Interpretation, 6th International Conference VMCAI 2005, Paris, France, Volume 3385 of LNCS, pp. 380-395, Springer, 2005. Copyright (C) Springer-Verlag.
int Sbmc_CommandGenLtlSpecSBmc | ( | NuSMVEnv_ptr | env, | |
int | argc, | |||
char ** | argv | |||
) |
Command arguments: [-h | -n idx | -p "formula" [IN context] | -P "name"] [-k max_length] [-l loopback] [-1] [-o filename]
This command generates one or more problems, and dumps each problem into a dimacs file. Each problem is related to a specific problem bound, which increases from zero (0) to the given maximum problem bound. In this short description "<i>length</i>" is the bound of the problem that system is going to dump out. Uses Kepa's and Timo's method for doing bmc.
In this context the maximum problem bound is represented by the max_length parameter, or by its default value stored in the environment variable bmc_length.
Each dumped problem also depends on the loopback you can explicitly specify by the -l option, or by its default value stored in the environment variable bmc_loopback.
The property to be checked may be specified using the -n idx or the -p "formula" options.
You may specify dimacs file name by using the option -o "filename", otherwise the default value stored in the environment variable bmc_dimacs_filename will be considered.
Command options:
-n index
-p "formula" [IN context]
formula
specified on the command-line. context
is the module instance name which the variables in formula
must be evaluated in. -P name
name
in the property database. -k max_length
-l loopback
-1
k
-o filename
For further information about this implementation see: T. Latvala, A. Biere, K. Heljanko, and T. Junttila. Simple is Better: Efficient Bounded Model Checking for Past LTL. In: R. Cousot (ed.), Verification, Model Checking, and Abstract Interpretation, 6th International Conference VMCAI 2005, Paris, France, Volume 3385 of LNCS, pp. 380-395, Springer, 2005. Copyright (C) Springer-Verlag.
int Sbmc_CommandLTLCheckZigzagInc | ( | NuSMVEnv_ptr | env, | |
int | argc, | |||
char ** | argv | |||
) |
Command arguments: [-h | -n idx | -p "formula" [IN context] | -P "name"] [-k max_length] [-c] [-N]
This command generates one or more problems, and calls SAT solver for each one. Each problem is related to a specific problem bound, which increases from zero (0) to the given maximum problem length. Here "<i>length</i>" is the bound of the problem that system is going to generate and/or solve.
In this context the maximum problem bound is represented by the -k command parameter, or by its default value stored in the environment variable bmc_length.
The property to be checked may be specified using the -n idx, -p "formula", or -P "property_name" options.
Completeness check, although slower, can be used to determine whether the property holds.
Command options:
-n index
-p "formula" [IN context]
formula
specified on the command-line. context
is the module instance name which the variables in formula
must be evaluated in. -P name
name
in the property database. -k max_length
-c
-N
For further information about this implementation see: T. Latvala, A. Biere, K. Heljanko, and T. Junttila. Simple is Better: Efficient Bounded Model Checking for Past LTL. In: R. Cousot (ed.), Verification, Model Checking, and Abstract Interpretation, 6th International Conference VMCAI 2005, Paris, France, Volume 3385 of LNCS, pp. 380-395, Springer, 2005. Copyright (C) Springer-Verlag.