Sciweavers

1167 search results - page 183 / 234
» A Really Temporal Logic
Sort
View
ECBS
2006
IEEE
135views Hardware» more  ECBS 2006»
15 years 5 months ago
Model Checking Procedures for Infinite State Systems
The paper depicts experiments and results with preditraction based verification applied to infinite state Predicate abstraction is a method for automatic tion of abstract state sp...
Nikola Bogunovi, Edgar Pek
FSTTCS
2006
Springer
15 years 5 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...
CONCUR
2000
Springer
15 years 5 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
EDBT
2000
ACM
15 years 5 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
ICSE
2000
IEEE-ACM
15 years 5 months ago
A formal approach for designing CORBA based applications
The design of distributed applications in a CORBA based environment can be carried out by means of an incremental approach, which starts from the specification and leads to the hi...
Matteo Pradella, Matteo Rossi, Dino Mandrioli, Alb...