Sciweavers

1601 search results - page 113 / 321
» The affordable application of formal methods to software eng...
Sort
View
C3S2E
2010
ACM
13 years 10 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
WER
1999
Springer
14 years 1 months ago
An Object Oriented Library for Tracing Requirements
We present the overall design of an object-oriented library for use when developing tracing capable applications. The library is implemented as java classes and consists of de niti...
Francisco A. C. Pinheiro
ICFP
2003
ACM
14 years 9 months ago
Software is discrete mathematics
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
Rex L. Page
ICFCA
2007
Springer
14 years 1 months ago
Performances of Galois Sub-hierarchy-building Algorithms
Abstract. The Galois Sub-hierarchy (GSH) is a polynomial-size representation of a concept lattice which has been applied to several fields, such as software engineering and linguis...
Gabriela Arévalo, Anne Berry, Marianne Huch...
AVI
1996
13 years 10 months ago
Closing the loop: modelling action, perception and information
Visual interfaces to computer systems are interactive. The cycle of visual interaction involves both visual perception and action. This paper examines formal models of interactive...
Alan J. Dix