Sciweavers

213 search results - page 22 / 43
» A framework for checking proofs naturally
Sort
View
SCESM
2006
ACM
269views Algorithms» more  SCESM 2006»
14 years 1 months ago
Inferring operational requirements from scenarios and goal models using inductive learning
Goal orientation is an increasingly recognised Requirements Engineering paradigm. However, integration of goal modelling with operational models remains an open area for which the...
Dalal Alrajeh, Alessandra Russo, Sebastián ...
CADE
2008
Springer
14 years 7 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
ECOOP
2006
Springer
13 years 11 months ago
A Semantic Analysis of C++ Templates
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...
Jeremy G. Siek, Walid Taha
FMSD
1998
60views more  FMSD 1998»
13 years 7 months ago
The General Product Machine: a New Model for Symbolic FSM Traversal
Proving the equivalenceof two Finite State Machines (FSMs) has many applications to synthesis, veri cation, testing, and diagnosis. Building their product machine is a theoretical ...
Gianpiero Cabodi, Paolo Camurati, Fulvio Corno, Pa...
SIGSOFT
2007
ACM
14 years 8 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