Sciweavers

395 search results - page 7 / 79
» Program abstractions for behaviour validation
Sort
View
ECAI
2010
Springer
13 years 11 months ago
Verifying Properties of Infinite Sequences of Description Logic Actions
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
Franz Baader, Hongkai Liu, Anees ul Mehdi
INFSOF
1998
78views more  INFSOF 1998»
13 years 9 months ago
Program slices as an abstraction for cohesion measurement
Slices as an Abstraction for Cohesion Measurement Linda M. Ott Michigan Technological University James M. Bieman Colorado State University The basis for measuring many attributes ...
Linda M. Ott, James M. Bieman
ICALP
2011
Springer
13 years 1 months ago
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
Silvia Crafa, Francesco Ranzato
FSTTCS
2006
Springer
14 years 1 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
JOT
2010
144views more  JOT 2010»
13 years 8 months ago
A Tool for Specifying and Validating Agents' Interaction Protocols: From Agent UML to Maude
To achieve the multi-agent systems’ goals, agents interact to exchange information, to cooperate and to coordinate their tasks. Interaction is generally recognized as an importa...
Farid Mokhati, Brahim Sahraoui, Soufiane Bouzaher,...