Sciweavers

2520 search results - page 127 / 504
» Model-checking behavioral programs
Sort
View
FAC
2008
100views more  FAC 2008»
15 years 29 days ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
IEE
2010
136views more  IEE 2010»
14 years 11 months ago
Assume-guarantee verification of software components in SOFA 2 framework
A key problem in compositional model checking of software systems is that typical model checkers accept only closed systems (runnable programs) and therefore a component cannot be ...
Pavel Parizek, Frantisek Plasil
LPAR
2012
Springer
13 years 8 months ago
Lazy Abstraction with Interpolants for Arrays
traction with Interpolants for Arrays Francesco Alberti1 , Roberto Bruttomesso2 , Silvio Ghilardi2 , Silvio Ranise3 , Natasha Sharygina1 1 Universit`a della Svizzera Italiana, Luga...
Francesco Alberti, Roberto Bruttomesso, Silvio Ghi...
APAL
2006
112views more  APAL 2006»
15 years 29 days ago
On complexity of verification of interacting agents' behavior
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...
SIGSOFT
2007
ACM
16 years 1 months ago
State coverage: a structural test adequacy criterion for behavior checking
We propose a new language-independent, structural test adequacy criterion called state coverage. State coverage measures whether unit-level tests check the outputs and side effect...
Ken Koster, David Kao