Sciweavers

232 search results - page 39 / 47
» Implementing logical connectives in constraint programming
Sort
View
158
Voted
SIGSOFT
2007
ACM
16 years 4 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
CODES
2008
IEEE
15 years 5 months ago
Model checking SystemC designs using timed automata
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...
Paula Herber, Joachim Fellmuth, Sabine Glesner
126
Voted
ENTCS
2002
113views more  ENTCS 2002»
15 years 3 months ago
An Operational Semantics for Declarative Multi-Paradigm Languages
Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, n...
Elvira Albert, Michael Hanus, Frank Huch, Javier O...
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
15 years 10 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point
121
Voted
COMPSAC
2003
IEEE
15 years 8 months ago
Automated Metamorphic Testing
Usual techniques for automatic test data generation are based on the assumption that a complete oracle will be available during the testing process. However, there are programs fo...
Arnaud Gotlieb, Bernard Botella