Sciweavers

595 search results - page 3 / 119
» Little languages: little maintenance
Sort
View
CONCUR
2007
Springer
14 years 12 days ago
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
Martin Lange
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 6 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
QSIC
2006
IEEE
14 years 7 days ago
Control-Flow Analysis and Representation for Aspect-Oriented Programs
Aspect-oriented programming (AOP) has been proposed as a technique for improving the separation of concerns in software design and implementation. The field of AOP has, so far, f...
Jianjun Zhao
ICSE
2009
IEEE-ACM
14 years 1 months ago
Automatically capturing source code context of NL-queries for software maintenance and reuse
As software systems continue to grow and evolve, locating code for maintenance and reuse tasks becomes increasingly difficult. Existing static code search techniques using natura...
Emily Hill, Lori L. Pollock, K. Vijay-Shanker
JSC
2010
105views more  JSC 2010»
13 years 4 months ago
Programming with narrowing: A tutorial
Narrowing is a computation implemented by some declarative programming languages. Research in the last decade has produced significant results on the theory and foundation of nar...
Sergio Antoy