1077 search results - page 79 / 216 » Introducing Software Engineering by means of Extreme Program... |
121
click to vote
SOCO
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ul...
129
click to vote
AOSD
2008
ACM
15 years 6 months ago
2008
ACM
There has been a lot of debate about the modularity of aspectoriented programs, and in particular the ability to reason about such programs in a modular way, although it has never...
131
click to vote
SCAM
2003
IEEE
15 years 9 months ago
2003
IEEE
One of the critiques on program slicing is that slices presented to the user are hard to understand. This is partly due to bad user interfaces, but mainly related to the problem t...
243
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
174
click to vote
PLPV
2009
ACM
16 years 1 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...