Sciweavers

4693 search results - page 732 / 939
» Verifying Hybrid Systems
Sort
View
SOFSEM
2007
Springer
16 years 12 hour ago
Improved Processing of Textual Use Cases: Deriving Behavior Specifications
The requirements for a system are often specified as textual use cases. Although they are written in natural language, the simple and uniform sentence structure used makes automate...
Jaroslav Drazan, Vladimir Mencl
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
16 years 12 hour ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
WAIM
2007
Springer
16 years 9 hour ago
The Selection of Tunable DBMS Resources Using the Incremental/Decremental Relationship
The DBMS performance might change by allocating resources and by performing a specific kind of workload. Database administrators should be able to identify relative resources that ...
Jeong Seok Oh, Hyun Woong Shin, Sang Ho Lee
CCECE
2006
IEEE
15 years 12 months ago
A Formal CSP Framework for Message-Passing HPC Programming
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
John D. Carter, William B. Gardner
CSMR
2006
IEEE
15 years 12 months ago
IntensiVE, a toolsuite for documenting and checking structural source-code regularities
As size and complexity of software systems increase, preserving the design and specification of their implementation structure gains importance in order to maintain the evolvabil...
Kim Mens, Andy Kellens