8132 search results - page 222 / 1627 » Dependability, Abstraction, and Programming |
135
click to vote
ECLIPSE
2007
ACM
15 years 10 months ago
2007
ACM
The navigation of structural dependencies (e.g., method invocations) when a developer performs a change task is an effective strategy in program investigation. Several existing ap...
166
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
142
click to vote
HICSS
2005
IEEE
16 years 7 days ago
2005
IEEE
Abstract. We seek to distinguish Strategic design decisions (e.g., to adopt a programming paradigm, architectural style, CBSE standard or application framework) from tactical desig...
164
Voted
LPNMR
1999
Springer
15 years 11 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...