Sciweavers

1376 search results - page 235 / 276
» Model-Driven Software Verification
Sort
View
C3S2E
2010
ACM
15 years 3 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
LDTA
2010
15 years 2 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
ECEASST
2008
69views more  ECEASST 2008»
15 years 2 months ago
Verifying Model Transformations by Structural Correspondence
: Model transformations play a significant role in model based software development, and the correctness of the transformation is crucial to the success of the development effort. ...
Anantha Narayanan, Gabor Karsai
FMSD
2006
83views more  FMSD 2006»
15 years 1 months ago
A Framework for Modeling the Distributed Deployment of Synchronous Designs
Synchronous specifications are appealing in the design of large scale hardware and software systems because of their properties that facilitate verification and synthesis. When the...
Luca P. Carloni, Alberto L. Sangiovanni-Vincentell...
SAC
2006
ACM
15 years 1 months ago
A new method of generating synchronizable test sequences that detect output-shifting faults based on multiple UIO sequences
The objective of testing is to determine the conformance between a system and its specification. When testing distributed systems, the existence of multiple testers brings out the...
Kai Chen, Fan Jiang, Chuan-dong Huang