811 search results - page 21 / 163 » Refactoring Using Type Constraints |
ACL
2004
13 years 10 months ago
2004
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
ISSTA
1998
ACM
14 years 25 days ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
Static analyses provide the semantic foundation for tools ranging from optimizing compilers to refactoring browsers and advanced debuggers. Unfortunately, developing new analysis ...
RE
2006
Springer
13 years 8 months ago
2006
Springer
This paper introduces an information retrieval based approach for automating the detection and classification of non-functional requirements (NFRs). Early detection of NFRs is use...
ECOOP
2009
Springer
14 years 9 months ago
2009
Springer
Reusable APIs often dene usage protocols. We previously developed a sound modular type system that checks compliance with typestate-based protocols while aording a great deal of al...