Sciweavers

1895 search results - page 344 / 379
» Using ATL for Checking Models
Sort
View
127
Voted
HIPC
2007
Springer
15 years 4 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CBSE
2006
Springer
15 years 4 months ago
Verification of Component-Based Software Application Families
We present a novel approach which facilitates formal verification of component-based software application families using model checking. This approach enables effective composition...
Fei Xie, James C. Browne
CONCUR
2006
Springer
15 years 4 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
107
Voted
FMCAD
2006
Springer
15 years 4 months ago
Liveness and Boundedness of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming appl...
Amir Hossein Ghamarian, Marc Geilen, Twan Basten, ...
FOSSACS
2006
Springer
15 years 4 months ago
A Logic of Reachable Patterns in Linked Data-Structures
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sag...