86 search results - page 7 / 18 » Thorough Checking Revisited |
SBMF
2010
Springer
13 years 2 months ago
2010
Springer
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
ICSE
1999
IEEE-ACM
13 years 12 months ago
1999
IEEE-ACM
Formal verification methods are used only sparingly in software development. The most successful methods to date are based on the use of model checking tools. To use such he user ...
TASE
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
DBPL
2007
Springer
13 years 11 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...