Sciweavers

1700 search results - page 60 / 340
» Specifying and implementing refactorings
Sort
View
DALT
2003
Springer
15 years 9 months ago
Logic-Based Electronic Institutions
We propose a logic-based rendition of electronic institutions – these are means to specify open agent organisations. We employ a simple notation based on first-order logic and s...
Wamberto Weber Vasconcelos
ICECCS
2002
IEEE
106views Hardware» more  ICECCS 2002»
15 years 9 months ago
Validating Run-time Interactions in Distributed Java Applications
Distributed Java applications represent a large growth area in software. Validating such applications using information from runtime interactions is a challenge. We propose techni...
Sudipto Ghosh, Nishant Bawa, Sameer Goel, Raghu Re...
ASIAN
1998
Springer
133views Algorithms» more  ASIAN 1998»
15 years 8 months ago
Type Inference for First-Class Messages with Feature Constraints
Abstract. We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of...
Martin Müller, Susumu Nishimura
LICS
1992
IEEE
15 years 8 months ago
Compiler Verification in LF
We sketch a methodology for the verification of compiler correctness based on the LF Logical Framework as realized within the Elf programming language. We have applied this techni...
John Hannan, Frank Pfenning
APLAS
2003
ACM
15 years 8 months ago
Dataflow Pointcut in Aspect-Oriented Programming
A dataflow-based pointcut is proposed for aspect-oriented programming (AOP) languages. The pointcut specifies where aspects should be applied based on the origins of values. It is ...
Hidehiko Masuhara, Kazunori Kawauchi