Sciweavers

501 search results - page 55 / 101
» Using Abstraction to Verify Arbitrary Temporal Properties
Sort
View
ASE
2008
102views more  ASE 2008»
14 years 9 months ago
Model driven code checking
Model checkers were originally developed to support the formal verification of high-level design models of distributed system designs. Over the years, they have become unmatched in...
Gerard J. Holzmann, Rajeev Joshi, Alex Groce
ICFEM
2010
Springer
14 years 8 months ago
Automating Cut-off for Multi-parameterized Systems
Abstract. Verifying that a parameterized system satisfies certain desired properties amounts to verifying an infinite family of the system instances. This problem is undecidable ...
Youssef Hanna, David Samuelson, Samik Basu, Hrides...
FSEN
2009
Springer
15 years 4 months ago
Automated Translation and Analysis of a ToolBus Script for Auctions
Abstract. ToolBus allows to connect tools via a software bus. Programming is done using the scripting language Tscript, which is based on the process algebra ACP. In previous work ...
Wan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. ...
CIBB
2008
14 years 11 months ago
Stability and Performances in Biclustering Algorithms
Abstract. Stability is an important property of machine learning algorithms. Stability in clustering may be related to clustering quality or ensemble diversity, and therefore used ...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
ENDM
2010
86views more  ENDM 2010»
14 years 9 months ago
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...