15779 search results - page 2707 / 3156 » Change-oriented software engineering |
129
click to vote
ENTCS
2010
15 years 1 months ago
2010
mented Abstractions Matt Eldera,1 , Denis Gopanb,2 , and Thomas Repsa,b,3 a Computer Sciences Department, Univ. of Wisconsin; Madison, WI; USA b GrammaTech, Inc.; Ithaca, NY; USA ...
140
click to vote
ENTCS
2010
15 years 1 months ago
2010
s as an Abstract Domain Jacob M. Howe1,4 Dept of Computing, City University London, UK Andy King1,3,5 School of Computing, University of Kent, Canterbury, UK Charles Lawrence-Jones...
116
click to vote
ENTCS
2010
15 years 1 months ago
2010
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
138
click to vote
ENTCS
2010
15 years 1 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
133
click to vote
ENTCS
2010
15 years 1 months ago
2010
We propose an algebra of languages and transformations as a means for extending s syntactically. The algebra provides a layer of high-level abstractions built on top of languages ...