Title :
Bounds: From Parameterised to Finite-State Verification
Author_Institution :
Dept. of Inf. Process. Sci., Univ. of Oulu, Oulu, Finland
Abstract :
Bounds is a tool that enables parameterised verification by determining cut-offs for the values of parameters and generating the specification and system instances up to the cut-offs. After that, the verification can be completed by using an existing finite-state verification tool. A unique feature of Bounds is that it allows multiple and topology related parameters and terminates on every input.
Keywords :
finite state machines; formal verification; Bounds; finite-state verification; parameterised verification; Computational modeling; Cost accounting; Network topology; Safety; Topology; Vegetation; Writing; concurrency theory; cut-off; formal verification; parameterised verification; process algebra; refinement;
Conference_Titel :
Application of Concurrency to System Design (ACSD), 2011 11th International Conference on
Conference_Location :
Newcastle Upon Tyne
Print_ISBN :
978-1-61284-974-4
DOI :
10.1109/ACSD.2011.24
