Sciweavers

583 search results - page 105 / 117
» Reasoning in Logic about Continuous Systems
Sort
View
82
Voted
EMSOFT
2006
Springer
15 years 1 months ago
Software partitioning for effective automated unit testing
A key problem for effective unit testing is the difficulty of partitioning large software systems into appropriate units that can be tested in isolation. We present an approach th...
Arindam Chakrabarti, Patrice Godefroid
FTCS
1998
144views more  FTCS 1998»
14 years 11 months ago
Improving Software Robustness with Dependability Cases
Programs fail mainly for two reasons: logic errors in the code, and exception failures. Exception failures can account for up to 2/3 of system crashes [6], hence are worthy of ser...
Roy A. Maxion, Robert T. Olszewski
77
Voted
LISP
2008
105views more  LISP 2008»
14 years 9 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
TOPLAS
2002
98views more  TOPLAS 2002»
14 years 9 months ago
Data abstraction and information hiding
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
K. Rustan M. Leino, Greg Nelson
ICDT
2009
ACM
175views Database» more  ICDT 2009»
15 years 10 months ago
Structural characterizations of schema-mapping languages
Schema mappings are declarative specifications that describe the relationship between two database schemas. In recent years, there has been an extensive study of schema mappings a...
Balder ten Cate, Phokion G. Kolaitis