Sciweavers

6608 search results - page 1029 / 1322
» On the Completeness of Model Checking
Sort
View
RE
2008
Springer
15 years 6 months ago
Generating Natural Language specifications from UML class diagrams
Early phases of software development are known to be problematic, difficult to manage and errors occurring during these phases are expensive to correct. Many systems have been deve...
Farid Meziane, Nikos Athanasakis, Sophia Ananiadou
KBSE
2010
IEEE
15 years 5 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
222
Voted
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
15 years 4 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
EMSOFT
2011
Springer
14 years 6 months ago
Model-checking behavioral programs
System specifications are often structured as collections of scenarios and use-cases that describe desired and forbidden sequences of events. A recently proposed behavioral progr...
David Harel, Robby Lampert, Assaf Marron, Gera Wei...
BMCBI
2007
111views more  BMCBI 2007»
15 years 6 months ago
CATMA, a comprehensive genome-scale resource for silencing and transcript profiling of Arabidopsis genes
Background: The Complete Arabidopsis Transcript MicroArray (CATMA) initiative combines the efforts of laboratories in eight European countries [1] to deliver gene-specific sequenc...
Gert Sclep, Joke Allemeersch, Robin Liechti, Bj&ou...
« Prev « First page 1029 / 1322 Last » Next »