Sciweavers

1715 search results - page 96 / 343
» Domain-Specific Program Checking
Sort
View
IFIP
2004
Springer
15 years 7 months ago
On Complexity of Model-Checking for the TQL Logic
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
Iovka Boneva, Jean-Marc Talbot
119
Voted
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
15 years 6 months ago
Net Reductions for LTL Model-Checking
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
Javier Esparza, Claus Schröter
APSEC
1999
IEEE
15 years 6 months ago
The Quest for Correct Systems: Model Checking of Diagrams and Datatypes
For the practical development of provably correct software for embedded systems the close integration of CASE tools and verification tools is required. This paper describes the co...
Jan Philipps, Oscar Slotosch
ICDE
1997
IEEE
121views Database» more  ICDE 1997»
16 years 3 months ago
A Persistent Hyper-Programming System
We demonstrate the use of a hyper-programming system in building persistent applications. This allows program representations to contain type-safe links to persistent objects embe...
Graham N. C. Kirby, Ronald Morrison, David S. Munr...
CP
2005
Springer
15 years 7 months ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas