4719 search results - page 630 / 944 » Newtonian program analysis |
166
click to vote
LICS
2006
IEEE
16 years 23 days ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
179
click to vote
ICECCS
2005
IEEE
16 years 10 days ago
2005
IEEE
SOFL is a formal language and method for software system analysis, specification and design and it fully supports structured techniques and object-oriented techniques. AOP (Aspect...
171
click to vote
IEEEICCI
2005
IEEE
16 years 10 days ago
2005
IEEE
The paper presents a case study that investigates programmer learning during incremental program development. Dialog based protocol and protocol analysis are used to explore the l...
183
click to vote
CAV
2005
Springer
16 years 8 days ago
2005
Springer
Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer “stack-qualified queries”, which answer the question “what data...
156
click to vote
IFIP
2005
Springer
16 years 7 days ago
2005
Springer
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...